CSES - NOI 2019 Open - Results
Submission details
Task:Distance Code
Sender:justagirl
Submission time:2019-03-07 13:25:11 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.03 s1, 2, 3details
#4ACCEPTED0.03 s1, 2, 3details
#5ACCEPTED0.03 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#70.01 s1, 2, 3details
#80.02 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#100.02 s1, 2, 3details
#11ACCEPTED0.02 s1, 2, 3details
#120.02 s2, 3details
#13ACCEPTED0.01 s2, 3details
#140.02 s2, 3details
#150.02 s2, 3details
#160.05 s3details
#17ACCEPTED0.05 s3details
#180.05 s3details
#190.04 s3details
#20ACCEPTED0.01 s1, 2, 3details

Code

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
const int N=1e5 +4;
vector<int> adj[N];
int deg[N];
int main()
{

	ios_base:: sync_with_stdio(false); cin.tie(0);
	int t; cin>>t;

	int n; cin>>n;
	if(t==1) {
		for(int i=1; i<n; i++) {
			int u,v; cin>>u>>v;
			adj[u].push_back(v);
			adj[v].push_back(u);
			deg[u]++;
			deg[v]++;
		}
		vector<int> easy;
		for(int u=1; u<=n; u++) {
			if(deg[u]==1) {
				easy.push_back(u);
			}
		}

		while(easy.size()) {
			int u=easy.back();
			easy.pop_back();
			cout<<u<<" ";
			for(int v:adj[u]) {
				deg[v]--;
				if(deg[v]==1) {
					easy.push_back(v);
				}
			}
		}

	}
	else{
		for(int i=1; i<n; i++) {
			int u;
			cin>>u;
			cout<<i<<" "<<i+u<<endl;
		}
	}

	return 0;
}

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 3
2 3
3 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 4
3 4
4 5

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
1 3
2 4
3 4
4 5

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

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

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:

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

correct output
(empty)

user output
1 4
2 8
3 4
4 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 4
3 4
4 5
5 6
...

Test 12

Group: 2, 3

Verdict:

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

correct output
(empty)

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

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

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
1 2
2 3
3 4
4 18
5 17
...

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

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

Test 16

Group: 3

Verdict:

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

correct output
(empty)

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

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

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
1 15
2 17
3 21
4 5
5 23
...

Test 19

Group: 3

Verdict:

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

correct output
(empty)

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

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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