CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Matias Järvenpää
Submission time:2019-03-06 14:31:31 +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.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.03 s1, 2, 3details
#6ACCEPTED0.03 s1, 2, 3details
#7ACCEPTED0.03 s1, 2, 3details
#8ACCEPTED0.02 s1, 2, 3details
#9ACCEPTED0.03 s1, 2, 3details
#10ACCEPTED0.01 s1, 2, 3details
#11ACCEPTED0.03 s1, 2, 3details
#12ACCEPTED0.03 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.03 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.07 s3details
#17ACCEPTED0.08 s3details
#18ACCEPTED0.08 s3details
#19ACCEPTED0.08 s3details
#20ACCEPTED0.02 s1, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:82:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int64_t i2=0; i2<v2[i+1].size(); i2++){
                         ~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'int64_t hae(int64_t)':
input/code.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
input/code.cpp: In function 'int64_t e(int64_t, int64_t, int64_t)':
input/code.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Code

#include <bits/stdc++.h>
using namespace std;

int64_t t,n;
set<int64_t> v[100001];
int64_t d[100001];
int64_t ta[100000];
    vector<int64_t> v2[100001];

void dis(int64_t index,int64_t di, int64_t prev){
  d[index] = di;
  for(auto it = v[index].begin(); it != v[index].end(); it++){
    if(*it != prev){
      dis(*it,di+1,index);
    }
  }
}

int64_t hae(int64_t index){
  if((v[index].size() == 1) && (index != 1)){
    return index;
  }
  for(auto it = v[index].begin(); it != v[index].end(); it++){
    if(d[index] < d[*it]){
      return hae(*it);
    }
  }
}

int64_t e(int64_t index, int64_t step, int64_t cur){
  if(step == cur){
    return index;
  }
  /* if(v2[index].size() != 1){
    // cout << "?\n";
  }*/
  e(v2[index][0],step,cur+1);
  
}

int main(){
  cin >> t >> n;
  if(t == 1){
    for(int64_t i=0; i<(n-1); i++){
      int64_t a,b;
      cin >> a >> b;
      v[a].insert(b);
      v[b].insert(a);
    }
    dis(1,0,-1);
    int64_t s;
    for(int64_t i=1; i<n; i++){
      if(v[i+1].size() == 1){
	s = i+1;
	break;
      }
    }
    for(int64_t i=1; i<n; i++){
      cout << s << " ";
      int64_t next = *v[s].begin();
      v[s].clear();
      v[next].erase(s);
      s = hae(next);
    }
    cout << "1\n";
  }
  else{
    for(int64_t i=0; i<(n-1); i++){
      cin >> ta[i];
    }
    int64_t prev = 1;
    int64_t num = 2;
    for(int64_t i=(n-2); i>=0; i--){
      //cout << i << "\n";
      prev = e(prev,ta[i]-1,0);
      v2[num].push_back(prev);
      prev = num;
      num++;
    }
    
    for(int64_t i=0; i<n; i++){
      for(int64_t i2=0; i2<v2[i+1].size(); i2++){
	cout << i+1 << " " << v2[i+1][i2] << "\n";
      }
    }
  }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
2
2 1

correct output
(empty)

user output
2 1

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
3
3 1
2 1

correct output
(empty)

user output
2 1
3 1

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
3 2
2 1
4 1

correct output
(empty)

user output
2 1
3 1
4 3

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
2 3
3 4
1 3

correct output
(empty)

user output
2 1
3 2
4 2

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 5
4 1
1 3
...

correct output
(empty)

user output
2 1
3 2
4 1
5 4

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 2
3 4
5 1
...

correct output
(empty)

user output
2 1
3 1
4 3
5 3

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
4 3
1 4
4 2
...

correct output
(empty)

user output
2 1
3 2
4 2
5 2

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
10 4
9 1
4 7
...

correct output
(empty)

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

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 12

Group: 2, 3

Verdict: ACCEPTED

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

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
...

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
...

correct output
(empty)

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

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

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
...

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
...

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
...

correct output
(empty)

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

Test 19

Group: 3

Verdict: ACCEPTED

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

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
...

correct output
(empty)

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