OJ Board

I have used the input given earlier in this thread: 16 0 1 14 1 0 1 24 1 0 1 74 1 25 67 3 1 98 25 1000000000 1 0 1 9842 2 34 88 224242 2 100 100 10 2 56 24 83943 3 89 14 983821 3 1 100 1000000000 4 45 64 999999999 4 0 0 100000 4 100 90 0 4 41 67 1 3 55 89 2 4 and I am getting expected out as well, s...

here's my modified code http://ideone.com/2rmUXu, it gives the same output as yours, still WA.

Hi, my code runs fine on the inputs that you prepared, still I got WA.Can you please check my code --> http://ideone.com/kevO4T ?
Thanks.

How to find the best roots for this problem?

here is the problem statement: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=540 Can I solve it in this manner? First count the no. of vertices and edges in the graph. Then using a bitset of size 26 , mark the vertices whic...

hi Brianfry713, for the 2nd-last test case in your sample test input, shouldn't the value of penalty for 69 be 120 instead of 100 ? because the question says that 20 min will be added to the penalty for each incorrect solution prior to the correct solution.

I have added the new line , still it says WA. here's the modified code: http://ideone.com/evOPNK

brianfry713, my code gives the same output as expected on the sample test that you gave. I checked it using the 'diff' command in linux. But on submission I got WA, can you please help me know what is wrong? I have commented my code .It is here : http://ideone.com/uMYQpa

I too have a doubt on this question. for input: 2 3 UCM 2 3 UAM 1 2 UPM 2 2 0 0 the AC output is 3 problems. Shouldn't there be 5 problems? which are.. 1.) paper 1 reviewed only once. 2.) paper 3 reviewed only once. 3.)paper 2 reviewed more then twice (in total). 4.)paper 2 reviewed more then once b...

@brianfry No. I did not get AC for this code. It shows WA.Can please you look into the code and tell if you find anything wrong?

There are a few common pitfalls in this problem.Be sure to check the following: 1.)Between two input test cases, there is a blank line. 2.)There is EOF at the end of the last case , not a blank line. 3.)The names of the trees should be sorted in the output. 4.)Output cases should be separated by a p...

This gives the correct answer to all the test cases. Also, it works fine if the length of the train is 0. But on submission I got RE .Can someone help me know the possible reason for the RE. import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.Inpu...

I have rectified that problem ,it gives the correct answer to cases like you suggested but the OJ gives a RE .Is there something wrong in the logic of the program? Here's the code : //package pkg12516_java; import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; imp...

My code for 12516 gave all the correct outputs on my machine but on submission,got Runtime Error at 0 sec( does that mean the program did not even run on the online compiler? ). Could someone tell me where is the code incorrect ? //package pkg12516_java; import java.io.BufferedReader; import java.io...

I have a had a few times when my queries slipped unnoticed on the chat.I didn't get any reply for sometime today so I thought may be it was better to post the doubt here.