| Task: | Distance Code |
| Sender: | return_my_2007 |
| Submission time: | 2019-03-10 15:27:34 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 21 |
| #2 | ACCEPTED | 47 |
| #3 | ACCEPTED | 32 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #9 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #10 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #11 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #12 | ACCEPTED | 0.02 s | 2, 3 | details |
| #13 | ACCEPTED | 0.03 s | 2, 3 | details |
| #14 | ACCEPTED | 0.01 s | 2, 3 | details |
| #15 | ACCEPTED | 0.02 s | 2, 3 | details |
| #16 | ACCEPTED | 0.05 s | 3 | details |
| #17 | ACCEPTED | 0.06 s | 3 | details |
| #18 | ACCEPTED | 0.05 s | 3 | details |
| #19 | ACCEPTED | 0.05 s | 3 | details |
| #20 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
Code
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n;
vector <int> g[N];
vector <int> top;
void dfs(int u, int p) {
for (int v : g[u]) {
if (v != p) dfs(v, u);
}
top.push_back(u);
}
void coder() {
cin >> n;
for (int i = 0; i < n - 1; ++i) {
int u, v;
cin >> u >> v;
--u; --v;
g[u].push_back(v); g[v].push_back(u);
}
dfs(0, 0);
for (int e : top) cout << e + 1 << ' ';
cout << '\n';
}
int ptr = 1;
int par[N];
void encoder() {
cin >> n;
for (int i = 0; i < n; ++i) par[i] = -1;
int u = 0;
for (int i = 0; i < n - 1; ++i) {
int d; cin >> d;
if (d == 1) {
if (par[u] == -1) {
par[u] = ptr++;
cout << u + 1 << ' ' << par[u] + 1 << '\n';
}
u = par[u];
}
else {
if (par[u] == -1) {
par[u] = ptr++;
cout << u + 1 << ' ' << par[u] + 1 << '\n';
}
u = par[u];
for (int j = 0; j < d - 1; ++j) {
cout << u + 1 << ' ' << ptr + 1 << '\n';
par[ptr] = u;
u = ptr;
++ptr;
}
}
}
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int t;
cin >> t;
if (t == 1) {
coder();
}
else {
encoder();
}
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 2 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 3 3 1 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 4 3 2 2 1 4 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 4 2 3 3 4 1 3 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 2 4 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 3 5 4 1 1 3 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 3 2 3 4 5 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 3 5 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 4 3 1 4 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 2 4 2 5 |
Test 8
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 9 3 8 9 2 9 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 2 4 2 5 2 6 ... |
Test 9
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 9 2 5 8 7 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 5 6 ... |
Test 10
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 10 4 9 1 4 7 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 2 5 5 6 ... |
Test 11
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 2 6 4 3 3 5 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 5 6 ... |
Test 12
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 10 6 6 255 6 428 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 2 4 2 5 2 6 ... Truncated |
Test 13
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 152 466 451 313 158 479 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 5 6 ... Truncated |
Test 14
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 109 440 330 190 443 161 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 4 6 ... Truncated |
Test 15
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 144 373 257 233 341 318 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 5 6 ... Truncated |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 54983 75172 93807 75172 44082 75172 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 2 4 2 5 2 6 ... Truncated |
Test 17
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 88863 19059 86423 76688 98536 95984 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 5 6 ... Truncated |
Test 18
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 59979 6389 19097 24999 27846 82330 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 4 6 ... Truncated |
Test 19
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 58761 66001 25102 51081 98625 67861 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 5 6 ... Truncated |
Test 20
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 6 2 1 3 2 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 2 4 4 5 4 6 |
