12033 - Game of CS

All about problems in Volume 120. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
aab
New poster
Posts: 3
Joined: Wed Jun 22, 2011 11:47 am

12033 - Game of CS

Post by aab » Tue Jun 28, 2011 8:53 am

Can anyone tell me how to solve this problem?

fsps60312
New poster
Posts: 16
Joined: Sun Jan 25, 2015 5:46 pm

Re: 12033 - Game of CS

Post by fsps60312 » Mon Nov 23, 2015 8:40 am

I found a solution on the Internet and coded according to its description of solution.
Got AC though, but didn't know why...
Let v be child of u, the length between them is c
Then according to the parity of c and sg[v], we can get a value from sg[v], called m
Then sg=m_1^m_2^m_3...(m_i is the value m get from sg[I-th child of u])
How to reach this conclusion?
I don't want to just get AC without knowing the reason...
Hope somebody can explain it...
Thanks in advance!

Post Reply

Return to “Volume 120 (12000-12099)”