OJ Board

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

Not really, I just don't see any problem with the code staying there.

Finally got AC. Apparently there is a test case such that the bottleneck (when finding an augmenting path) can be less then 1e-9.

Thanks, got AC now . It's just ridiculous how badly I misinterpreted the problem statement .

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

I like when problemsetters put things like It should be noted that two floating point numbers a and b assumed equal if their absolute difference is less than 1e-8. in the problem statements. It's like saying "my data and solution could be wrong, so I'll offset my precision erros with ambiguouty...

Does anybody know what why "the carrier of this letter must not enter a territory more than once since the criminals may catch her/him" is included in the problem statement?

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

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

Would anybody tell me what can be possibly wrong with my code? I print lexicographically smallest web site if there are multiple choices. I check "If the first field is not present" by using isspace()... #include <cctype> #include <algorithm> #include <iostream> #include <string> #include ...

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

Never mind, got AC by using the first possible treasure whenever it leads to an optimal solution.

little joey wrote:You're right, ayon. I made the same change in my program and it turned from AC to WA.

I keep getting WA... What rule exactly should I use when there are multiple solutions?

Thanks a lot .

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