CSES - NOI 2019

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
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.03 s	1, 2, 3	details
#3	ACCEPTED	0.04 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.01 s	1, 2, 3	details
#11	ACCEPTED	0.01 s	1, 2, 3	details
#12	ACCEPTED	0.02 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.02 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.16 s	3	details
#17	ACCEPTED	0.17 s	3	details
#18	ACCEPTED	0.17 s	3	details
#19	ACCEPTED	0.16 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

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` 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
`3 2 1 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
`4 3 1 2 2 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
`2 4 1 2 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
`5 4 4 3 1 2 2 3` 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
`5 3 4 3 1 2 3 2` 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
`2 5 4 2 1 2 3 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
`2 10 9 2 8 2 3 2 1 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
`10 9 9 8 8 7 2 3 1 2 ...` 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
`10 9 9 8 8 7 3 2 1 2 ...` 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
`10 7 9 8 8 7 2 3 1 2 ...` 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
`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 ...` view save

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

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

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

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

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

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

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

correct output
(empty)

user output
`4 6 5 4 2 4 1 2 3 2` 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 (Jonathan Lööv)