| Task: | Distance Code |
| Sender: | pwild |
| Submission time: | 2019-03-09 22:56:29 +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.01 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #9 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #10 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #11 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #12 | ACCEPTED | 0.02 s | 2, 3 | details |
| #13 | ACCEPTED | 0.03 s | 2, 3 | details |
| #14 | ACCEPTED | 0.03 s | 2, 3 | details |
| #15 | ACCEPTED | 0.03 s | 2, 3 | details |
| #16 | ACCEPTED | 0.12 s | 3 | details |
| #17 | ACCEPTED | 0.13 s | 3 | details |
| #18 | ACCEPTED | 0.14 s | 3 | details |
| #19 | ACCEPTED | 0.13 s | 3 | details |
| #20 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define FORD(i,a,b) for (ll i = (b)-1; i >= (a); i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define has(c,i) ((c).find(i) != end(c))
#define TR(X) ({ if(1) cerr << "TR: " << (#X) << " = " << (X) << endl; })
void dfs(ll i, ll p, vvl &adj) {
for (ll j: adj[i]) {
if (j == p) continue;
dfs(j,i,adj);
}
cout << i+1 << " ";
}
void encoder() {
ll n; cin >> n;
vvl adj(n);
FOR(i,1,n) {
ll a, b;
cin >> a >> b;
a--, b--;
adj[a].pb(b);
adj[b].pb(a);
}
dfs(0,-1,adj);
cout << endl;
}
void decoder() {
ll n; cin >> n;
vl dist(n-1);
FOR(i,0,n-1) cin >> dist[i];
vl p(n,-1);
FORD(i,0,n-1) {
ll j = i+1;
while (dist[i]-- > 1) j = p[j];
p[i] = j;
cout << i+1 << " " << j+1 << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll mode; cin >> mode;
if (mode == 1) encoder();
else decoder();
}
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 |
|---|
| 2 3 1 3 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 4 3 2 2 1 4 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 4 2 4 1 2 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 4 2 3 3 4 1 3 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 4 2 3 1 3 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 3 5 4 1 1 3 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 4 5 3 4 2 5 1 2 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 3 2 3 4 5 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 4 5 3 4 2 4 1 5 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 4 3 1 4 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 4 5 3 4 2 4 1 4 |
Test 8
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 9 3 8 9 2 9 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 9 10 8 9 7 9 6 9 5 9 ... |
Test 9
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 9 2 5 8 7 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 9 10 8 9 7 8 6 10 5 6 ... |
Test 10
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 10 4 9 1 4 7 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 9 10 8 9 7 8 6 7 5 6 ... |
Test 11
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 2 6 4 3 3 5 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 9 10 8 9 7 9 6 7 5 10 ... |
Test 12
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 10 6 6 255 6 428 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 499 500 498 499 497 499 496 499 495 499 ... |
Test 13
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 152 466 451 313 158 479 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 499 500 498 499 497 498 496 497 495 496 ... |
Test 14
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 109 440 330 190 443 161 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 499 500 498 499 497 498 496 497 495 496 ... |
Test 15
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 144 373 257 233 341 318 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 499 500 498 499 497 498 496 497 495 496 ... |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 54983 75172 93807 75172 44082 75172 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 99999 100000 99998 99999 99997 99999 99996 99999 99995 99999 ... |
Test 17
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 88863 19059 86423 76688 98536 95984 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 99999 100000 99998 99999 99997 99998 99996 99997 99995 99996 ... |
Test 18
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 59979 6389 19097 24999 27846 82330 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 99999 100000 99998 99999 99997 99998 99996 99997 99995 99996 ... |
Test 19
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 100000 58761 66001 25102 51081 98625 67861 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 99999 100000 99998 99999 99997 99998 99996 99997 99995 99996 ... |
Test 20
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 6 2 1 3 2 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 5 6 4 5 3 5 2 3 1 3 |