Codeforces 34C Page Numbers(简单图论+DFS)
2014-01-14 00:25
513 查看
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.
Sample test(s)
input
output
input
output
题意:很不好理解,n个城市编号1-n,现在要从首都r1迁徙到首都r2,迁徙前有一个表示国家的地图,地图的表示方法为,每个点对应的是他的前驱,首都无前驱跳过,问迁徙后的地图表示方法。图必然是一棵生成树(n-1条边)
思路:每个点对应前驱相连,这样就能构成图了,在从新的首都往后遍历,遍历过程中记录下答案。
代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 100005;
int n, r1, r2, sb;
vector<int> g
;
int du
, i;
int vis
;
int ans
;
void dfs(int now) {
vis[now] = 1;
for (int i = 0; i < g[now].size(); i++) {
int v = g[now][i];
if (vis[v]) continue;
ans[v] = now;
dfs(v);
}
}
int main() {
memset(vis, 0, sizeof(vis));
memset(du, 0, sizeof(du));
memset(g, 0, sizeof(g));
scanf("%d%d%d", &n, &r1, &r2);
for (i = 1; i <= n; i++) {
if (i == r1) continue;
scanf("%d", &sb);
g[i].push_back(sb);
g[sb].push_back(i);
du[i]++; du[sb]++;
}
dfs(r2);
int bo = 0;
for (i = 1; i <= n; i++) {
if (i == r2) continue;
if (bo++) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
return 0;
}
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.
Sample test(s)
input
3 2 3 2 2
output
2 3
input
6 2 4 6 1 2 4 2
output
6 4 1 4 2
题意:很不好理解,n个城市编号1-n,现在要从首都r1迁徙到首都r2,迁徙前有一个表示国家的地图,地图的表示方法为,每个点对应的是他的前驱,首都无前驱跳过,问迁徙后的地图表示方法。图必然是一棵生成树(n-1条边)
思路:每个点对应前驱相连,这样就能构成图了,在从新的首都往后遍历,遍历过程中记录下答案。
代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 100005;
int n, r1, r2, sb;
vector<int> g
;
int du
, i;
int vis
;
int ans
;
void dfs(int now) {
vis[now] = 1;
for (int i = 0; i < g[now].size(); i++) {
int v = g[now][i];
if (vis[v]) continue;
ans[v] = now;
dfs(v);
}
}
int main() {
memset(vis, 0, sizeof(vis));
memset(du, 0, sizeof(du));
memset(g, 0, sizeof(g));
scanf("%d%d%d", &n, &r1, &r2);
for (i = 1; i <= n; i++) {
if (i == r1) continue;
scanf("%d", &sb);
g[i].push_back(sb);
g[sb].push_back(i);
du[i]++; du[sb]++;
}
dfs(r2);
int bo = 0;
for (i = 1; i <= n; i++) {
if (i == r2) continue;
if (bo++) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
return 0;
}
相关文章推荐
- codeforces 117C - Cycle 图论 DFS
- Codeforces 467D. Fedor and Essay (Graphs,dfs,dp,hashing,strings,图论综合型好题)
- codeforces 129C - Statues 图论 DFS
- codeforces 154C Double Profiles (简单图论+哈希)
- codeforces 804B——Ice cream coloring(图论,dfs,数据结构,好题)
- CodeForces 550B Preparing Olympiad 简单DFS
- Codeforces 858F ( Codeforces Round #434 Div. 2 F ) Wizard's Tour 图论dfs
- Codeforces 721C Journey (简单dp,dfs)
- CodeForces 919C(DFS)
- codeforces Cthulhu 简单图论
- 【DFS】Codeforces 717E Paint it really, really dark gray
- Codeforces 382D Ksenia and Pawns(逆向dfs)
- CODEFORCES 515D Drazil and Tiles <路径dfs + 跳格>
- HDOJ 1312 Red and Black(简单dfs)
- coderforces 405E 图论dfs
- Codeforces 842C - Ilya And The Tree 【树上DFS】
- CodeForces - 915C Permute Digits (dfs)
- UVaOJ 572 Oil Deposits 简单的DFS遍历
- CodeForces 510B Fox And Two Dots(判断环的存在性,DFS一类题)
- Codeforces 732F Tourist Reform【思维+边双联通+Dfs处理后继问题】好题!