Search found 199 matches
- Fri Feb 09, 2007 8:32 am
- Forum: Volume 111 (11100-11199)
- Topic: 11141 - Sugar Cubes
- Replies: 11
- Views: 4291
Try to define a state that represents all arrangments at the same time - there are only 6 arrangments (did they exlude that from the problem statement??), so the state space is not too large. Then add the cubes one by one (all possible rotations) and recurse on the new arrangments state / cube id. A...
- Mon Jan 22, 2007 5:29 am
- Forum: Volume 111 (11100-11199)
- Topic: 11146 - Insurrection
- Replies: 11
- Views: 4122
- Tue Jan 09, 2007 7:43 am
- Forum: Volume 111 (11100-11199)
- Topic: 11146 - Insurrection
- Replies: 11
- Views: 4122
- Mon Jan 08, 2007 6:52 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11141 - Sugar Cubes
- Replies: 11
- Views: 4291
- Mon Jan 08, 2007 4:15 am
- Forum: Volume 111 (11100-11199)
- Topic: 11141 - Sugar Cubes
- Replies: 11
- Views: 4291
Could anybody who solved the problem post the answers to the following test cases? 8 1 2 5 4 2 6 2 2 5 1 4 2 3 2 3 2 6 5 1 1 3 5 5 6 3 4 4 3 3 3 2 2 2 6 1 1 1 6 4 4 2 5 2 5 4 4 4 6 3 2 3 3 6 1 6 5 2 3 3 4 3 3 5 2 5 4 4 3 4 3 6 5 4 2 6 1 4 1 4 3 4 3 3 4 3 2 1 1 3 3 1 4 6 3 2 6 1 1 3 1 2 5 5 1 1 6 4 5...
- Sun Jan 07, 2007 7:59 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11144 - S.O.S.
- Replies: 13
- Views: 5290
- Sat Jan 06, 2007 9:31 am
- Forum: Volume 111 (11100-11199)
- Topic: 11146 - Insurrection
- Replies: 11
- Views: 4122
- Sat Jan 06, 2007 9:25 am
- Forum: Volume 111 (11100-11199)
- Topic: 11146 - Insurrection
- Replies: 11
- Views: 4122
Any idea if there can be any special cases? I keep getting WA... Can anybody post some test cases or look at my code? Is there anything special I that I have to do when constructing the graph for min-cut? I'm just adding distances to nodes 1 and n... #include <iostream> #include <string> using names...
- Tue Jan 02, 2007 1:24 am
- Forum: Bugs and suggestions
- Topic: 346 - Getting Chorded
- Replies: 1
- Views: 1717
346 - Getting Chorded
Judge's data contains notes that are not listed in the problem statement. I've only got AC after looking at junbin's post
http://online-judge.uva.es/board/viewto ... hlight=346
http://online-judge.uva.es/board/viewto ... hlight=346
- Tue Jan 02, 2007 12:42 am
- Forum: Volume 3 (300-399)
- Topic: 335 - Processing MX Records
- Replies: 12
- Views: 5599
- Fri Dec 22, 2006 4:03 am
- Forum: Volume 1 (100-199)
- Topic: 171 - Car Trialling
- Replies: 19
- Views: 5263
Could anybody decrypt the following sentence from the problem statement for me: There will be one or more spaces between items except before a period (.), after the opening speech marks or before the closing speech marks. Does it mean that input satisfies those conditions or does it mean that if inp...
- Sat Dec 16, 2006 9:59 pm
- Forum: Bugs and suggestions
- Topic: 990 - Diving for gold
- Replies: 7
- Views: 4209
- Sat Dec 16, 2006 9:53 pm
- Forum: Bugs and suggestions
- Topic: 990 - Diving for gold
- Replies: 7
- Views: 4209
- Sun Dec 10, 2006 3:17 am
- Forum: Volume 2 (200-299)
- Topic: 238 - Jill's Bike
- Replies: 24
- Views: 10239
- Sat Dec 09, 2006 10:56 pm
- Forum: Volume 2 (200-299)
- Topic: 238 - Jill's Bike
- Replies: 24
- Views: 10239
I've read all the posts and did not get any closer to understanding what the problem statement is actually asking... Could anybody who got the problem accepted answer the following questions for me, please? 1) What are we minimizing? Is it the number of edges in the path or the total distance? 2) Wh...