Algorithm

D. Road Map
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem Link- https://codeforces.com/problemset/problem/34/D
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



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>
#include <vector>

void dfs(long node, const std::vector<std::vector<long> > &g, std::vector<long> &from, std::vector<bool> &vis){

    if(vis[node]){return;}
    vis[node] = 1;

    for(long p = 0; p < g[node].size(); p++){
        long u = g[node][p];
        if(vis[u]){continue;}
        from[u] = node;
        dfs(u, g, from, vis);
    }

    return;
}


int main(){

    long n, r1, r2; scanf("%ld %ld %ld\n", &n, &r1, &r2);
    std::vector<std::vector<long> > g(n + 1);
    for(long p = 1; p <= n; p++){
        if(p == r1){continue;}
        long x; scanf("%ld", &x);
        g[p].push_back(x); g[x].push_back(p);
    }

    std::vector<long> from(n + 1, 0);
    std::vector<bool> visited(n + 1, 0);
    dfs(r2, g, from, visited);

    for(long p = 1; p <= n; p++){
        if(p == r2){continue;}
        printf("%ld ", from[p]);
    }
    puts("");

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
3 2 3
2 2

Output

x
–
+
cmd
2 3
Advertisements

Demonstration

Codeforces Solution-D. Road Map-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+