CSES - Datatähti 2024 loppu - Results
Submission details
Task:Polut
Sender:Bean Benestrom
Submission time:2024-01-20 16:43:06 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.00 s1, 2, 3details
#20.00 s1, 2, 3details
#30.00 s1, 2, 3details
#40.00 s1, 2, 3details
#50.00 s1, 2, 3details
#60.00 s1, 2, 3details
#70.00 s1, 2, 3details
#80.00 s1, 2, 3details
#90.00 s1, 2, 3details
#100.00 s1, 2, 3details
#110.00 s1, 2, 3details
#120.01 s2, 3details
#130.02 s2, 3details
#140.02 s2, 3details
#150.02 s2, 3details
#160.02 s2, 3details
#170.02 s2, 3details
#180.26 s3details
#190.43 s3details
#200.43 s3details
#210.43 s3details
#220.44 s3details
#230.44 s3details

Compiler report

input/code.cpp: In function 'int walk(int, int, int)':
input/code.cpp:27:14: warning: unused variable 'edge' [-Wunused-variable]
   27 |     for (int edge : Edges[current]) {
      |              ^~~~
input/code.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
   30 | }
      | ^

Code

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

std::vector<std::vector<int>> Edges;
std::vector<bool> has_parent;
std::unordered_map<int, int> map;
int current_id = 1;


int walk(int from, int current, int id) {
    if (map[current]) {
        return map[current];
    }
    map[current] = id;

    if (Edges[current].size() == 1) {
        int value = walk(current, Edges[current][0], id);
        if (value) { 
            map[current] = value;
            return value;
        }

    }


    for (int edge : Edges[current]) {

    }
}


int main() {
    int NODES, EDGES_AMOUNT;
    std::cin >> NODES >> EDGES_AMOUNT;

    for (int i=0; i<NODES; i++) {
        Edges.push_back({});
        has_parent.push_back(false);
    }

    int a, b;
    for (int i=0; i<EDGES_AMOUNT; i++) {
        std::cin >> a >> b;
        Edges[a-1].push_back(b-1);
        has_parent[b-1] = true;
    }
    
    std::vector<int> nodes_without_parent;

    for (int i=0; i<NODES; i++) {
        if (!has_parent[i]) nodes_without_parent.push_back(i);
    }

    // SSSSS

    

    return 0;
}

/*

ACCEABFFZZZZ

*/

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
2 0

correct output
YES
1 2 
1 1 

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict:

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

correct output
YES
2 2 5 
3 1 3 4 

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict:

input
200 300
74 145
156 176
192 168
141 133
...

correct output
YES
87 200 136 117 13 169 22 187 1...

user output
(empty)

Test 4

Group: 1, 2, 3

Verdict:

input
200 500
37 119
47 10
17 31
130 28
...

correct output
YES
90 84 70 170 117 129 17 31 186...

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict:

input
200 500
79 1
104 127
31 38
83 85
...

correct output
YES
7 70 186 22 171 36 40 135 
193 41 91 25 42 160 83 2 173 5...

user output
(empty)

Test 6

Group: 1, 2, 3

Verdict:

input
200 500
145 50
4 102
136 55
148 34
...

correct output
YES
109 70 125 78 128 170 126 184 ...

user output
(empty)

Test 7

Group: 1, 2, 3

Verdict:

input
200 500
44 38
198 85
69 167
74 39
...

correct output
NO

user output
(empty)

Test 8

Group: 1, 2, 3

Verdict:

input
200 500
41 93
98 4
171 72
127 166
...

correct output
YES
88 76 116 195 197 82 42 130 46...

user output
(empty)

Test 9

Group: 1, 2, 3

Verdict:

input
192 494
17 148
82 57
100 152
38 102
...

correct output
YES
154 191 183 77 3 173 83 112 15...

user output
(empty)

Test 10

Group: 1, 2, 3

Verdict:

input
193 497
24 110
17 193
129 117
23 186
...

correct output
YES
24 156 123 30 189 95 34 5 96 1...

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict:

input
194 500
57 158
23 40
31 50
189 121
...

correct output
YES
27 168 116 136 175 180 12 89 6...

user output
(empty)

Test 12

Group: 2, 3

Verdict:

input
10000 15000
8243 3033
3299 579
4920 2342
2816 7811
...

correct output
YES
9236 3099 5585 9185 7222 9342 ...

user output
(empty)

Test 13

Group: 2, 3

Verdict:

input
10000 20000
6246 3603
5105 3531
6953 4682
2625 3510
...

correct output
YES
8734 5847 7473 5388 4872 4557 ...

user output
(empty)

Test 14

Group: 2, 3

Verdict:

input
10000 20000
5853 1019
2465 2936
2022 3609
9429 4118
...

correct output
YES
5204 3987 6388 4732 4403 7869 ...

user output
(empty)

Test 15

Group: 2, 3

Verdict:

input
10000 20000
3439 3806
9336 5210
7784 848
5162 9830
...

correct output
NO

user output
(empty)

Test 16

Group: 2, 3

Verdict:

input
10000 20000
8908 287
2525 6024
1851 844
72 6898
...

correct output
YES
2487 3806 7839 4969 2661 4199 ...

user output
(empty)

Test 17

Group: 2, 3

Verdict:

input
7621 19995
6223 473
4893 990
5326 3614
421 591
...

correct output
YES
6340 5076 2779 1201 7053 1720 ...

user output
(empty)

Test 18

Group: 3

Verdict:

input
200000 300000
17151 175317
68698 43101
190738 54240
105443 37722
...

correct output
YES
163946 182154 120966 26194 771...

user output
(empty)

Test 19

Group: 3

Verdict:

input
200000 500000
128290 197429
67543 48696
156347 40114
114481 197
...

correct output
YES
30833 112330 10351 23335 11682...

user output
(empty)

Test 20

Group: 3

Verdict:

input
200000 500000
93623 55553
60858 72598
15531 30650
196624 28459
...

correct output
YES
99923 156477 12892 147937 1060...

user output
(empty)

Test 21

Group: 3

Verdict:

input
200000 500000
76457 8199
163450 19462
107840 24269
178642 128924
...

correct output
NO

user output
(empty)

Test 22

Group: 3

Verdict:

input
200000 500000
181062 44502
115318 176115
33437 57568
163325 17752
...

correct output
YES
141551 129409 52010 108449 242...

user output
(empty)

Test 23

Group: 3

Verdict:

input
190479 499998
113031 136485
5993 50604
19834 84581
39043 93744
...

correct output
YES
170843 113031 163271 166394 43...

user output
(empty)