CSES - NOI 2019

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
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	47
#3	ACCEPTED	32

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.02 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.02 s	1, 2, 3	details
#6	ACCEPTED	0.02 s	1, 2, 3	details
#7	ACCEPTED	0.02 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.03 s	1, 2, 3	details
#10	ACCEPTED	0.02 s	1, 2, 3	details
#11	ACCEPTED	0.02 s	1, 2, 3	details
#12	ACCEPTED	0.02 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.01 s	2, 3	details
#15	ACCEPTED	0.03 s	2, 3	details
#16	ACCEPTED	0.14 s	3	details
#17	ACCEPTED	0.14 s	3	details
#18	ACCEPTED	0.16 s	3	details
#19	ACCEPTED	0.15 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

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` view save

correct output
(empty)

user output
`1 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
`1 2 3 2` 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
`1 2 3 2 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
`1 2 2 4 3 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
`1 2 2 3 4 3 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
`1 2 2 4 3 2 5 4` 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
`1 2 2 5 3 2 4 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
`1 2 2 10 3 2 4 2 5 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
`1 2 2 3 3 4 5 4 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
`1 2 2 3 3 4 4 5 5 7 ...` 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
`1 2 2 5 3 2 4 3 6 5 ...` 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
`1 2 2 500 3 2 4 2 5 2 ...` view save

Test 13

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 2 100000 3 2 4 2 5 2 ...` view save

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 2 3 3 99982 4 3 5 4 ...` view save

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

NOI 2019

Distance Code

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Håvard Rognebakke Krogstie)