CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Jonathan Lööv
Submission time:2019-03-06 12:53:44 +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.04 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.01 s1, 2, 3details
#11ACCEPTED0.01 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.16 s3details
#17ACCEPTED0.17 s3details
#18ACCEPTED0.17 s3details
#19ACCEPTED0.16 s3details
#20ACCEPTED0.02 s1, 2, 3details

Code

#include <iostream>
#include <vector>
#include <unordered_map>

std::vector<int> nodes;
std::unordered_map<int, std::vector<int> > connections;


void pop_leaves(int node, int parent) {
    for (int to : connections[node]) {
        if (to != parent) {
            pop_leaves(to, node);
        }
    }

    std::cout << node << std::endl;
}

void encode() {
    int nnodes;
    std::cin >> nnodes;


    for (int i = 0; i < nnodes - 1; i++) {
        int f, t;
        std::cin >> f >> t;

        if (connections.count(f) == 0) {
            connections[f] = std::vector<int>();
        }
        connections[f].push_back(t);

        if (connections.count(t) == 0) {
            connections[t] = std::vector<int>();
        }
        connections[t].push_back(f);
    }

    pop_leaves(1, 0);

}


void decode() {
    int nnodes;
    std::cin >> nnodes;

    int current_node = 1;
    int max_node_idx = 1;

    std::unordered_map<int, int> connections_upwards;

    for (int i = 0; i < nnodes - 1; i++) {
        int dist;
        std::cin >> dist;

        int above;
        if (connections_upwards.count(current_node) != 0) {
            above = connections_upwards[current_node];
        } else {
            max_node_idx++;
            above = max_node_idx;
            connections_upwards[current_node] = above;
        }

        for (int j = 0; j < dist - 1; j++) {
            max_node_idx++;
            int down = max_node_idx;
            connections_upwards[down] = above;
            above = down;
        }

        current_node = above;
    }

    for (auto it = connections_upwards.begin(); it != connections_upwards.end(); it++) {
        std::cout << it->first << " " << it->second << std::endl;
    }
}

int main() {
    int t;
    std::cin >> t;
    if (t == 1) {
        encode();
    } else {
        decode();
    }
}

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

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
3 2
2 1
4 1

correct output
(empty)

user output
4 3
1 2
2 3

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
2 3
3 4
1 3

correct output
(empty)

user output
2 4
1 2
3 2

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
5 4
4 3
1 2
2 3

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
5 3
4 3
1 2
3 2

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
2 5
4 2
1 2
3 2

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
2 10
9 2
8 2
3 2
1 2
...

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
10 9
9 8
8 7
2 3
1 2
...

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
10 9
9 8
8 7
3 2
1 2
...

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
10 7
9 8
8 7
2 3
1 2
...

Test 12

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
2 500
499 2
498 2
497 2
496 2
...
Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
500 499
499 498
498 497
497 496
496 495
...
Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
500 499
499 498
498 497
497 496
496 3
...
Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
500 499
499 498
498 497
497 496
496 495
...
Truncated

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
2 100000
99999 2
99998 2
99997 2
99996 2
...
Truncated

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
100000 99999
99999 99998
99998 99997
99997 99996
99996 99995
...
Truncated

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
100000 99999
99999 20
99998 99997
99997 99991
99996 99995
...
Truncated

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
99999 100000
99998 99999
99997 99998
99983 99997
99996 99995
...
Truncated

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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