Search found 100 matches

by Kallol
Sat Jan 12, 2008 5:33 pm
Forum: Volume 113 (11300-11399)
Topic: 11321 - Sort! Sort!! and Sort!!!
Replies: 50
Views: 20415

where is it wrong , plz ??

Code: Select all

Removed after AC
by Kallol
Sun Dec 30, 2007 11:18 pm
Forum: Volume 102 (10200-10299)
Topic: 10201 - Adventures in Moving - Part IV
Replies: 23
Views: 11526

I am geting RTE here ... can u help me , why ?? #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> using namespace std; #define INF 999999999 int memo[10005][205]; int D,station[105],price[105]; bool isst[10005]; int pos[10005]; bool flag; int dp(int dis, int fuel) { if(dis>=D...
by Kallol
Sun Dec 30, 2007 7:12 pm
Forum: Volume 113 (11300-11399)
Topic: 11375 - Matches
Replies: 18
Views: 6930

using windows or Linux should not be the issue here ..
ur outputs match with outputs of my AC code ...
I think there may be any mistake in ur output formatting ..
If u show how u printed the answer , I think the reason can be revealed.
by Kallol
Sat Dec 29, 2007 7:10 pm
Forum: Volume 113 (11300-11399)
Topic: 11375 - Matches
Replies: 18
Views: 6930

thanks for ur output , monsoon ... as usual I did a stupid mistake not counting that additional number for making '0' with 6 sticks , for all n>=6.
thank u very much :-)
by Kallol
Sat Dec 29, 2007 6:34 pm
Forum: Volume 113 (11300-11399)
Topic: 11375 - Matches
Replies: 18
Views: 6930

some tricky I/O plz ..
i am getting WA ..
i handled
input: 6
for
output : 16

what is the output for 2000 ??
by Kallol
Thu Dec 27, 2007 11:26 am
Forum: Volume 101 (10100-10199)
Topic: 10146 - Dictionary
Replies: 8
Views: 4288

I used brute force and getting TLE ..
how did u people try it ?
can u explain ur strategy here ??
by Kallol
Wed Dec 26, 2007 7:50 pm
Forum: Volume 6 (600-699)
Topic: 662 - Fast Food
Replies: 22
Views: 10327

I am getting CE ! God knows why !! my code goes OK with the I/O given above. Here is my code.. #include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<cmath> #include<cstdlib> using namespace std; #define SIZE 205 #define INF 99999999 int D[SIZE]; int memo[SIZE][SIZE][35];...
by Kallol
Fri Dec 21, 2007 5:17 am
Forum: Volume 6 (600-699)
Topic: 665 - False coin
Replies: 15
Views: 7755

I am confused here .. I used some straight forward method for getting the solution ..but it turned out to be a WA in judge's verdict :cry: can anyone provide me with some tricky I/O where my code fails ?? here is my code: #include<cstdio> #include<iostream> #include<cstring> #include<algorithm> usin...
by Kallol
Sat Dec 15, 2007 5:48 pm
Forum: Volume 107 (10700-10799)
Topic: 10721 - Bar Codes
Replies: 26
Views: 12315

I have used 3D memo .. I am getting WA ..
can u give me some I/O where my code fails ..?? Thanks in advance ...

Code: Select all

removed after AC..
by Kallol
Sat Dec 15, 2007 2:22 pm
Forum: Volume 4 (400-499)
Topic: 430 - Swamp County Supervisors
Replies: 8
Views: 3185

I tried with Dynamic Programming .. I dont know why I am getting RTE .. Another thing is , what is the maximum value of the votes ??
Here is my code ... can anyone give me some suggestion ? Thanks in advance.

Code: Select all

removed after AC
The problem was in input taking actually ..
by Kallol
Tue Sep 04, 2007 4:12 pm
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12535

Thanks for wishing ... and I solved Gopher problem (10080) with same bpm function. actually I have been trying this problm for past few days ...tried with every input I got in the forum and also checked with my testing input and got the rigth answer . Thats why I was a bit upset . The problem looks ...
by Kallol
Mon Sep 03, 2007 8:25 am
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12535

here I tried it with DFS ...but still WA :cry: #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #define SIZE 1010 using namespace std; //globals int cap[25]; int filled[25]; bool adj[25][SIZE]; int NK,NP; bool seen[SIZE]; int leftM[25][150]; int rightM[SIZE]; bool bpm(int u)...
by Kallol
Mon Sep 03, 2007 5:48 am
Forum: Volume 5 (500-599)
Topic: 563 - Crimewave
Replies: 42
Views: 17710

should I split every node into two nodes with capacity 1 between them to avoid the collision ???

if YES , then the number of nodex get doubled and I am afraid , I will face a TLE . :-?
by Kallol
Mon Sep 03, 2007 5:33 am
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12535

My idea was very simple. I connected every problem with the source with capacity 1. I connected every problem with corresponding catagories with capacity 1. Then split every catagory into 2 nodes and the capacity between them in the allowed capacity for that catagory. Finally I connected the dummy c...
by Kallol
Thu Aug 30, 2007 7:49 am
Forum: Volume 9 (900-999)
Topic: 989 - Su Doku
Replies: 11
Views: 9238

hmm ....

i c ....

but the problem statement indicates tha there should not be more than one answer , huh ?? Then , my one should not be OK :cry: .... why did I get ACC ??

Go to advanced search