OJ Board

Can anyone explain why this idea is not working? My idea was very simple. I used bfs. 1. I use a three dimensional array such as cost[number of treasures collected yet][row][column]; 2. Visit every position and if there is a treasure in that position yet to be collected... collect it and if possible...

I did a silly mistake in my code and for that reason my code failed in such a simple test case: My code returns "NO".
But I got AC. Don't know why?

I don't understand how this thing could be a deadlock X-b-X My AC code does not considered this as a deadlock but in the previous posts it is considered as a deadlock........ Here b is assigned to X and X needs b. How could it be a deadlock? :o I think the input set is not good enough for this probl...

I am very poor in backtracking...... trying to learn...... I am getting WA again and again...... My code works for the sample inputs given here........ Can someone provide me some more test cases please? It will be very helpful. Here is my code: #include<iostream> #include<cmath> #include<cstring> #...

Can anyone tell me how to model this kind of graph into a two dimensiomal graph...... I dont get it............

Can anyone give me some test cases please? I am getting WA........ Someone help

Can anyone give me some critical test cases? I am getting WA.... Here is my code:

Can anyone say what does this line in the problen description means.. I don't get it

You may assume the subway runs in a straight line between adjacent stops, and the coordinates represent an integral number of metres.

Help will be appreciated. Thanks

I am not sure how to solve this problem. Can anyone tell me about a general approach? Is it possible to solve this problem with bfs or dijkstra? Someone reply please... thanks in advance

Can anyone give me some ideas about how to solve this problem......... Someone please reply

I don't understand one thing. In the problem description it is said that It is granted that a freedom fighter group can fight only one opponent group at a time. So why there are inputs like these in the previous posts?? Can anyone tell me? 10 ......**** .***.*BBBB PPPP*.BPPP BBBB*..BBB PPPP*.***B **...

Can anyone give me some more critical test cases? I am getting WA and I can't find my error. Someone please help.....
Here is my code:
AC
Here is a test case: The output should be:
-1
Hope it helps

My code is getting TLE. Is there anyone who can check my code please????

Here is my code. Can anyone tell me what is wrong here? I am getting WA..please help. Please someone reply........

Can anyone help me with some critical input? I am continuously getting WA. Please help.....