## Search found 151 matches

Wed Feb 25, 2004 9:03 am
Forum: Algorithms
Topic: LIS, better then O(n^2)?
Replies: 16
Views: 11942
There is apparently only one test case for this problem, so you can do a exhausting binary search by hand, using assert() ..
Wed Feb 18, 2004 9:39 pm
Forum: Volume 106 (10600-10699)
Replies: 11
Views: 7050
A cross product of two vectors of size-three
(a, b, c) and (d, e, f) is (bf - ce, cd - af, ae - bd).
Sat Feb 14, 2004 11:11 pm
Forum: Volume 100 (10000-10099)
Topic: 10029 - Edit Step Ladders
Replies: 70
Views: 21519
I don't think he completely bypassed the size of the alphabet, but I think he ignored it because it could be treated as a constant. You can pass the time limit with hashing too, if you have a good implementation. Check out little joey's comments at: http://online-judge.uva.es/board/viewtopic.php?t=3...
Fri Feb 06, 2004 3:48 pm
Forum: Volume 106 (10600-10699)
Replies: 11
Views: 7050
Splendid! I got accepted at once, so got a good take-home lesson.

Thanks a lot! I didn't even think about it. This problem was not as much "dreadful" as I thought.
Fri Feb 06, 2004 2:13 pm
Forum: Volume 102 (10200-10299)
Topic: 10274 - Fans and Gems
Replies: 8
Views: 2778
Adrian: Yes, very true! I forgot to implement "keep blowing wind till there's no chages" feature. Now my program solves the example case correctly. Thanks! Observer: It seems BFS is feasible (However it is a bit tricky to create lexicographically smallest output) . I used BFS and it runs fast.. (< 0...
Fri Feb 06, 2004 2:09 pm
Forum: Volume 106 (10600-10699)
Replies: 11
Views: 7050
Oh yes, my stupidity. I calculated cross products as a scalar.
After modifying that my program solves the case correcly, but I still get WA.. I'll try to fix it. Thanks a lot, anyway!

Sincerely,
JongMan =)
Thu Feb 05, 2004 7:34 pm
Forum: Volume 106 (10600-10699)
Replies: 11
Views: 7050

I KNOW these kind of problems are extremely hard to get right, and I am an imprudent coder, but this one. :-? Could you verify these IO set, or provide some tricky ones? [[1,2,3]*[1,2,3],[1,2,3]*[1,2,3],[1,2,3]x[1,2,[1,2,3]*[1,2,3]]] [[1,2,3]*[1,2,3],[1,2,3]*[1,2,3],[1,2,3]x[1,2,[1,2,3]*[1,2,3]]]x[1...
Wed Jan 28, 2004 7:58 pm
Forum: Volume 102 (10200-10299)
Topic: 10274 - Fans and Gems
Replies: 8
Views: 2778

### 10274 - Fans and Gems

Hi! I'm solving this problem and confused about the sample input and output. For the sample input given below, ######## ## 1## ## 2 # # 1 ## ##2 ## # 1@## ### ## #### ### ######## They have LURD (left, up, right, down) as the desired output. Two 2 s collide after LU and three 1 s disappear after RD....
Tue Jan 27, 2004 2:54 pm
Forum: Volume 104 (10400-10499)
Topic: 10463 - Aztec Knights
Replies: 35
Views: 11309
One thing for sure is that it will take less than 11 moves to move from a square to any of the other. Therefore prime moves are limited to 2, 3, 5, and 7. Hi. I was suffering from TLEs and got to here, and saw your post and immediately got AC. But I'm still curious :( How do you know you can never ...
Mon Jan 19, 2004 5:15 am
Forum: Volume 105 (10500-10599)
Topic: 10558 - A Brief Gerrymander
Replies: 6
Views: 5134
Go to Waterloo contest website at http://plg.uwaterloo.ca/~acm00 and you will find all source codes and input datas. But be sure not to spoil your "fun" by looking over solutions. :wink: However, after I solve problems from Waterloo contest I always check out their solutions: they are quite impressi...
Mon Jan 19, 2004 5:10 am
Forum: Volume 105 (10500-10599)
Topic: 10595 - Knight on the Bee Board
Replies: 17
Views: 11644
We suggested a new coordinate system (something like two diagonal axes and a vertical axis) to convert the bee board into a normal chessboard, and did a BFS to find the minimum cost. (Sorry I don't remember the details )
Thu Jan 15, 2004 6:03 pm
Forum: Volume 105 (10500-10599)
Topic: 10561 - Treblecross
Replies: 26
Views: 11579
Hi Andrey! :D I just thought so because I am not good at math at all. :( Suppose that I faced this kind of problem in an actual contest environment. I don't think I would solve it, since I don't know this particular theory. So I just imagined of a different solution that can deal with some more gene...
Wed Jan 14, 2004 2:41 pm
Forum: Volume 105 (10500-10599)
Topic: 10561 - Treblecross
Replies: 26
Views: 11579
Hi. I read up some math, and solved this problem. But I did not understand the all background of this.. (I'm really bad in math :wink:) I believe there should be another approach that is not based on game theory, and it is much more likely the "another method" is feasible for real contest environmen...
Wed Jan 14, 2004 10:14 am
Forum: Volume 105 (10500-10599)
Topic: 10597 - Right Words
Replies: 4
Views: 2551
I got accepted too, after making changes rjhadley mentioned. Thanks!
Mon Jan 12, 2004 8:06 am
Forum: Volume 105 (10500-10599)
Topic: 10599 - Robots(II)
Replies: 27
Views: 10317
Oops. :( Is it true?? For test cases like 100 100 (and 10000 garbages, one in each grid square), the resulting number should easily overtake 2^64, where my program outputs 22750883079422934966181954039568885395604168260154104734000 .. I got WA using int during the contest and noticed this to get AC....