CSES - Aalto Competitive Programming 2024 - wk7 - Mon - Results
Submission details
Task:Snakeless path
Sender:odanobunaga8199
Submission time:2024-10-21 17:33:47 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#100.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.01 sdetails
#430.00 sdetails
#44ACCEPTED0.01 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.01 sdetails
#49ACCEPTED0.00 sdetails
#500.00 sdetails
#510.00 sdetails
#520.00 sdetails
#530.00 sdetails
#54ACCEPTED0.05 sdetails
#55ACCEPTED0.00 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.00 sdetails
#58ACCEPTED0.05 sdetails
#59ACCEPTED0.00 sdetails
#60ACCEPTED0.05 sdetails
#61ACCEPTED0.00 sdetails
#62ACCEPTED0.00 sdetails
#63ACCEPTED0.04 sdetails
#640.00 sdetails
#65ACCEPTED0.02 sdetails
#66ACCEPTED0.00 sdetails
#67ACCEPTED0.00 sdetails
#68ACCEPTED0.06 sdetails
#69ACCEPTED0.00 sdetails
#700.05 sdetails
#710.05 sdetails
#720.05 sdetails
#730.06 sdetails
#74ACCEPTED0.06 sdetails
#75ACCEPTED0.05 sdetails
#76ACCEPTED0.06 sdetails
#77ACCEPTED0.03 sdetails
#78ACCEPTED0.00 sdetails
#79ACCEPTED0.03 sdetails
#80ACCEPTED0.02 sdetails
#81ACCEPTED0.03 sdetails
#82ACCEPTED0.03 sdetails
#83ACCEPTED0.04 sdetails
#840.05 sdetails
#85ACCEPTED0.05 sdetails
#86ACCEPTED0.05 sdetails
#87ACCEPTED0.05 sdetails
#88ACCEPTED0.01 sdetails
#89ACCEPTED0.03 sdetails

Code

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    
    if(n < 2){
        cout << "0";
        return 0;
    }
    
    vector<int> forbidden1;
    vector<int> forbiddenn;
    
    for(int i=0; i<m; i++){
        int a, b;
        cin >> a >> b;
        if(a == 1){
            forbidden1.push_back(b);
        }
        if(b == 1){
            forbidden1.push_back(a);
        }
        if(a == n){
            forbiddenn.push_back(b);
        }
        if(b == n){
            forbiddenn.push_back(a);
        }
    }
    
    sort(forbidden1.begin(), forbidden1.end());
    sort(forbiddenn.begin(), forbiddenn.end());
    
    bool found = false;
    int intermediate = -1;
    for(int k=2; k<=n-1; k++){
        bool forbidden_with_1 = binary_search(forbidden1.begin(), forbidden1.end(), k);
        if(forbidden_with_1){
            continue;
        }
        bool forbidden_with_n = binary_search(forbiddenn.begin(), forbiddenn.end(), k);
        if(forbidden_with_n){
            continue;
        }
        intermediate = k;
        found = true;
        break;
    }
    
    if(found){
        cout << "3\n1 " << intermediate << " " << n;
    }
    else{
        bool direct_forbidden = binary_search(forbidden1.begin(), forbidden1.end(), n);
        if(!direct_forbidden){
            cout << "2\n1 " << n;
            return 0;
        }

        cout << "0";
    }
}

Test details

Test 1

Verdict: ACCEPTED

input
2 1
1 2

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
3 1
1 3

correct output
3
1 2 3 

user output
3
1 2 3

Test 3

Verdict: ACCEPTED

input
3 1
1 3

correct output
3
1 2 3 

user output
3
1 2 3

Test 4

Verdict: ACCEPTED

input
3 1
1 3

correct output
3
1 2 3 

user output
3
1 2 3

Test 5

Verdict: ACCEPTED

input
4 1
1 4

correct output
3
1 3 4 

user output
3
1 2 4

Test 6

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 7

Verdict: ACCEPTED

input
4 3
1 2
1 3
1 4

correct output
0

user output
0

Test 8

Verdict: ACCEPTED

input
4 2
1 3
2 3

correct output
2
1 4 

user output
3
1 2 4

Test 9

Verdict: ACCEPTED

input
4 4
1 2
1 4
2 3
3 4

correct output
0

user output
0

Test 10

Verdict:

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

correct output
5
1 3 2 4 5 

user output
0

Test 11

Verdict: ACCEPTED

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

correct output
3
1 4 5 

user output
3
1 4 5

Test 12

Verdict: ACCEPTED

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

correct output
3
1 2 5 

user output
3
1 2 5

Test 13

Verdict:

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

correct output
5
1 2 3 4 5 

user output
0

Test 14

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 15

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 16

Verdict: ACCEPTED

input
5 1
1 5

correct output
3
1 4 5 

user output
3
1 2 5

Test 17

Verdict: ACCEPTED

input
5 4
1 2
1 3
1 4
1 5

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 19

Verdict: ACCEPTED

input
5 4
1 2
1 3
1 4
1 5

correct output
0

user output
0

Test 20

Verdict:

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

correct output
6
1 6 9 8 7 10 

user output
0

Test 21

Verdict:

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

correct output
5
1 9 8 7 10 

user output
0

Test 22

Verdict:

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

correct output
10
1 3 9 8 7 6 5 4 2 10 

user output
0

Test 23

Verdict:

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

correct output
6
1 2 9 8 7 10 

user output
0

Test 24

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 25

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 26

Verdict: ACCEPTED

input
10 1
1 10

correct output
3
1 9 10 

user output
3
1 2 10

Test 27

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 28

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 29

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 30

Verdict:

input
100 196
1 2
1 3
1 4
1 5
...

correct output
31
1 60 99 98 97 96 95 94 93 92 9...

user output
0

Test 31

Verdict:

input
100 196
1 2
1 3
1 4
1 5
...

correct output
30
1 99 98 97 96 95 94 93 92 91 9...

user output
0

Test 32

Verdict:

input
100 196
1 2
1 3
1 4
1 5
...

correct output
98
1 20 99 98 97 96 95 94 93 92 9...

user output
0

Test 33

Verdict:

input
100 196
1 2
1 3
1 4
1 5
...

correct output
32
1 8 99 98 97 96 95 94 93 92 91...

user output
0

Test 34

Verdict: ACCEPTED

input
100 4910
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 35

Verdict: ACCEPTED

input
100 197
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 36

Verdict: ACCEPTED

input
100 248
1 8
1 29
1 53
1 61
...

correct output
3
1 99 100 

user output
3
1 2 100

Test 37

Verdict: ACCEPTED

input
100 99
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 38

Verdict: ACCEPTED

input
100 4888
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 39

Verdict: ACCEPTED

input
100 99
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 40

Verdict:

input
200 396
1 2
1 3
1 4
1 5
...

correct output
60
1 119 199 198 197 196 195 194 ...

user output
0

Test 41

Verdict:

input
200 396
1 2
1 3
1 4
1 5
...

correct output
58
1 199 198 197 196 195 194 193 ...

user output
0

Test 42

Verdict:

input
200 396
1 2
1 3
1 4
1 5
...

correct output
195
1 38 199 198 197 196 195 194 1...

user output
0

Test 43

Verdict:

input
200 396
1 2
1 3
1 4
1 5
...

correct output
61
1 16 199 198 197 196 195 194 1...

user output
0

Test 44

Verdict: ACCEPTED

input
200 19807
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 45

Verdict: ACCEPTED

input
200 397
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 46

Verdict: ACCEPTED

input
200 994
1 8
1 29
1 53
1 61
...

correct output
3
1 199 200 

user output
3
1 2 200

Test 47

Verdict: ACCEPTED

input
200 199
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 48

Verdict: ACCEPTED

input
200 19792
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 49

Verdict: ACCEPTED

input
200 199
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 50

Verdict:

input
1000 1996
1 2
1 3
1 4
1 5
...

correct output
288
1 593 999 998 997 996 995 994 ...

user output
0

Test 51

Verdict:

input
1000 1996
1 2
1 3
1 4
1 5
...

correct output
282
1 997 999 998 996 995 994 993 ...

user output
0

Test 52

Verdict:

input
1000 1996
1 2
1 3
1 4
1 5
...

correct output
975
1 186 999 998 997 996 995 994 ...

user output
0

Test 53

Verdict:

input
1000 1996
1 2
1 3
1 4
1 5
...

correct output
295
1 72 999 998 997 996 995 994 9...

user output
0

Test 54

Verdict: ACCEPTED

input
1000 299999
1 2
1 3
1 4
1 5
...

correct output
3
1 691 1000 

user output
3
1 691 1000

Test 55

Verdict: ACCEPTED

input
1000 1997
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 56

Verdict: ACCEPTED

input
1000 25751
1 8
1 29
1 53
1 61
...

correct output
4
1 999 998 1000 

user output
3
1 2 1000

Test 57

Verdict: ACCEPTED

input
1000 999
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 58

Verdict: ACCEPTED

input
1000 299999
1 2
1 3
1 4
1 5
...

correct output
3
1 832 1000 

user output
3
1 832 1000

Test 59

Verdict: ACCEPTED

input
1000 999
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 60

Verdict: ACCEPTED

input
1000 299999
1 2
1 3
1 4
1 5
...

correct output
3
1 999 1000 

user output
3
1 10 1000

Test 61

Verdict: ACCEPTED

input
1000 999
1 1000
2 1000
3 1000
4 1000
...

correct output
0

user output
0

Test 62

Verdict: ACCEPTED

input
1000 999
1 1000
2 1000
3 1000
4 1000
...

correct output
0

user output
0

Test 63

Verdict: ACCEPTED

input
1000 195765
1 2
1 3
1 4
1 5
...

correct output
4
1 999 997 1000 

user output
3
1 6 1000

Test 64

Verdict:

input
1000 1996
1 2
1 3
1 4
1 5
...

correct output
229
1 922 999 998 997 996 995 994 ...

user output
0

Test 65

Verdict: ACCEPTED

input
1000 92979
1 6
1 8
1 12
1 18
...

correct output
2
1 1000 

user output
3
1 2 1000

Test 66

Verdict: ACCEPTED

input
1000 1997
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 67

Verdict: ACCEPTED

input
1000 1997
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 68

Verdict: ACCEPTED

input
1000 299999
1 2
1 3
1 4
1 5
...

correct output
3
1 885 1000 

user output
3
1 885 1000

Test 69

Verdict: ACCEPTED

input
1000 999
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 70

Verdict:

input
100000 199996
1 2
1 3
1 4
1 5
...

correct output
28483
1 59286 99999 99998 99997 9999...

user output
0

Test 71

Verdict:

input
100000 199996
1 2
1 3
1 4
1 5
...

correct output
27969
1 99719 99999 99998 99997 9999...

user output
0

Test 72

Verdict:

input
100000 199996
1 2
1 3
1 4
1 5
...

correct output
97408
1 18510 99999 99998 99997 9999...

user output
0

Test 73

Verdict:

input
100000 199996
1 2
1 3
1 4
1 5
...

correct output
29187
1 7074 99999 99998 99997 99996...

user output
0

Test 74

Verdict: ACCEPTED

input
100000 270197
1 861
1 12080
1 39541
1 39686
...

correct output
3
1 99999 100000 

user output
3
1 2 100000

Test 75

Verdict: ACCEPTED

input
100000 199997
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 76

Verdict: ACCEPTED

input
100000 284253
1 23553
1 48406
1 56616
1 56899
...

correct output
2
1 100000 

user output
3
1 2 100000

Test 77

Verdict: ACCEPTED

input
100000 99999
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 78

Verdict: ACCEPTED

input
100000 3335
1 100000
11 26761
12 80933
41 44903
...

correct output
3
1 99999 100000 

user output
3
1 2 100000

Test 79

Verdict: ACCEPTED

input
100000 99999
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 80

Verdict: ACCEPTED

input
100000 89632
1 76350
1 97733
1 100000
2 16314
...

correct output
3
1 99999 100000 

user output
3
1 2 100000

Test 81

Verdict: ACCEPTED

input
100000 99999
1 100000
2 100000
3 100000
4 100000
...

correct output
0

user output
0

Test 82

Verdict: ACCEPTED

input
100000 99999
1 100000
2 100000
3 100000
4 100000
...

correct output
0

user output
0

Test 83

Verdict: ACCEPTED

input
100000 182210
1 17827
1 55463
1 98875
1 100000
...

correct output
3
1 99999 100000 

user output
3
1 2 100000

Test 84

Verdict:

input
100000 199996
1 2
1 3
1 4
1 5
...

correct output
22685
1 92190 99999 99998 99997 9999...

user output
0

Test 85

Verdict: ACCEPTED

input
100000 244084
1 33037
1 48376
1 94522
1 100000
...

correct output
3
1 99999 100000 

user output
3
1 2 100000

Test 86

Verdict: ACCEPTED

input
100000 199997
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 87

Verdict: ACCEPTED

input
100000 199997
1 2
1 3
1 4
1 5
...

correct output
0

user output
0

Test 88

Verdict: ACCEPTED

input
100000 22805
1 100000
2 29973
7 38479
7 77260
...

correct output
3
1 99999 100000 

user output
3
1 2 100000

Test 89

Verdict: ACCEPTED

input
100000 99999
1 2
1 3
1 4
1 5
...

correct output
0

user output
0