#include <iostream>
#include <vector>
using namespace std;
vector <int> graph[100];
int depth[100], parent[100];
void dfs(int u) {
for (int &v : graph[u]) {
if (v == parent[u]) continue;
parent[v] = u;
depth[v] = depth[u] + 1;
dfs(v);
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, a, b;
cin >> n >> a;
cout << 4 * n;
for (int i = 1; i < n; i++) {
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
a = 0; b = -1;
while (graph[a].size() > 1) {
if (b == graph[a][0]) {
b = a;
a = graph[a][1];
}
else {
b = a;
a = graph[a][0];
}
}
parent[a] = a;
dfs(a);
for (int i = 0; i < 2 * n; i++) {
cout << '\n';
for (int j = 0; j < n; j++) cout << (depth[j] & 1 ? parent[j] : j) << ' ';
cout << '\n';
for (int j = 0; j < n; j++) cout << (depth[j] & 1 ? parent[j] : parent[parent[j]]) << ' ';
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
2 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
If people start at 0 and 2, then they can avoid each other |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
2 ms |
348 KB |
Output is correct |
| 6 |
Correct |
2 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
2 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
348 KB |
Output is correct |
| 11 |
Correct |
2 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
344 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
2 ms |
348 KB |
Output is correct |
| 17 |
Correct |
2 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
348 KB |
Output is correct |
| 21 |
Correct |
2 ms |
344 KB |
Output is correct |
| 22 |
Correct |
2 ms |
348 KB |
Output is correct |
| 23 |
Correct |
1 ms |
348 KB |
Output is correct |
| 24 |
Correct |
0 ms |
348 KB |
Output is correct |
| 25 |
Correct |
0 ms |
348 KB |
Output is correct |
| 26 |
Correct |
1 ms |
348 KB |
Output is correct |
| 27 |
Correct |
2 ms |
348 KB |
Output is correct |
| 28 |
Correct |
2 ms |
344 KB |
Output is correct |
| 29 |
Correct |
2 ms |
532 KB |
Output is correct |
| 30 |
Correct |
4 ms |
348 KB |
Output is correct |
| 31 |
Correct |
2 ms |
348 KB |
Output is correct |
| 32 |
Correct |
2 ms |
344 KB |
Output is correct |
| 33 |
Correct |
2 ms |
344 KB |
Output is correct |
| 34 |
Correct |
2 ms |
348 KB |
Output is correct |
| 35 |
Correct |
2 ms |
348 KB |
Output is correct |
| 36 |
Correct |
2 ms |
348 KB |
Output is correct |
| 37 |
Correct |
3 ms |
344 KB |
Output is correct |
| 38 |
Correct |
2 ms |
348 KB |
Output is correct |
| 39 |
Correct |
2 ms |
348 KB |
Output is correct |
| 40 |
Correct |
2 ms |
348 KB |
Output is correct |
| 41 |
Correct |
3 ms |
424 KB |
Output is correct |
| 42 |
Correct |
2 ms |
348 KB |
Output is correct |
| 43 |
Correct |
3 ms |
344 KB |
Output is correct |
| 44 |
Correct |
2 ms |
344 KB |
Output is correct |
| 45 |
Correct |
2 ms |
348 KB |
Output is correct |
| 46 |
Correct |
0 ms |
348 KB |
Output is correct |
| 47 |
Correct |
0 ms |
348 KB |
Output is correct |
| 48 |
Correct |
0 ms |
348 KB |
Output is correct |
| 49 |
Correct |
0 ms |
348 KB |
Output is correct |
| 50 |
Correct |
0 ms |
348 KB |
Output is correct |
| 51 |
Correct |
0 ms |
348 KB |
Output is correct |
| 52 |
Correct |
0 ms |
348 KB |
Output is correct |
| 53 |
Correct |
0 ms |
348 KB |
Output is correct |
| 54 |
Correct |
0 ms |
348 KB |
Output is correct |
| 55 |
Correct |
0 ms |
348 KB |
Output is correct |
| 56 |
Correct |
0 ms |
348 KB |
Output is correct |
| 57 |
Correct |
0 ms |
348 KB |
Output is correct |
| 58 |
Correct |
0 ms |
348 KB |
Output is correct |
| 59 |
Correct |
0 ms |
344 KB |
Output is correct |
| 60 |
Correct |
0 ms |
348 KB |
Output is correct |
| 61 |
Correct |
0 ms |
348 KB |
Output is correct |
| 62 |
Correct |
0 ms |
348 KB |
Output is correct |
| 63 |
Correct |
0 ms |
348 KB |
Output is correct |
| 64 |
Correct |
0 ms |
348 KB |
Output is correct |
| 65 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
2 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
If people start at 0 and 2, then they can avoid each other |
| 8 |
Halted |
0 ms |
0 KB |
- |
