## Search found 39 matches

Wed Mar 22, 2006 10:33 pm
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 18289
Mr. Cho, can you give more insight for your hashing mechanism?
Thank you.
Wed Mar 22, 2006 3:09 pm
Forum: Volume 110 (11000-11099)
Topic: 11020 - Efficient Solutions
Replies: 14
Views: 5767
I wonder how to make nlogn algorithm for this problem!
Can you explain more? (I know set<> in STL, but I can not get approach to make it nlogn).
Wed Mar 22, 2006 2:59 pm
Forum: Volume 110 (11000-11099)
Topic: 11017 - A Greener World
Replies: 11
Views: 3844

### 11017 - A Greener World

Is there a way to apply pick's theorem?
If not, what should be done? sweeping?
And, can I map everything to a normal grid before starting?
Wed Mar 22, 2006 2:55 pm
Forum: Volume 110 (11000-11099)
Topic: 11014 - Make a Crystal
Replies: 16
Views: 6974
I need a hint to solve this problem (I will be very happy if a complete illustration is posted).
Sun Mar 19, 2006 5:21 pm
Forum: Volume 110 (11000-11099)
Topic: 11012 - Cosmic Cabbages
Replies: 29
Views: 9062
I do not know why all explanations are "encrypted" ! Is it forbidden to post a complete explanation here? Here is a complete explanation: 1) Get the 8 corners of the bounding box of the points. 2) For each corner, get the nearest point to it (in tie, choose any). 3) For each of these 8 points, compu...
Fri Mar 10, 2006 11:41 am
Forum: Volume 110 (11000-11099)
Topic: 11007 - Mini Cube
Replies: 11
Views: 7443
Thank you very much.
Thu Mar 09, 2006 7:10 pm
Forum: Volume 110 (11000-11099)
Topic: 11007 - Mini Cube
Replies: 11
Views: 7443

I get TLE for this problem. How to make the whole state in ONE integer? I am using 4 integers. And I do not think that I will pass even if I do this. I made meet in the middle attack as described, but it takes a long time also for number of steps = 6 or 7. I am making BFS and I do not generate anyth...
Thu Dec 08, 2005 1:18 pm
Forum: ACM ICPC Archive Board
Topic: 3292 - Matrissor (From Dhaka 2005-2006)
Replies: 18
Views: 4984
I agree with you. Although I have known the algorithm to make it work, I do not know why it works. I thought of a lot of time.
I would like that someone who understands this problem well to explain it to us. (Why it works, and what is the way of thinking that leads to this solution).
Thanks a lot.
Thu Dec 08, 2005 1:09 pm
Forum: ACM ICPC Archive Board
Topic: Problem: Joke with turtles
Replies: 0
Views: 732