Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1)

1 problems from Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1) (contest 1053), difficulty 3500-3500. 1/1 solutions verified against sample I/O.

1 items

Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1)

Div. 1 | 1 problems | 1/1 verified | Difficulty 3500-3500 | 4m 56s

#	Problem	Rating	Tags	Accepted	Time	✓
E	Euler tour	3500	constructive-algorithms, trees	239	4m 56s	✓

Practice › Codeforces Solutions › Codeforces Round 512 (Div. 1, based on Technocup 2019 Elimination Round 1) ›

CF 1053E - Euler tour

We are given a sequence of length $2n - 1$, which is supposed to represent the order in which a squirrel visits vertices of some tree during a full traversal.