Search found 12 matches

by LTH
Sun Dec 29, 2002 2:55 pm
Forum: Volume 2 (200-299)
Topic: 208 - Firetruck
Replies: 48
Views: 15166

i didnt mean that i got TLE.
I have done what was discussed and I got a 0.002 sec WA....
i dont know why....
by LTH
Thu Dec 26, 2002 6:09 pm
Forum: Volume 2 (200-299)
Topic: 208 - Firetruck
Replies: 48
Views: 15166

I have done what u had said and i still cant past the judge.... can anyone give me more special cases?? Thanks The following is my code(i will appreciate very much if u can point out my mistakes): [cpp] #include <stdio.h> #include <stdlib.h> #define MAX 22 int i,j,k,t,m,cnt,tar,num,count,a,b,tmp,map...
by LTH
Fri Dec 13, 2002 8:39 am
Forum: Volume 8 (800-899)
Topic: 851 - Maze
Replies: 35
Views: 16525

851 Maze II

i cant imagine any other method except bute force search
but it takes too much time to pass the judge.
does anyone have a better solution ???
by LTH
Mon Sep 16, 2002 5:51 pm
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 4946

handle the capacity in the nodes!!??
Sorry..i cant understand what you mean very well...
Could you expain it more clearly...please?
by LTH
Sun Sep 15, 2002 6:00 pm
Forum: Volume 103 (10300-10399)
Topic: 10331 - The Flyover Construction
Replies: 19
Views: 4946

10331 Flyover Construction

My method is use floyd and record the paths that is mininum cost But i cant figure out why i get wrong answer... i have write another program which is using "Brute Force" and i generate a lot of test data and compare the answer all of them are right.....thats strange... I have used the common "Outpu...
by LTH
Tue Sep 10, 2002 5:30 pm
Forum: Volume 1 (100-199)
Topic: 143 - Orchard Trees
Replies: 90
Views: 12642

ok...finally...coincidently...i figure out what happened to my code...
its the problem of preciseness...
double is not precise enough.....
i simple change all double to long double and then passed.....
its really a little shit...i think.....
by LTH
Tue Sep 10, 2002 5:18 pm
Forum: Volume 1 (100-199)
Topic: 143 - Orchard Trees
Replies: 90
Views: 12642

i have tried what u say.....but it seems that it doesnt work.. those are some inputs and outputs my program return: 0 0 100 0 0 100 4950 0.1 0.1 0.9 100 0.7 80 0 1 1 5 5 100 100 99 0 0 2.5 0.5 4 0.7 0 1 1 3 2 2 3 4 1 1 5 1 5 5 15 0.99999 0.99999 1.00001 0.99999 0.99999 1.00001 1 this is my code: [cp...
by LTH
Tue Sep 10, 2002 10:30 am
Forum: Volume 1 (100-199)
Topic: 143 - Orchard Trees
Replies: 90
Views: 12642

ACM 143

I have passed the problem by Brute Force Check all the points.
Nowadays,i tried to solve the problem by "Scanline Method"
But it turns out to be wrong answer.....><
So,is there any special test cases for the problem???
Or,is there any thing to notice about solveing the problem by scanline method?
by LTH
Mon Feb 11, 2002 5:37 pm
Forum: Volume 6 (600-699)
Topic: 616 - Coconuts, Revisited
Replies: 37
Views: 11718

you just examine numbers from
ceil((double)sqrt(number of coconuts)) to 2
:smile:
by LTH
Sun Feb 10, 2002 10:10 am
Forum: Volume 6 (600-699)
Topic: 608 - Counterfeit Dollar
Replies: 19
Views: 8166

i have no idea about why i get wrong answer.. i just test all possibilities,and print the anwer... Does it may have more than one conterfeit dollar? #include <stdio.h> #include <string.h> class stat { public: long leftp[4]; long rightp[4]; long stable; }; void main() { long i,j,k,t,tmp,tmpx,num,cnt,...
by LTH
Sat Feb 09, 2002 5:22 pm
Forum: Volume 5 (500-599)
Topic: 585 - Triangles
Replies: 16
Views: 5827

OH...I finally figure out your meaning...^^
I got Accepted... ^^
thank you very much^^
by LTH
Fri Feb 08, 2002 4:43 am
Forum: Volume 5 (500-599)
Topic: 585 - Triangles
Replies: 16
Views: 5827

er..i don't know why i get wrong answer.. Does triangles can be counted in other direction ? i have tested lots of situation but still cant find the fault.... The following is my code(i use Dynamic Programming): #include <stdio.h> #include <string.h> void main() { long i,j,k,t,tmp,tmpx,num,cnt=0,sum...

Go to advanced search