Search found 160 matches
- Mon Jan 07, 2008 8:05 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11383 - Golden Tiger Claw
- Replies: 10
- Views: 3370
I cant understand one thing, my pc is slow there is no doubt about that, it took approximately 8s, but in judge pc it got AC in only 0.76s. but when i asked official to check my code against judge pc it was more than 3s. But on the same data it is only 0.76s now! how did it happen? anybody any idea?
- Mon Jan 07, 2008 7:56 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11381 - Elegant Strings
- Replies: 8
- Views: 2980
- Mon Jan 07, 2008 9:32 am
- Forum: Volume 113 (11300-11399)
- Topic: 11382 - Fear of The Dark
- Replies: 8
- Views: 3117
- Mon Jan 07, 2008 4:41 am
- Forum: Volume 113 (11300-11399)
- Topic: 11382 - Fear of The Dark
- Replies: 8
- Views: 3117
- Mon Jan 07, 2008 4:36 am
- Forum: Volume 113 (11300-11399)
- Topic: 11383 - Golden Tiger Claw
- Replies: 10
- Views: 3370
- Mon Jan 07, 2008 4:34 am
- Forum: Volume 113 (11300-11399)
- Topic: 11378 - Bey Battle
- Replies: 10
- Views: 10797
Well when i set this problem i was looking for an O(N) algorithm. But i could not find. After that i implemented an NlgN version which used BST which is quite hard to code. I completely overlooked modified closest pair solution. So i though it was going to be one of the hardest. But now i can see ho...
- Sun Nov 25, 2007 1:17 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11354 - Bond
- Replies: 13
- Views: 8194
- Sun Nov 25, 2007 1:12 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11358 - Faster Processing Feasibility
- Replies: 8
- Views: 5111
- Sat Nov 24, 2007 5:19 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11353 - A Different Kind of Sorting
- Replies: 17
- Views: 9142
- Wed Oct 24, 2007 2:47 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11315 - Attacker
- Replies: 10
- Views: 4163
- Wed Oct 24, 2007 12:11 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11315 - Attacker
- Replies: 10
- Views: 4163
ya i saw that this morning, (some one gave the link at TC forum). But how the judge says that the first part is easy to compute? To me the second part is easy to compute. And for the first part i cant think of other way than using NlgN union of rectangle! Now if the judge wants to say that NlgN comp...
- Tue Oct 23, 2007 6:21 am
- Forum: Volume 113 (11300-11399)
- Topic: 11315 - Attacker
- Replies: 10
- Views: 4163
- Mon Oct 22, 2007 10:52 am
- Forum: Volume 113 (11300-11399)
- Topic: 11315 - Attacker
- Replies: 10
- Views: 4163
- Sun Oct 21, 2007 3:09 pm
- Forum: Volume 113 (11300-11399)
- Topic: 11315 - Attacker
- Replies: 10
- Views: 4163
Think about handling the white cells and black cells seperately. But after that i dont know. AFAIK the NlogN solution (Klee's method) for Union of rectangle is too complex to code. And N^2 seems not to be feasible here! So i am not sure what to do from here! If NlogN is the one that is to be used he...
- Sat Sep 08, 2007 5:27 am
- Forum: Volume 109 (10900-10999)
- Topic: 10975 - Dueue's Quiz
- Replies: 39
- Views: 21539
well i had lots of trouble witht he input system. so those who will try this problem for them: (here: W is string, board[][] is char and others are int) cin>>cases; for(ks=1;ks<=cases;ks++) { cin>>d; for(i=1;i<=d;i++) { cin>>W; if(W.size()<=100) //<---- this is important. without it u will get RTE. ...