CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Håvard Rognebakke Krogstie
Submission time:2019-03-06 13:57:23 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.02 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.03 s1, 2, 3details
#10ACCEPTED0.02 s1, 2, 3details
#11ACCEPTED0.02 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.01 s2, 3details
#15ACCEPTED0.03 s2, 3details
#16ACCEPTED0.14 s3details
#17ACCEPTED0.14 s3details
#18ACCEPTED0.16 s3details
#19ACCEPTED0.15 s3details
#20ACCEPTED0.02 s1, 2, 3details

Code

#include <iostream>
#include <vector>
#include <stack>

using namespace std;

struct ENode {
	vector<int> edges;
};

void encode(int n) {
	ENode* nodes = new ENode[n];

	for(int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		nodes[a].edges.push_back(b);
		nodes[b].edges.push_back(a);
	}

	//root is 0
	vector<int> stk;
	stk.push_back(-1);
	stk.push_back(0);

	while(true) {
	    int n = stk.back();
		if(n == -1)
			break;
	    int parent = stk[stk.size()-2];
		auto& edges = nodes[n].edges;
	new_node:
		if(edges.size() == 0) {
			cout << (n+1) << " ";
			stk.pop_back();
			continue;
		}
	    int back = edges.back();
		edges.pop_back();
		if(back == parent)
			goto new_node;
		stk.push_back(back);
	}
	cout << endl;
}

struct DNode {
	int parent=-1;
};

void decode(int n) {
	DNode* nodes = new DNode[n];
	int used = 0;

	int currentNode = 0;
	used++;
	for(int i = 1; i < n; i++) {
		int dist;
		cin >> dist;
	    if(nodes[currentNode].parent == -1) {
			nodes[currentNode].parent = used;
			used++;
		}

		currentNode = nodes[currentNode].parent;
		for(int i = 1; i < dist; i++) {
			int next = used;
			used++;
			nodes[next].parent = currentNode;
			currentNode = next;
		}
	}

	for(int i = 0; i < n; i++) {
		if(nodes[i].parent != -1)
			cout << (i+1) << " " << (nodes[i].parent+1) << endl;
	}
}

int main() {
	int ed, n;
	cin >> ed >> n;
	if(ed == 1)
		encode(n);
	else
		decode(n);
}

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

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
3 2
2 1
4 1

correct output
(empty)

user output
1 2
3 2
4 3

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
2 3
3 4
1 3

correct output
(empty)

user output
1 2
2 4
3 2

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

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

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
1 2
2 5
3 2
4 2

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

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
5 4
6 5
...

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

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

Test 12

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

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

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

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

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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