OJ Board

I'm getting WA for this problem..I've tried all I/O posted here,and my code gives correct output for them..cannot find the bug,anyone please help kindly :( #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int cars[205]; int sum[205]; int L,N,Max; int DP[205][100*100+5]; in...

I'm getting WA for this problem,I used Havel Hakimi algorithm,first checked for negative and odd number of odd degrees,then within a loop decremented the degrees according to the algorithm.I can't get what went wrong,I even checked with test inputs,and it passed..someone please help :( got AC after ...

Thanks,Got AC..a stupid mistake in loop..

Can anyone help??I'm getting WA in this problem...please help

I'm getting WA in this problem..What I did is setting ans initially to zero..then checking every bit starting from MSB,if its zero,then set that bit in "ans",and check whether the new ans is smaller than upper limit,if yes,then set that bit,otherwise didn't set.When 1 found in any bit,made...

I'm getting WA for this problem,can anyone help?I think here state is 3D,x,y component of grid,and the directions to which it is possible to go from a greed..so I used a 3D bool array of this dimension [505][505][18] to keep record of visited nodes..I though,there can b 16 combinations of directions...

but here STL priority queue gives tle,what to do?

Can anyone please help me to get in runtime for this problem?What can I do to get it in runtime?

I'm getting tle for this problem..I used dijkstra,and tried to implement it with just array,without using STL priority queue,just to get it within time limit,bt unsuccessful..can anyone please help me?What can I do to get it within time?? :cry: :cry: #include<cstdio> #include<cstring> using namespac...

Thanks a lot,got AC now

It's still WA,even after changing,what can I do now?someone,please help

I've changed that part,started the loop from i=1,so y and x both will be always>0,it still gives WA

Getting WA in this problem,can anyone help please?any special case I've missed? #include<stdio.h> typedef struct{ int x; int y; }s; s cube[20005]; int main() { int i,j,k,p; for(i=0; i<=22; i++) { for(j=i+1; j<=22; j++) { p=(j*j*j)-(i*i*i); if(cube[p].x==0 && cube[p].y==0) { cube[p].x=j; cube...

Thnax a lot! another stupid mistake!

I don't get why I'm getting WA in bicolouring..tried to think about many possible mistakes,tried some sample inputs,but still WA.I used bfs here,started from the 1st input node,coloured it 1,then colored all its adjecent to 2,thus went on..when got some node that its adjacent is same color as it,the...