Search found 32 matches
- Thu Jul 08, 2010 1:50 pm
- Forum: Volume 117 (11700-11799)
- Topic: 11790 - Murcia's Skyline
- Replies: 28
- Views: 14890
Re: 11790 - Murcia's Skyline
I got WA several time. I handle the negativity problem also. Kindly anybody please check my code or give any critical I/O. Thanks in advance. Here is my code: #include<iostream> #include<cstdio> using namespace std; #define MAXN 10001 long A[MAXN],N,B[MAXN]; long L[MAXN],P1[MAXN],P2[MAXN],waitSum1[M...
- Sun Feb 21, 2010 9:16 am
- Forum: Volume 117 (11700-11799)
- Topic: 11709 - Trust groups
- Replies: 9
- Views: 4476
Re: 11709 Trust Groups
It seems to me the problem is finding the minimum number of cycles in the forest.
Is I'm right?
How to find minimum number of cycles in the forest...what is the algo????
Thnx in advance.
Is I'm right?
How to find minimum number of cycles in the forest...what is the algo????
Thnx in advance.
- Sat Feb 20, 2010 11:19 am
- Forum: Volume 117 (11700-11799)
- Topic: 11710 - Expensive subway
- Replies: 14
- Views: 6019
Re: 11710 - Expensive subway
I got RE why? Thnx in advance.:) #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <cassert> #include <cstring> #include <climits> #include <iostream> #include <sstream> #include <string> #include <numeric> #include <utility> #include <algorithm> #include <stack> #incl...
- Fri Jun 19, 2009 11:42 am
- Forum: Volume 108 (10800-10899)
- Topic: 10816 - Travel in Desert
- Replies: 49
- Views: 23443
Re: 10816 - Travel in Desert
Is there no one to help me???!!!
- Wed Jun 17, 2009 7:59 am
- Forum: Volume 108 (10800-10899)
- Topic: 10816 - Travel in Desert
- Replies: 49
- Views: 23443
I got PE!!!
Interestingly i got PE in this problem. Can anybody plz check my code. I cant found my bug. :( Thnx in advance. #include<stdio.h> #include<stdlib.h> #define MAXN 102 #define INF 2147483647 #define max(a, b) (a>b?a:b) #define min(a,b) (a>b?b:a) struct ss { int u, v; double temp, dis; }; ss Edge[MAXN*...
- Wed Jun 10, 2009 9:05 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11517 - Exact Change
- Replies: 33
- Views: 11719
Re: 11517 - Exact Change
You r so helpful.
For your case it's working again.
But WA still behind me.
I edit my code.

For your case it's working again.

But WA still behind me.

I edit my code.
- Mon Jun 08, 2009 6:38 am
- Forum: Volume 115 (11500-11599)
- Topic: 11517 - Exact Change
- Replies: 33
- Views: 11719
Re: WA-11517
Thank you saiful.
I modified my code. Now ur case is working.
But still WA.(Above 2 weeks)
I modified my code. Now ur case is working.
But still WA.(Above 2 weeks)
- Sun Jun 07, 2009 1:23 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10807 - Prim
- Replies: 31
- Views: 17111
Re: 10807 - Prim, Prim.
Thnx again for consulting.
But Why not this solution???
The 1st MST is (1-2), (2-3), (3-4) and the cost is 1 + 1+ 1 = 3
The 2nd MST is (1-2), (2-4), (3-4) and the cost is 1 + 10 + 100 = 111
Why not??
Please tell me.
Is here anything I miss out?
But Why not this solution???
The 1st MST is (1-2), (2-3), (3-4) and the cost is 1 + 1+ 1 = 3
The 2nd MST is (1-2), (2-4), (3-4) and the cost is 1 + 10 + 100 = 111
Why not??
Please tell me.
Is here anything I miss out?
- Sun Jun 07, 2009 11:58 am
- Forum: Volume 108 (10800-10899)
- Topic: 10807 - Prim
- Replies: 31
- Views: 17111
Re: 10807 - Prim, Prim.
Sorry to disturb again.
You say output is 34.
My code give 114.
But I cant get why output is 34.
I draw it but cant get it.
Would you please explain me?
Thnx for your help.
You say output is 34.
My code give 114.
But I cant get why output is 34.
I draw it but cant get it.
Would you please explain me?
Thnx for your help.
- Sun Jun 07, 2009 11:43 am
- Forum: Volume 115 (11500-11599)
- Topic: 11517 - Exact Change
- Replies: 33
- Views: 11719
Re: WA-11517
Sorry saiful.
In my code posted here i cant initialize it.
Now i edited it.
Sorry friend. I do apologize for my mistake.
But it still WA.
Thnx sohel vai for your reply.
In my code posted here i cant initialize it.
Now i edited it.
Sorry friend. I do apologize for my mistake.

But it still WA.
Thnx sohel vai for your reply.
- Sun Jun 07, 2009 6:50 am
- Forum: Volume 115 (11500-11599)
- Topic: 11517 - Exact Change
- Replies: 33
- Views: 11719
Re: WA-11517
It seems to me there is some problem with you.
I dont understand if my code work good in my compiler,
why it give wrong output in your compiler.
saiful my code give correct output for your case.
Before response you should look closely.
Thnx for your effort.
I dont understand if my code work good in my compiler,
why it give wrong output in your compiler.
saiful my code give correct output for your case.
Before response you should look closely.
Thnx for your effort.
- Sun Jun 07, 2009 6:17 am
- Forum: Volume 108 (10800-10899)
- Topic: 10807 - Prim
- Replies: 31
- Views: 17111
Re: 10807 - Prim, Prim.
Hi helloneo,
I cant understand why for this case output 22.
My output No way!.
Would you please explain me why output 22???
Thnx for your reply.
I cant understand why for this case output 22.
My output No way!.
Would you please explain me why output 22???

Thnx for your reply.
- Sat Jun 06, 2009 6:13 am
- Forum: Volume 108 (10800-10899)
- Topic: 10807 - Prim
- Replies: 31
- Views: 17111
Re: 10807 - Prim, Prim.
Thanx heeloneo for your case but i think in your test case there is some problem.
Node=4
Edge=5
BUT you gave 4 edge here.
I still get WA.
Help me please.
Node=4
Edge=5
BUT you gave 4 edge here.
I still get WA.
Help me please.
- Fri Jun 05, 2009 9:18 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10807 - Prim
- Replies: 31
- Views: 17111
Re: 10807 - Prim, Prim.
Help needed. I got WA in this problem. I try lot to find it. Seems to be a very easy problem cant figure it out. I do Kruskal here. Can anybody please check my code??? #include<iostream.h> #include<stdlib.h> #include<string.h> #define MAXN 50 int P[MAXN], Rank[MAXN], Check[MAXN]; int Node, edg, Cost...
- Fri Jun 05, 2009 7:31 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11517 - Exact Change
- Replies: 33
- Views: 11719
Re: WA-11517
Thank you saiful_sust for your response.
But my code give correct result for your case.
But i still get WA.
I cant found where is my bug.
Can you(anyone) please check my code.
Thanks in advance.
But my code give correct result for your case.
But i still get WA.
I cant found where is my bug.
Can you(anyone) please check my code.
Thanks in advance.