Codeforces Round 529 (Div. 3) D. Circular Dance

Circular Dance

time limit per test: 3 second memory limit per test: 256 megabytes input: standard input output: standard output

There are $n$ kids, numbered from $1$ to $n$, dancing in a circle around the Christmas tree. Let’s enumerate them in a clockwise direction as $p_1$, $p_2$, …, $p_n$ (all these numbers are from $1$ to $n$ and are distinct, so $p$ is a permutation). Let the next kid for a kid $p_i$ be kid $p_{i+1}$ if $i<n$ and $p_1$ otherwise. After the dance, each kid remembered two kids: the next kid (let’s call him $x$) and the next kid for $x$. Each kid told you which kids he/she remembered: the kid $i$ remembered kids $a_{i,1}$ and $a_{i,2}$. However, the order of $a_{i,1}$ and $a_{i,2}$ can differ from their order in the circle.

Example: 5 kids in a circle, $p=[3,2,4,1,5]$ (or any cyclic shift). The information kids remembered is: $a_{1,1}=3$, $a_{1,2}=5$; $a_{2,1}=1$, $a_{2,2}=4$; $a_{3,1}=2$, $a_{3,2}=4$; $a_{4,1}=1$, $a_{4,2}=5$; $a_{5,1}=2$, $a_{5,2}=3$.

You have to restore the order of the kids in the circle using this information. If there are several answers, you may print any. It is guaranteed that at least one solution exists.

If you are Python programmer, consider using PyPy instead of Python when you submit your code.

Input

The first line of the input contains one integer $n$ ($3\le n\le 2\cdot 10^5$) — the number of the kids.

The next $n$ lines contain $2$ integers each. The $i$-th line contains two integers $a_{i,1}$ and $a_{i,2}$ ($1\le a_{i,1},a_{i,2}\le n,a_{i,1}\ne a_{i,2}$) — the kids the $i$-th kid remembered, given in arbitrary order.

Output

Print $n$ integers $p_1$, $p_2$, …, $p_n$ — permutation of integers from $1$ to $n$, which corresponds to the order of kids in the circle. If there are several answers, you may print any (for example, it doesn’t matter which kid is the first in the circle). It is guaranteed that at least one solution exists.

Example

$\mathtt{input}$
5 3 5 1 4 2 4 1 5 2 3
$\mathtt{output}$
3 2 4 1 5

$\mathtt{input}$
3 2 3 3 1 1 2
$\mathtt{output}$
3 1 2

Tutorial

可以用两个变量 $u$ 和 $v$ 标记下一个位置和下下个位置，若 $u$ 孩子记住的孩子 $v_1,v_2$ 中有 $v$，则将 $u$ 置为 $v$，将 $v$ 置为另一个孩子（如果 $v=v_1$，则将 $v$ 置为 $v_2$，如果 $v=v_2$，则将 $v$ 置为 $v_1$），此时找到了一条边，就可以马上找下一条边，因此我们只需要确定整个图的一条边即可，由于从 $1$ 出发的只有 $2$ 条边，所以可以枚举从 $1$ 出发的两条边，判断哪条边可以符合题意即可

此解法时间复杂度为 $\mathcal{O}(n)$

Solution

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector g(n + 1, vector<int>(2));
    for (int i = 1; i <= n; ++i) {
        cin >> g[i][0] >> g[i][1];
    }

    function<bool(int, int)> check = [&](int u, int v) -> bool {
        vector<int> ans;
        for (int i = 0; i < n; ++i) {
            if (g[u][0] == v) {
                ans.emplace_back(g[u][1]);
            } else if (g[u][1] == v) {
                ans.emplace_back(g[u][0]);
            } else {
                return false;
            }
            u = v;
            v = ans.back();
        }
        for (int ai : ans) {
            cout << ai << " \n"[ai == ans.back()];
        }
        return true;
    };
    
    for (int i = 0; i < 2; ++i) {
        if (check(1, g[1][i])) {
            return;
        }
    }
    return 0;
}