Search found 160 matches

by shanto86
Mon Jan 07, 2008 8:05 pm
Forum: Volume 113 (11300-11399)
Topic: 11383 - Golden Tiger Claw
Replies: 10
Views: 2439

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?
by shanto86
Mon Jan 07, 2008 7:56 pm
Forum: Volume 113 (11300-11399)
Topic: 11381 - Elegant Strings
Replies: 8
Views: 2185

the problem can be reduced to a matching problem.
by shanto86
Mon Jan 07, 2008 9:32 am
Forum: Volume 113 (11300-11399)
Topic: 11382 - Fear of The Dark
Replies: 8
Views: 1983

do a binary search
by shanto86
Mon Jan 07, 2008 4:41 am
Forum: Volume 113 (11300-11399)
Topic: 11382 - Fear of The Dark
Replies: 8
Views: 1983

Well... convert the lines into angle, it will make the problem very easy :wink:
by shanto86
Mon Jan 07, 2008 4:36 am
Forum: Volume 113 (11300-11399)
Topic: 11383 - Golden Tiger Claw
Replies: 10
Views: 2439

yes, as mf said it is nothing but plain implementation of Kuhn-Munkres. But i thought it will be solved least. Unfortunately and very surprisingly it was the first problem which got accepted in the contest. :cry:
by shanto86
Mon Jan 07, 2008 4:34 am
Forum: Volume 113 (11300-11399)
Topic: 11378 - Bey Battle
Replies: 10
Views: 4590

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...
by shanto86
Sun Nov 25, 2007 1:17 pm
Forum: Volume 113 (11300-11399)
Topic: 11354 - Bond
Replies: 13
Views: 6434

can you please describe it a bit more?
by shanto86
Sun Nov 25, 2007 1:12 pm
Forum: Volume 113 (11300-11399)
Topic: 11358 - Faster Processing Feasibility
Replies: 8
Views: 4122

i did as adrian said during onsite and got AC :)
by shanto86
Sat Nov 24, 2007 5:19 pm
Forum: Volume 113 (11300-11399)
Topic: 11353 - A Different Kind of Sorting
Replies: 17
Views: 7379

use seive like method and dont sort them explicitly.
by shanto86
Wed Oct 24, 2007 2:47 pm
Forum: Volume 113 (11300-11399)
Topic: 11315 - Attacker
Replies: 10
Views: 3123

YUPPY!!!

GOT AC :)

My timing is, .890s. I am not sure, but you people may try it with N^2 algorithm.

My algorithm is: Computing the first part in NlgN.
Then doing the second part in also NlgN time.
by shanto86
Wed Oct 24, 2007 12:11 pm
Forum: Volume 113 (11300-11399)
Topic: 11315 - Attacker
Replies: 10
Views: 3123

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...
by shanto86
Tue Oct 23, 2007 6:21 am
Forum: Volume 113 (11300-11399)
Topic: 11315 - Attacker
Replies: 10
Views: 3123

well there is a problem with the union of rectangle procedure. note that some rectangle may get out of board. and in that case what to do? coz then only making union does not work!
by shanto86
Mon Oct 22, 2007 10:52 am
Forum: Volume 113 (11300-11399)
Topic: 11315 - Attacker
Replies: 10
Views: 3123

i think checking intersecting fact is going to take way more than N^2 in worst case!
by shanto86
Sun Oct 21, 2007 3:09 pm
Forum: Volume 113 (11300-11399)
Topic: 11315 - Attacker
Replies: 10
Views: 3123

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...
by shanto86
Sat Sep 08, 2007 5:27 am
Forum: Volume 109 (10900-10999)
Topic: 10975 - Dueue's Quiz
Replies: 39
Views: 15968

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. ...

Go to advanced search