1,Don't care the K,ignore the K!=2.
2,two-way road.
3,the answer will be too long,so you should use long string.

I have got many WA but I'don't know why .. I test my program and compare output test with CEOI1999 and have only one difference .. My find sometimes no the same path.  not for example 23 54 56 34  but 56 34 23 54 ... this can be reason for WA?

Edited by author 10.06.2010 10:43

Edited by author 10.06.2010 10:43

I read input using
while (scanf("%d", &n) != EOF)
{
...
}
to be able to run multiple tests. I had TLE 51 with such code.
But when i deleted this cycle, i got accepted. Please check test 51.

1) the exponent may be very large (absolute value). e.g. -100000000000000000000000000000000000.
2) the exponent may pretend to be very large, but actually not. e.g. 000000000000000000000000000000000010
3) 12.e1 is not a valid floating point number, because the dot cannot be the last character of the integral part according to the grammar mentioned.

good luck

Edited by author 01.06.2010 16:05

I solve the system by the Gauss method, but the 16-th test he passes.
Then I tried to take first the Gauss method and the results of the initial matrix method of Seidel (iterative algorithm), but it does not always converge and the result becomes invalid even before the 16-second test.
What is there a problem?

I've tried the heap one, I've done everything I could, but still TLE. I guess there should be some tricky part or my implementation error.

what have you guys done to avoid the TLE?

I use heap to arrange the time, everytime there is a new timestamp that is different from the last one, I check the heap and delete the out-of-time nodes.

I also use a bool array to record the existance of a node, as well as a link table to record the next label that can be used. I don't know why I got TLE all the time...

#include<stdio.h>
#include<iostream>
using namespace std;

char s[10001],str[80];
int main()
{

#ifndef ONLINE_JUDGE
   freopen("input.txt", "rt", stdin);
   freopen("output.txt", "wt", stdout);
#endif

         int j = 0;
         memset(s,'\0',sizeof(s));
        while(gets(s))
        {
                int len = strlen(s);
                int i = 0;
                while(i<len)
                {
                        if(s[i]=='>')
                        {
                                j++;
                                if(j>79)j=0;
                        }
                        else if(s[i]=='<')
                        {
                                j--;
                                if(j<=0)j=0;
                        }
                        else if(s[i]!='\n' && s[i]!='\0')
                        {
                                str[j] = s[i];
                                j++;
                        }
                        i++;
                }

                memset(s,'\0',sizeof(s));
        }
for(int i = 0;i<80;i++)
printf("%c",str[i]);

return 0;
}

New tests have been added. 91 authors have lost AC after rejudge. Thanks to Sergey Kopeliovich.

you should find nearest prime number to J if the number doesnt exist you should find odd number because even number's divisor sum is bigger:)

Edited by author 30.05.2010 18:53

Edited by author 30.05.2010 18:53

Edited by author 30.05.2010 18:54

var
a,c,b : array[1..10000]of longint;
var n : longint;

procedure sort(m,t:longint);
var y,i,j,w:longint;
begin
    i:=m;j:=t;y:=a[(m+t)div 2];
    repeat
         while a[i]<y do inc(i);
         while a[j]>y do dec(j);
         if i<=j then begin
             w:=a[i];a[i]:=a[j];a[j]:=w;
             inc(i);dec(j);
         end;
    until i>j;
    if i<t then sort(i,t);
    if m<j then sort(m,j);
end;

PRocedure red;
var
i,j : longint;
begin
  readln(n);
    for i:=1  to n do
       read(a[i]);

sort(1,n);
end;

{=-=================}
PRocedure get;
var
i,sum1,sum2 : longint;
begin
sum1:=a[n];
sum2:=0;
   for i:=n-1  downto 1 do
   begin
      if sum1>=sum2 then
         begin
            sum2:=sum2+a[i];
         end
         else
         begin
           sum1:=sum1+a[i];
         end;
   end;
   writeln(abs(sum1-sum2));
end;

{=-=================}
BEgin
    red;
    get;
end.

import java.util.Scanner;

public class Queue {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        koor A[] = new koor[50];
        int i, j, st;
        int vaxt = 0;
        int temp, temp1, temp2;
        int max = 0;
        int N = input.nextInt();

        for (i = 1; i <= N; i++) {
            A[i] = new koor();
            A[i].T1 = input.nextInt();
            A[i].T2 = input.nextInt();
            A[i].T3 = input.nextInt();
        }


        for (i = 1; i <= N - 1; i++) {

            for (j = 1; j <= N - 1; j++) {

                if (A[j].T1 > A[j + 1].T1) {

                    temp = A[j].T1;
                    A[j].T1 = A[j + 1].T1;
                    A[j + 1].T1 = temp;

                    temp1 = A[j].T2;
                    A[j].T2 = A[j + 1].T2;
                    A[j + 1].T2 = temp1;

                    temp2 = A[j].T3;
                    A[j].T3 = A[j + 1].T3;
                    A[j + 1].T3 = temp2;

                }
            }
        }


        st = A[1].T1 + A[1].T2;

        if (st > A[1].T3) {
            vaxt = st - A[1].T3;
        }
        for (i = 2; i <= N; i++) {

            if (st > A[i].T1) {
                st += A[i].T2;
                if (st > A[i].T3) {
                    vaxt = st - A[i].T3;
                }
            } else {
                st = A[i].T1 + A[i].T2;
                if (st > A[i].T3) {
                    vaxt = st - A[i].T3;
                }
            }
            if (vaxt > max) {
                max = vaxt;
            }

        }
        System.out.println(max);
    }
}

class koor {

    int T1;
    int T2;
    int T3;
}

Edited by author 30.05.2010 15:45

help, please

The only input line contains two integers separated with a space: N and K (0 < N ≤ 109, 1 < K ≤ 109).
and There's a Test case with K = 1 which made me got 2 wrong answer...So funny

could anyone tell me,what is test 1 in 1014 ?

4 6
1 2 2
2 3 2
3 4 2
4 1 2
1 3 1
2 4 1
Cost: 4
Cost: 4
1:
why not 1>4(cost 2, minimum. Description says if transition between A > B is possible then B > A is possible too)
That gives answer: 2
2:1>3(cost 1) then 3>4(cost 2), 1+2=3
That gives answer: 3

Anyone mind explaining why its 4 and 4 in sample?

Anybody knows?

Edited by author 25.05.2010 20:52