— Dark mode

NOI 2019

Distance Code

  • Start: 2019-03-06 11:00:00
  • End: 2019-03-06 16:00:00
Submission details
Task:Distance Code
Sender:Roope Salmi
Submission time:2019-03-06 11:18:38 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.03 s1, 2, 3details
#3ACCEPTED0.03 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.03 s1, 2, 3details
#8ACCEPTED0.02 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#10ACCEPTED0.02 s1, 2, 3details
#11ACCEPTED0.02 s1, 2, 3details
#12ACCEPTED0.01 s2, 3details
#13ACCEPTED0.01 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.06 s3details
#17ACCEPTED0.06 s3details
#18ACCEPTED0.05 s3details
#19ACCEPTED0.05 s3details
#20ACCEPTED0.02 s1, 2, 3details

Code

#include <bits/stdc++.h>
using namespace std;
vector<int> v[101010];
int p[101010];
vector<int> o;
void h(int i, int p) {
  for (int j : v[i]) {
    if (j == p) continue;
    h(j, i);
  }
  o.push_back(i);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  int n;
  cin >> n;
  if (t == 1) {
    for (int i = 0; i < n-1; ++i) {
      int a, b;
      cin >> a >> b;
      a--; b--;
      v[a].push_back(b);
      v[b].push_back(a);
    }
    h(0, -1);
    for (int i : o) cout << i+1 << " ";
    cout << endl;
  } else {
    int ni = 0;
    int nc = 1;
    p[0] = 0;
    int t[n-1];
    for (int i = 0; i < n-1; ++i) cin >> t[i];
    for (int i = n-2; i >= 0; --i) {
      while (t[i] > 1) {
        t[i]--;
        ni = p[ni];
      }
      int nn = nc++;
      p[nn] = ni;
      ni = nn;
    }
    for (int i = 1; i < n; ++i) {
      cout << i+1 << " " << p[i]+1 << "\n";
    }
  }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
2
2 1
view save

correct output
(empty)

user output
2 1
view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
2 1
3 1
view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
2 1
3 1
4 3
view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
2 1
3 2
4 2
view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 5
4 1
1 3
...
view save

correct output
(empty)

user output
2 1
3 2
4 1
5 4
view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 2
3 4
5 1
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 1
view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
4 3
1 4
4 2
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 2
view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 3
8 9
2 9
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 2
6 2
...
view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 2
5 8
7 1
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 1
6 5
...
view save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
10 4
9 1
4 7
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
view save

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
2 6
4 3
3 5
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 4
6 1
...
view save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
1
500
10 6
6 255
6 428
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 2
6 2
...
Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
1
500
152 466
451 313
158 479
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
1
500
109 440
330 190
443 161
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
1
500
144 373
257 233
341 318
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 16

Group: 3

Verdict: ACCEPTED

input
1
100000
54983 75172
93807 75172
44082 75172
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 2
6 2
...
Truncated

Test 17

Group: 3

Verdict: ACCEPTED

input
1
100000
88863 19059
86423 76688
98536 95984
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 18

Group: 3

Verdict: ACCEPTED

input
1
100000
59979 6389
19097 24999
27846 82330
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 19

Group: 3

Verdict: ACCEPTED

input
1
100000
58761 66001
25102 51081
98625 67861
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
6
2 1
3 2
4 2
...
view save

correct output
(empty)

user output
2 1
3 2
4 2
5 4
6 4
view save

Tasks

A Distance Code-B Thieves and Prisons-C Graph Ordering-

Submissions (Roope Salmi)

2019-03-06 11:18:38 100