CSES - Aalto Competitive Programming 2024 - wk7 - Mon - Results
Submission details
Task:Road blockade
Sender:louaha1
Submission time:2024-10-21 17:49:24 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#10.01 sdetails
#20.01 sdetails
#30.01 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.01 sdetails
#60.01 sdetails
#70.01 sdetails
#80.01 sdetails
#90.01 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.01 sdetails
#120.01 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#150.01 sdetails
#160.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#200.01 sdetails
#21ACCEPTED0.01 sdetails
#220.01 sdetails
#230.01 sdetails
#24ACCEPTED0.01 sdetails
#250.01 sdetails
#260.01 sdetails
#27ACCEPTED0.01 sdetails
#28ACCEPTED0.01 sdetails
#29ACCEPTED0.01 sdetails
#300.01 sdetails
#310.01 sdetails
#320.01 sdetails
#330.01 sdetails
#340.01 sdetails
#35ACCEPTED0.01 sdetails
#360.01 sdetails
#370.01 sdetails
#38ACCEPTED0.01 sdetails
#390.01 sdetails
#400.01 sdetails
#410.01 sdetails
#420.01 sdetails
#430.01 sdetails
#440.01 sdetails
#450.01 sdetails
#460.01 sdetails
#470.01 sdetails
#48ACCEPTED0.01 sdetails
#490.01 sdetails
#500.01 sdetails
#510.01 sdetails
#520.01 sdetails
#530.01 sdetails
#540.01 sdetails
#550.01 sdetails
#560.01 sdetails
#570.01 sdetails
#58ACCEPTED0.01 sdetails
#590.01 sdetails
#600.12 sdetails
#610.11 sdetails
#62ACCEPTED0.16 sdetails
#63ACCEPTED0.17 sdetails
#640.11 sdetails
#650.13 sdetails
#660.12 sdetails
#670.12 sdetails
#680.20 sdetails
#690.11 sdetails

Code

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100005;

vector<pair<int, int>> adj[MAXN];
int tin[MAXN], low[MAXN], timer;
bool visited[MAXN];
int result = 0;

void dfs(int v, int p) {
    visited[v] = true;
    tin[v] = low[v] = ++timer;
    for (auto edge : adj[v]) {
        int to = edge.first;
        int id = edge.second;
        if (to == p) continue;
        if (visited[to]) {
            low[v] = min(low[v], tin[to]);
        } else {
            dfs(to, v);
            low[v] = min(low[v], low[to]);
            if (low[to] > tin[v]) {
                if ((to == MAXN || v == MAXN)) {
                    result = id;
                }
            }
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].emplace_back(b, i + 1);
        adj[b].emplace_back(a, i + 1);
    }

    dfs(1, -1);

    cout << result << endl;
    return 0;
}

Test details

Test 1

Verdict:

input
2 1
1 2

correct output
1

user output
0

Test 2

Verdict:

input
3 2
1 2
2 3

correct output
1

user output
0

Test 3

Verdict:

input
3 2
2 3
1 2

correct output
2

user output
0

Test 4

Verdict: ACCEPTED

input
3 3
1 2
1 3
2 3

correct output
0

user output
0

Test 5

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 6

Verdict:

input
4 4
1 3
2 3
3 4
1 2

correct output
3

user output
0

Test 7

Verdict:

input
4 3
1 3
2 4
2 3

correct output
1

user output
0

Test 8

Verdict:

input
4 3
2 3
2 4
1 3

correct output
3

user output
0

Test 9

Verdict:

input
4 4
3 4
2 3
1 3
1 2

correct output
1

user output
0

Test 10

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 11

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 12

Verdict:

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

correct output
3

user output
0

Test 13

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 14

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 15

Verdict:

input
5 4
1 3
2 3
2 4
4 5

correct output
1

user output
0

Test 16

Verdict:

input
5 4
2 4
3 5
2 3
1 4

correct output
4

user output
0

Test 17

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 19

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 20

Verdict:

input
10 12
2 5
4 9
4 7
3 9
...

correct output
9

user output
0

Test 21

Verdict: ACCEPTED

input
10 43
7 10
1 2
1 3
2 3
...

correct output
0

user output
0

Test 22

Verdict:

input
10 11
2 5
2 3
6 7
1 2
...

correct output
4

user output
0

Test 23

Verdict:

input
10 10
4 9
5 9
7 8
6 8
...

correct output
8

user output
0

Test 24

Verdict: ACCEPTED

input
10 12
7 9
3 8
3 5
4 5
...

correct output
0

user output
0

Test 25

Verdict:

input
10 9
2 4
8 10
6 7
2 3
...

correct output
9

user output
0

Test 26

Verdict:

input
10 9
3 5
5 7
1 6
4 6
...

correct output
3

user output
0

Test 27

Verdict: ACCEPTED

input
10 37
5 9
3 4
1 4
7 10
...

correct output
0

user output
0

Test 28

Verdict: ACCEPTED

input
10 44
2 6
1 2
1 6
4 7
...

correct output
0

user output
0

Test 29

Verdict: ACCEPTED

input
10 27
1 10
7 10
4 7
2 9
...

correct output
0

user output
0

Test 30

Verdict:

input
100 107
44 59
24 76
35 79
14 57
...

correct output
107

user output
0

Test 31

Verdict:

input
100 107
27 79
43 89
83 96
34 75
...

correct output
42

user output
0

Test 32

Verdict:

input
100 143
13 14
20 59
25 95
38 84
...

correct output
129

user output
0

Test 33

Verdict:

input
100 155
29 92
3 63
16 18
9 28
...

correct output
36

user output
0

Test 34

Verdict:

input
100 105
74 85
6 49
7 81
45 55
...

correct output
50

user output
0

Test 35

Verdict: ACCEPTED

input
100 121
8 74
14 50
44 55
12 93
...

correct output
0

user output
0

Test 36

Verdict:

input
100 102
54 97
45 82
30 78
40 44
...

correct output
35

user output
0

Test 37

Verdict:

input
100 106
57 85
3 58
14 93
31 61
...

correct output
8

user output
0

Test 38

Verdict: ACCEPTED

input
100 188
3 58
53 63
8 19
97 100
...

correct output
0

user output
0

Test 39

Verdict:

input
100 100
16 94
48 96
4 37
71 85
...

correct output
41

user output
0

Test 40

Verdict:

input
200 207
111 188
80 121
115 170
157 175
...

correct output
199

user output
0

Test 41

Verdict:

input
200 207
99 117
139 143
151 174
136 184
...

correct output
190

user output
0

Test 42

Verdict:

input
200 287
36 180
125 138
33 147
38 188
...

correct output
77

user output
0

Test 43

Verdict:

input
200 310
162 195
21 199
95 180
29 127
...

correct output
30

user output
0

Test 44

Verdict:

input
200 205
140 187
127 185
100 196
55 144
...

correct output
150

user output
0

Test 45

Verdict:

input
200 243
8 85
73 137
52 72
51 157
...

correct output
53

user output
0

Test 46

Verdict:

input
200 202
45 72
5 96
1 31
35 187
...

correct output
3

user output
0

Test 47

Verdict:

input
200 214
81 116
113 164
154 199
17 153
...

correct output
45

user output
0

Test 48

Verdict: ACCEPTED

input
200 375
68 93
93 101
87 109
23 56
...

correct output
0

user output
0

Test 49

Verdict:

input
200 201
64 124
145 164
103 127
126 186
...

correct output
137

user output
0

Test 50

Verdict:

input
1000 1007
61 967
252 530
105 953
490 826
...

correct output
914

user output
0

Test 51

Verdict:

input
1000 1007
489 976
53 720
478 732
104 111
...

correct output
248

user output
0

Test 52

Verdict:

input
1000 1435
520 551
702 787
76 719
619 993
...

correct output
1114

user output
0

Test 53

Verdict:

input
1000 1550
206 315
476 801
287 713
456 677
...

correct output
1059

user output
0

Test 54

Verdict:

input
1000 1005
304 771
84 930
17 988
282 364
...

correct output
714

user output
0

Test 55

Verdict:

input
1000 1221
254 729
301 692
201 239
530 550
...

correct output
406

user output
0

Test 56

Verdict:

input
1000 1002
147 586
502 522
194 372
176 451
...

correct output
117

user output
0

Test 57

Verdict:

input
1000 1075
470 600
129 251
654 850
567 661
...

correct output
642

user output
0

Test 58

Verdict: ACCEPTED

input
1000 1874
668 731
316 335
532 731
523 839
...

correct output
0

user output
0

Test 59

Verdict:

input
1000 1009
674 739
96 435
360 670
130 773
...

correct output
768

user output
0

Test 60

Verdict:

input
100000 100007
44087 69715
31775 43251
18923 35874
36912 75163
...

correct output
923

user output
0

Test 61

Verdict:

input
100000 100007
19253 34700
66338 83144
22343 27898
4199 35494
...

correct output
9842

user output
0

Test 62

Verdict: ACCEPTED

input
100000 143600
14018 46297
31183 86763
34508 87502
54400 64922
...

correct output
0

user output
0

Test 63

Verdict: ACCEPTED

input
100000 155080
7038 29509
13361 87647
1940 92912
7785 12866
...

correct output
0

user output
0

Test 64

Verdict:

input
100000 100005
33360 89287
42922 67061
77709 78585
48488 51346
...

correct output
523

user output
0

Test 65

Verdict:

input
100000 122199
24155 82039
27201 64021
37961 66619
7615 11277
...

correct output
61740

user output
0

Test 66

Verdict:

input
100000 100002
13135 96454
53655 77933
52027 71763
40622 57175
...

correct output
60082

user output
0

Test 67

Verdict:

input
100000 107630
30498 57903
5372 70239
51740 59293
41709 92770
...

correct output
102920

user output
0

Test 68

Verdict:

input
100000 187345
5859 71722
58010 74508
66929 91927
15925 53657
...

correct output
129660

user output
0

Test 69

Verdict:

input
100000 101036
13541 29328
50426 75396
46089 77950
42830 56873
...

correct output
80466

user output
0