Discussion @ 1163. Chapaev @ Timus Online Judge

Now suppose there are only 1 red and 1 white left, and it's Red's turn. He'll certainly push the white off the board. In this case, who is considered to win?

Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 16 Oct 2004 18:48

A player loses, when he has to make his turn but cannot. So, in your example, Red makes their turn, and White cannot, so Red wins (-)

Posted by Michael Rybak (accepted@ukr.net) 26 Oct 2004 20:04

Then could anyone help me see why I get WA #3 with this prog?

Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 27 Oct 2004 04:45

I use binary representation of the chessboard.

Edited by moderator 28.10.2004 02:55

I may be mistaking, but... (+)

Posted by Michael Rybak (accepted@ukr.net) 27 Oct 2004 15:57

I believe you fill the white[] and red[] arrays in wrong order. When you're calculating white[p], you must have already had calculated red[p and go[i,j]], but it may happen that you hadn't.

Discussion of Problem 1163. Chapaev