a codeforces contest.
C. Oriented Journey
we direct the edges such that , where , denotes that and are different, and otherwise same. since thereβs only provided bits, we can fix . thus we can root our tree at and deduce all the bits from there.
a codeforces contest.
we direct the edges such that , where , denotes that and are different, and otherwise same. since thereβs only provided bits, we can fix . thus we can root our tree at and deduce all the bits from there.