10051 - Tower of Cubes

[Angeh]

I want to solve this problem by building a graph and running
topological sort on it and then finding the longest path in the graph.

now for a dense graph I get E = V^2

where V <= 6 * 500 right? (6 positions and 500 cubes maximum)
so (6*500)^2 is too much space isn't? (for int array)

there is another option? (I guess they dont expect me to work
in bits level)

please help me here, or tell me another option for solving
this question.

there is no need to construct a whole graph just keep the track

for each node instead of
finding its children
find the nodes that can be its parent

[Angeh]

This is not so Difficult to solve
I solved it by O(n) algorithm and Got AC
the only thing needed is to change you mind set on an other thing

[Neil]

Is it just me, or is this problem statement more than a little contradictory?
It says "Print a blank line between two successive test cases" but the sample output doesn't have any blank lines.
It also says that we should print the identification string of the top face, but the sample output shows the bottom face.
Am I missing something???

[brianfry713]

Yes there is a blank line between test cases.
Note that there may be multiple solutions and any one of them is acceptable.

[Neil]

Oh I didn't see the part that says the list is from top to bottom - I thought it was bottom to top.
Thanks, got accepted now