OJ Board

This hint is really helpful and gits fast gives the whole solution.
I write my solution after reading this hint, got AC, but it takes 1.340s which is much longer than most of others. So i think it should be solved in a o(n^3) algo. Someone has said it can be done with DP,but i can' t catch that.

I used dijkstra algo, and it passes all available input, but I still got WA. I really don't know what may be wrong, hope someone can help,please! I post my code here, after I find the mistake I will cut it. Thanks in advance. #include <stdio.h> #include <string.h> int main(void) { int t,n,m; int i,j...

Hi, I also solved it with back-tracking. But how can i approach this problem with max-flow??
Could anyone give me any hints ?
what's the weight of edge and source and sink ??

Thanks in advance!

or you assign too high value Thanks Arsalan, but I didn't assign a big value instead of -1, but judge each time if the distance is -1 or not. but maybe you do some thing wrong in printing the path I saved the "parent vertex" of each vertex, and then my print algo seems like: print(startVertex); k= ...

My code also passes all i/os here,but i still got WA. Could anyone give some more i/os?

It is a simple shortest-path problem, right ??

Thanks Martin Macko!

I used the latter too and got finally AC, I had made a careless mistake by reading input.

Thanks!

i did %m everytime So did I! To make sure that each element saved in my table is smaller than MAXINT and so that product of two 4B integers cannot exceed a 8B integer and this product %m is once again smaller MAXINT and so on. my dp algo is following: f[n][k] is the fitness of k numbers from a[1..n...

Try to use 64bit integers like long long int in C. I have tried with long long int, but got still WA, and my code passes the input above, maybe I miss some tricky cases(if any?). Can someone give me the output for following input? 2 2147483647 2147483646 2147483646 3 2147483647 2147483646 214748364...

I got WA in 0.6s. I think it is because that product of two very large integers is larger than MAXINT. And i tried use a double and then change to integer, it seems not enough precise. Can anyone give any hints for that ? How i can save that big number correctly or avoid saving such big number?? Tha...

..my code has passed all the inputs above, but i still got WA. Is there any tricky cases ??... I feel helpless..

To Timo and sohel: Thanks for the idea, I will try once again in the next few days!! :lol: :oops: To Jan: :wink: It seems that I am lucky. Well I can also try once again to submit with my current solution after u set a new input file and to see if your input is good enough 8) 8) I got ACC by using a...

Why 9 nested loop, I used only 7 nested loop, and other 9 numbers can be calculated from the 7 numbers. But I got WA, I don't know why.
Can someone help me ???

I need some more I/O. PLZ Help.
And I used a ugly method and got WA at about 2 CPU time, which already exceeded the contest time constraints. Any hint I will also be appreciate.

Thanks.

ooops... :oops: no you don't have time to generate all the permutations. One hint: Look at the AC times of everyone.. most 0.00 sec(and that's without precalculation) Hope i am talking about the right problem this time... :D I have got accepted :lol: I think people have solved in the same way I did...

Well my code used 5.070 CPU time. And I use a o(n^2) algorithm,
and i see the ranklist almost all codes run under 1 CPU time, how can i do that? can anyone suggest any better ones ?