OJ Board

Judge data is week ,try submitting in TIMUS: http://acm.timus.ru/problem.aspx?space=1&num=1303

ans:2

i got stuck for this little case for hours

I hope the case below will help you if you get wa: 20 1 2 3 1 3 12 13 12 3 11 11 14 2 8 2 9 9 10 4 3 4 16 4 17 17 18 19 18 19 20 3 5 5 6 7 5 5 15 15 9 15 12 13 14 11 1 3 10 1 20 6 7 5 5 11 5 14 8 12 10 15 10 3 4 3 17 3 18 1 The fleas jump forever between 1 and 3. The fleas jump forever between 12 an...

Why you need "Knuth-Moris-Pratt"? string length is 1000,a n^2 checking can do it for you.

With same code i got ac in spoj,live archive but getting TLE in uva. why??

I got wa in a case where n==0,make sure u handle it properly. its a simple bitmask bfs problem

No need of factorization,gcd etc,this problem can be solved by brute force with some little clever pruning.

Probably there is something weird about the judge input. I took all inputs with gets,removed trailing and leading spaces,and finally got ac. ""No lines contain leading or trailing blanks. "" is not correct.

I just read the html and got ac.

try this case,you may find your bug output: You can start or stop running at any node,but you cant run THROUGH a castle.

try this case: output from my ac code:

The description is not good though its a nice problem. You need to find the largest connected component with highest average PPA in this problem. And you will get the highest average only if you take the max weight edges .

try this:
output:

Problem setter should have mentioned that number of destination==number of boxes.

Jan vai's i/o giving me segment fault in my ac code.