OJ Board

I wrote the code for this problem. I dont know why I am getting RunTime Error #include<cstdio> #include<cstring> #include<vector> #include<stack> #include<queue> #define MAXLEN 500 #define INF 1000000000 using namespace std; vector<vector<int> > graph; int parent[MAXLEN][MAXLEN],dist[MAXLEN][MAXLEN]...

Hii, I am getting WA for this problem. Following is my code :- #include<cstdio> #include<string> #include<map> #include<iostream> #include<vector> #include<climits> #include<queue> #include<sstream> #define MAXLEN 210 using namespace std; map<string,int> mp; vector<vector<int> > graph; int dist[MAXL...

The following code is getting a WA. Plz help #include<cstdio> #include<vector> #include<climits> #include<queue> #define MAXLEN 20010 struct node { int data,weight; }; class compare { public: bool operator()(const node& a,const node& b) { return a.weight>b.weight; } }; using namespace std; p...

Thanx brianfry713

It is written that every trap sends a draft to its adjacent(top, bottom,left, right) location. Does this mean that if there is a gold at the draft postion , it should not be counted? If not, then please explain with respect to examples given in the question. As far as I can understand, in these exam...

Thanx brianfry713.

Still getting WA...

Accepted

Thanx lighted

I am continuosly getting WA for the following code. I am using BFS and adjacency list in my algorithm. It is giving the right output for all the sample cases given in this forum. #include<cstdio> #include<cstdlib> #include<queue> using namespace std; typedef struct linked_list { int data; struct lin...

Oops !!! such a silly mistake.

I am not getting the required output for this problem. Here is my code:

Can someone plz tell me the algorithm for this problem ? Thanx in advance

Thanx ... got accepted

But will u plz explain what was the probelm with my logic?

I am getting the following output ... not the one you said

4
4
5
9
1

which matches the following:

1000
1100
2000
6008