Search found 8 matches

by klopyrev
Tue Jul 17, 2007 7:48 am
Forum: Volume 112 (11200-11299)
Topic: 11243 - Texas Trip
Replies: 18
Views: 8175

If only there weren't people like Loiane Groner, my solution would still be the fastest at 0.012. Anyone else want to get 0.000 seconds? The test input/output is on the Waterloo Programming Contest website.
by klopyrev
Sun Jul 15, 2007 11:42 pm
Forum: Volume 112 (11200-11299)
Topic: 11240 - Antimonotonicity
Replies: 33
Views: 12308

Can someone tell me the technique for super fast input reading? I'm already using C input and its taking 0.439 second just to read it all, without even running any algorithm on the data.
by klopyrev
Sun Jul 15, 2007 11:39 pm
Forum: Volume 112 (11200-11299)
Topic: 11240 - Antimonotonicity
Replies: 33
Views: 12308

How the hell are people getting such fast times? My solution is O(n) and it doesn't even store the input. All it does it one comparisson per number. It runs in 0.447 seconds. Then there are people that do it in <0.200 seconds. How the hell is that possible?
by klopyrev
Sun Jul 15, 2007 11:32 pm
Forum: Volume 112 (11200-11299)
Topic: 11243 - Texas Trip
Replies: 18
Views: 8175

I think you are making this problem too complicated. Convex Hull is not needed at all. I did it just using the concept of rotating all the points by an angle 0<=t<pi/2. That's 90*. With the points rotated, you can find the minx, maxx, miny, maxx and the smallest square will have the side max(maxx-mi...
by klopyrev
Fri May 11, 2007 4:43 am
Forum: Volume 3 (300-399)
Topic: 345 - It's Ir-Resist-Able!
Replies: 1
Views: 1695

345 - It's Ir-Resist-Able!

General question... How would you solve this without using any knowledge outside of what is given in the problem statement. I mean without using all the advanced electricity laws. I've thought about it for quite a while and can't quite figure out how to do it. Please help me.

KL
by klopyrev
Thu Apr 12, 2007 8:50 am
Forum: Bugs and suggestions
Topic: 10004 Bad Test Data
Replies: 1
Views: 2665

10004 Bad Test Data

I have solved the problem 10004 Bicolourable and gotten AC. I have submitted two different solutions and both of the solutions have gotten AC. However, there is a problem with the second solution. I have several test cases on which it doesn't work. It does get AC by the judge though. The test data f...
by klopyrev
Mon Apr 09, 2007 2:20 am
Forum: Volume 106 (10600-10699)
Topic: 10634 - Say NO to Memorization
Replies: 18
Views: 8381

nCk is not needed here. The answer is F(n, v) = F(n-1, v) + F(n, v-1). If n==0, the answer is 1. If v==0, the answer is 1 if n is even and 0 if n is odd.
by klopyrev
Tue Dec 26, 2006 10:39 am
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52011

There is a test case where X1 > X2 or Y1 > Y2! Correct for that and I think it should work! Tell me how it goes!

Go to advanced search