CSES - Aalto Competitive Programming 2024 - wk7 - Mon - Results
Submission details
Task:Snakeless path
Sender:Nallue
Submission time:2024-10-21 17:14:37 +0300
Language:C++ (C++11)
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
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.01 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.01 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.01 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.01 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.01 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.01 sdetails
#53ACCEPTED0.01 sdetails
#54ACCEPTED0.15 sdetails
#55ACCEPTED0.01 sdetails
#56ACCEPTED0.02 sdetails
#57ACCEPTED0.00 sdetails
#58ACCEPTED0.14 sdetails
#59ACCEPTED0.00 sdetails
#60ACCEPTED0.15 sdetails
#61ACCEPTED0.01 sdetails
#62ACCEPTED0.01 sdetails
#63ACCEPTED0.10 sdetails
#64ACCEPTED0.01 sdetails
#65ACCEPTED0.05 sdetails
#66ACCEPTED0.01 sdetails
#67ACCEPTED0.01 sdetails
#68ACCEPTED0.14 sdetails
#69ACCEPTED0.00 sdetails
#700.39 sdetails
#710.39 sdetails
#720.39 sdetails
#730.39 sdetails
#740.39 sdetails
#750.39 sdetails
#760.39 sdetails
#770.39 sdetails
#780.41 sdetails
#790.40 sdetails
#800.39 sdetails
#810.39 sdetails
#820.39 sdetails
#830.40 sdetails
#840.39 sdetails
#850.39 sdetails
#860.39 sdetails
#870.39 sdetails
#880.40 sdetails
#890.39 sdetails

Code

#include <iostream>
#include <vector>
#include <queue>
#include <stack>
 
using namespace std;
 
void BFS(const vector<vector<bool>>& map, vector<int>& distances){
    queue<int> q;
    q.push(0);
    distances[0] = 0;
 
    while(not q.empty()){
        int x = q.front();
        q.pop();
        //cout<<q.size()<<endl;
 
        for(unsigned long i=0;i<map[x].size(); i++){
            if(!map[x][i])continue;
 
            if(distances[i]<0){
                distances[i]=distances[x]+1;
                q.push(i);
            }
        }
    }
}
 
void Gpath(const vector<vector<bool>>& map, const vector<int>& distances, int ini, stack<int>& path){
 
    int x=ini;
    path.push(x);
 
    while (distances[x]!=0){
 
        for(unsigned long i=0;i<map[x].size(); i++){
            //cout << "."<<endl;
            if(!map[x][i])continue;
 
            if(distances[i]!=-1 and distances[i]<distances[x]){
                path.push(i);
                x=i;
                break;
            }
        }
    }
}
 
 
int main(){
    int n,m;
    cin >> n >> m;
    vector<vector<bool>> adj(n,vector<bool>(n,true));
 
    for(int i=0;i<n;i++)adj[i][i]=false;
 
    for(int i=0;i<m;i++){
        int a,b;
        cin >> a >> b;
        adj[a-1][b-1]=false;
        adj[b-1][a-1]=false;
    }
 
    vector<int> distances(n,-1);
 
    BFS(adj, distances);
 
    //cout << "hola" << endl;
 
    if(distances[n-1]==-1){
        cout<<0<<endl;
        return 0;
    }
 
    stack<int> path;
 
    Gpath(adj,distances,n-1,path);
 
    //cout << "adeu" << endl;
 
    cout<<path.size()<<endl;
    while(not path.empty()){
        cout<<path.top()+1;
        if(path.top()!=n-1)cout<<" ";
        path.pop();
    }
    cout <<endl;
 
 
}

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
2
1 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: ACCEPTED

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

correct output
5
1 3 2 4 5 

user output
5
1 3 2 4 5

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: ACCEPTED

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

correct output
5
1 2 3 4 5 

user output
5
1 2 3 4 5

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: ACCEPTED

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

correct output
6
1 6 9 8 7 10 

user output
5
1 6 2 7 10

Test 21

Verdict: ACCEPTED

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

correct output
5
1 9 8 7 10 

user output
5
1 9 2 7 10

Test 22

Verdict: ACCEPTED

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
5
1 3 4 2 10

Test 23

Verdict: ACCEPTED

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

correct output
6
1 2 9 8 7 10 

user output
5
1 2 3 7 10

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: ACCEPTED

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
5
1 60 2 72 100

Test 31

Verdict: ACCEPTED

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
5
1 99 2 72 100

Test 32

Verdict: ACCEPTED

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
5
1 20 2 4 100

Test 33

Verdict: ACCEPTED

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
5
1 8 2 71 100

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: ACCEPTED

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

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

user output
5
1 119 2 143 200

Test 41

Verdict: ACCEPTED

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

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

user output
5
1 199 2 144 200

Test 42

Verdict: ACCEPTED

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
5
1 38 2 7 200

Test 43

Verdict: ACCEPTED

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
5
1 16 2 142 200

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: ACCEPTED

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

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

user output
5
1 593 2 715 1000

Test 51

Verdict: ACCEPTED

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

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

user output
5
1 997 2 720 1000

Test 52

Verdict: ACCEPTED

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

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

user output
5
1 186 2 27 1000

Test 53

Verdict: ACCEPTED

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
5
1 72 2 708 1000

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: ACCEPTED

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

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

user output
5
1 922 2 773 1000

Test 65

Verdict: ACCEPTED

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

correct output
2
1 1000 

user output
2
1 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
(empty)

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
(empty)

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
(empty)

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
(empty)

Test 74

Verdict:

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

correct output
3
1 99999 100000 

user output
(empty)

Test 75

Verdict:

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

correct output
0

user output
(empty)

Test 76

Verdict:

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

correct output
2
1 100000 

user output
(empty)

Test 77

Verdict:

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

correct output
0

user output
(empty)

Test 78

Verdict:

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

correct output
3
1 99999 100000 

user output
(empty)

Test 79

Verdict:

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

correct output
0

user output
(empty)

Test 80

Verdict:

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

correct output
3
1 99999 100000 

user output
(empty)

Test 81

Verdict:

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

correct output
0

user output
(empty)

Test 82

Verdict:

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

correct output
0

user output
(empty)

Test 83

Verdict:

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

correct output
3
1 99999 100000 

user output
(empty)

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
(empty)

Test 85

Verdict:

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

correct output
3
1 99999 100000 

user output
(empty)

Test 86

Verdict:

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

correct output
0

user output
(empty)

Test 87

Verdict:

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

correct output
0

user output
(empty)

Test 88

Verdict:

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

correct output
3
1 99999 100000 

user output
(empty)

Test 89

Verdict:

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

correct output
0

user output
(empty)