Search found 9 matches

by back_tracker
Sat Aug 06, 2011 12:44 am
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 39322

Re: 929 - Number Maze

hey Guys, my code gives wrong output for some test cases. I hope you guys help me finding the bug. I am using dijkstra algorithm #include<iostream> #include<vector> #include<string> #include<algorithm> #include<queue> using namespace std; int main () { int test; cin>>test; for(int t =0; t <test; t++...
by back_tracker
Sun Jul 24, 2011 12:57 am
Forum: Volume 108 (10800-10899)
Topic: 10801 - Lift Hopping
Replies: 56
Views: 26103

Re: 10801 - Lift Hopping

what's the output of this input ??

2 99
10 40
1 2 3 4 99 0 12
3 4 2 0 12 99


my code gives 990
by back_tracker
Thu Jul 21, 2011 3:30 pm
Forum: Volume 5 (500-599)
Topic: 572 - Oil Deposits
Replies: 39
Views: 15758

Re: 572 WA :-(

easy problem, solve it using DFS Hi, This is an automated response from UVa Online Judge. ...Your submission with number 9066985 for the problem 572 - Oil Deposits has succeeded with verdict Accepted. Congratulations! Now it is time to try a new problem. Best regards, The UVa Online Judge team :P :P...
by back_tracker
Wed Jul 13, 2011 1:53 pm
Forum: Volume 101 (10100-10199)
Topic: 10131 - Is Bigger Smarter?
Replies: 93
Views: 63567

Re: 10131 - Is Bigger Smarter?

Hi, This is an automated response from UVa Online Judge. Your submission with number 9045104 for the problem 10131 - Is Bigger Smarter? has succeeded with verdict Accepted. Congratulations! Now it is time to try a new problem. Best regards, The UVa Online Judge team "Every thing should be done simpl...
by back_tracker
Tue Jun 28, 2011 4:39 pm
Forum: Volume 5 (500-599)
Topic: 565 - Pizza Anyone?
Replies: 12
Views: 4100

Re: 565 Pizza Anyone?

Guys, I really need help and I am sure all of you can answer my question. I solved the problem and everything works fine. The problem is that how can I determine the end of the test cases I have, There is no specific number of test cases for this problem so How many test cases should I provide??????...
by back_tracker
Thu Jun 23, 2011 1:00 pm
Forum: Volume 6 (600-699)
Topic: 639 - Don't Get Rooked
Replies: 11
Views: 9011

Re: 639 - Don't Get Rooked

Hi, This is an automated response from UVa Online Judge. Your submission with number 8980068 for the problem 639 - Don't Get Rooked has succeeded with verdict Accepted. Congratulations! Now it is time to try a new problem. Best regards, The UVa Online Judge team WOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...
by back_tracker
Thu Jun 23, 2011 4:54 am
Forum: Volume 6 (600-699)
Topic: 639 - Don't Get Rooked
Replies: 11
Views: 9011

Re: 639 - Don't Get Rooked

That's a critical test case!!!

4
..X.
.X..
..X.
...X

the answer should be 6
I am getting 7, dunno why. i am gonna solve the problem tomorrow. For now, I am so sleepy so gd night everyone =)
by back_tracker
Sun Jun 19, 2011 8:46 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 20211

Re: 193 Graph Coloring

Kallol, I really liked your code because it's very fast....I think your mistake is that you specify the size "105" for bool a and color. Maybe sometimes it needs more space than that, so maybe it should be moe general. good luck
by back_tracker
Sun Jun 19, 2011 12:10 am
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 20211

Re: 193 Graph Coloring

Hellow Guyssssssssssssssssssssss it can be solved using back tracking algorithm. 1- check if u have the complete solution that is checking if you have colored all the nodes. 2- if yes, then save the information which are how many black nodes u have and what they are, 3- else, go to the next node and...

Go to advanced search