CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Akseli Jussinmäki
Submission time:2019-03-06 13:50:43 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1, 2, 3details
#20.03 s1, 2, 3details
#30.02 s1, 2, 3details
#40.02 s1, 2, 3details
#50.02 s1, 2, 3details
#60.02 s1, 2, 3details
#70.02 s1, 2, 3details
#80.02 s1, 2, 3details
#90.03 s1, 2, 3details
#100.02 s1, 2, 3details
#110.03 s1, 2, 3details
#120.02 s2, 3details
#130.02 s2, 3details
#140.02 s2, 3details
#150.03 s2, 3details
#160.16 s3details
#170.16 s3details
#180.15 s3details
#190.07 s3details
#200.03 s1, 2, 3details

Code

#include <bits/stdc++.h>
using namespace std;
vector<int> v[200002];
int s[100001]={}, r[100001]={};
int x=1, y=2;
void f(int c, int d){
	if (r[c]==1) {
		cout << c << " ";
		if (c!=1) return;
	}
	for (auto u:v[c]) if (u!=d) f(u,c);
	if (c!=1) cout << c << " ";
}
void g(int c){
	if (c>=1){
		cout << x << " " << y+1 << "\n";
		y++;
		s[y]=x;
		g(c-1);
	}
}
int main(){
	int t, n, a, b;
	cin >> t >> n;
	if (t==1){
		for (int i=1; i<n; ++i){
			cin >> a >> b;
			r[a]++;
			r[b]++;
			v[a].push_back(b);
			v[b].push_back(a);
		}
		f(1,0);
	}
	if (t==2){
		cout << 1 << " " << 2 << "\n";
		s[1]=2;
		for (int i=2; i<=n; ++i){
			cin >> a;
			x=s[x];
			if (a!=1) g(a-1); 
		}
	}
}

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:

input
1
3
3 1
2 1

correct output
(empty)

user output
3 2 

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1

correct output
(empty)

user output
3 2 4 

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3

correct output
(empty)

user output
1 2
2 3
0 4

Test 5

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
2 4 5 3 

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
5 2 4 3 

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
1 2
2 3
0 4
0 5

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

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

Test 9

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
4 10 3 2 9 7 5 8 6 

Test 10

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
9 3 8 10 5 2 6 7 4 

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
4 3 5 7 8 10 6 9 2 

Test 12

Group: 2, 3

Verdict:

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

correct output
(empty)

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

Test 13

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
72 39 306 78 155 252 176 365 2...

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
20 21 111 434 484 8 296 282 40...

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
494 437 270 70 218 488 120 351...

Test 16

Group: 3

Verdict:

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

correct output
(empty)

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

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
70102 3683 3383 90854 17657 64...

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
60473 63929 49648 49947 1551 9...

Test 19

Group: 3

Verdict:

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

correct output
(empty)

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

Test 20

Group: 1, 2, 3

Verdict:

input
1
6
2 1
3 2
4 2
...

correct output
(empty)

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