OJ Board

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 ...

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

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 ...

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 ...

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 ...

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 ...

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 =)

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

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 ...