OJ Board

I think this is a simple adhoc problem.....
but i got TLE in the contest :(
can any one give me any clue.....

thanx for advance.

For solve this problem, i'm used Suffix Tree to find words, for example 'a abba a c a' = 1 2 1 3 1, and with this I know the max number of different words = 3 in ...

I got too many WA in this prob. here i post my code. Anyone please help me..

// CODE


Input:

10 10
3 9 380 28471 29141 12245 0 5957 57 8535
5 9582 224 8649 2763 7 63 42 4462 0
11616 0 4647 4099 5 11 30991 0 32585 1
7 0 16 0 363 0 0 10947 1 31210
0 13 48 5997 8734 325 424 0 5949 18088
146 0 7 ...

From the problem statement:

In the first line you will find N (0 <= N <= 500)

But in the first line of sample input I see 5 5
Assuming that the problem desription is good I've got RTE for my program. It indicates that the description is wrong. It's really confusing, what is the second number ...

Basic algorithm is breadth-first search.
You can use some data structure (linked list, or segments tree) to improve it, so that its overall running time will depend on the number of forbidden pairs or intervals, instead of the total number of edges.

yes, I think in that, but a don't know how to ...

any hint ?? I don't understand , How to solve it ?

I suppose, I am wrong , but , I don't know

EonStrife wrote:Any help for me ? I already posted my source code (check two posts above)
Thanks.

after read get of mod

scanf("%d", &A[x][y]);
A[x][y] %= 10;

because 10000000 x 10000000 > int


sorry for my english

someone can give me critical cases?

please :( :( :( :(


# include <stdio.h>
# include <string.h>

char set;

long long hash[1000];
long long dup[1000];
int cmb(int num, int k){ return ( (num % k) + k ) % k; }
char flag[20000001];

int min(int a , int b){ return a < b ? a : b; }
int max(int a ...

My Accepted Output is :


Case 1: 4957
Case 2: 2
Case 3: 5
Case 4: 18
Case 5: 48400
Case 6: 10
Case 7: 22
Case 8: 29
Case 9: 1
Case 10: 258
Case 11: 16
Case 12: 18


More Input:


20

200
2 5 1 1 1 5 3 5 1 7 5 7 2 1 5 4 7 7 3 1 2 1 1 3 7 3 4 4 3 1 7 5 2 6 5 2 5 1 2 5 2 6 5 2 1 2 1 7 6 4 5 3 5 1 6 ...

Try This:

1
165
1 2 3 2 1 1 5 1 1 1 1 10 1 4 4 41 4 4 1 43 4 4 4 41 4 4 42 4 4 1 13 1 1 1 2 3 2 1 11 1 1 1 1 1 19 1 4 4 41 4 4 1 4 34 4 4 24 4 4 4 4 4 11 1 1 1 1 21 3 2 1 12 1 1 1 1 15 1 1 44 4 4 4 4 1 4 41 4 4 14 4 4 4 4 4 12 1 1 1 1 20 3 2 1 1 1 1 1 1 1 1 1 4 4 4 4 4 1 4 4 4 4 4 4 4 4 4 4 1 1 1 ...

input:
100
-10+2+2
Correct output
100.000
-6.000
your output is
0.000
4.000

INPUT My AC Output

input

A:BD;C:BD;F:E;G:DEH;H:EG. A H
E:AB. A B
B:ACD. B D
A:B;B:C;D:E. A D
A:A. A A
A:B. A B
A:B. B A
A:B. C C
A:B. C D
A:B;C:BDE;F:EG;G:H. A H
A:B;C:BDE;F:EG;G:H. A G
A:B;C:BE;F:EG;G:H. A G
A:B;C:BDE;F:EG;G:H. H C
A:B;C:BDE;F:EG;G:H. B H
A:B;C:BDE;F:EG;G:H. B E
A:B;C:BDE;F:EG;G:H. C ...

Input


2
5
Puebla Mexico Queretaro Durango San_Pedro
2 3 0 1 1
3 0 2 0 0
1 1 0 0 0
0 0 0 0 0
0 0 0 0 0
2
Nalley Puebla Puebla
Xuxa Mexico Mexico
3
hola como estas
2 3 0
3 0 2
0 1 0
2
Pedro hola como
Juan como como


Output (Solution AC):


Mr Nalley to go from Puebla to Puebla, you will receive ...

Directions =D