CF-- Road Map--思维+DFS遍历树

 

D. Road Map

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n cities in Berland. Each city has its index — an integer number from 1 to n. The capital has index r1. All the roads in Berland are two-way. The road system is such that there is exactly one path from the capital to each city, i.e. the road map looks like a tree. In Berland's chronicles the road map is kept in the following way: for each city i, different from the capital, there is kept number pi — index of the last city on the way from the capital to i.

Once the king of Berland Berl XXXIV decided to move the capital from city r1 to city r2. Naturally, after this the old representation of the road map in Berland's chronicles became incorrect. Please, help the king find out a new representation of the road map in the way described above.

Input

The first line contains three space-separated integers n, r1, r2 (2 ≤ n ≤ 5·104, 1 ≤ r1 ≠ r2 ≤ n) — amount of cities in Berland, index of the old capital and index of the new one, correspondingly.

The following line contains n - 1 space-separated integers — the old representation of the road map. For each city, apart from r1, there is given integer pi — index of the last city on the way from the capital to city i. All the cities are described in order of increasing indexes.

Output

Output n - 1 numbers — new representation of the road map in the same format.

Examples

input

Copy

3 2 3
2 2

output

Copy

2 3 

input

Copy

6 2 4
6 1 2 4 2

output

Copy

6 4 1 4 2 

当两个点处于相邻时，存入向量中。遍历DFS新的根节点，记录其他节点的root。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=50000+66;
const ll mod=1e9+7;
int n,r1,r2;
vector<int>v[maxn];
int vis[maxn];
int ans[maxn];
void dfs(int root)
{
    vis[root]=1;
   // cout<<v[root].size()<<"??"<<endl;
    for(int i=0;i<v[root].size();i++)
    {
       // cout<<"-----"<<endl;
        if(vis[v[root][i]])continue;
        ans[v[root][i]]=root;
        //cout<<v[root][i]<<"---"<<endl;
        dfs(v[root][i]);
    }
}
int main()
{
    scanf("%d%d%d",&n,&r1,&r2);
    for(int i=1;i<=n;i++)
    {
        if(i==r1)continue;
        int x;
        scanf("%d",&x);
       // cout<<x<<"+++"<<i<<endl;
        v[i].push_back(x);//r1到达i的最后一个点是x;
        v[x].push_back(i);
    }
    dfs(r2);
    for(int i=1;i<=n;i++)
    {
        if(i!=r2)
        {
            printf("%d ",ans[i]);
        }
    }
    printf("\n");
}