Submission details
Task:Snakeless path
Sender:aalto26gm_043
Submission time:2026-10-19 17:21:55 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#20.01 sdetails
#30.01 sdetails
#40.01 sdetails
#50.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#80.01 sdetails
#9ACCEPTED0.01 sdetails
#100.01 sdetails
#110.01 sdetails
#120.01 sdetails
#130.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.01 sdetails
#160.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#200.01 sdetails
#210.01 sdetails
#220.01 sdetails
#230.01 sdetails
#24ACCEPTED0.01 sdetails
#25ACCEPTED0.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
#34ACCEPTED0.01 sdetails
#35ACCEPTED0.01 sdetails
#360.01 sdetails
#37ACCEPTED0.01 sdetails
#38ACCEPTED0.01 sdetails
#39ACCEPTED0.01 sdetails
#400.01 sdetails
#410.01 sdetails
#420.01 sdetails
#430.01 sdetails
#44ACCEPTED0.01 sdetails
#45ACCEPTED0.01 sdetails
#460.01 sdetails
#47ACCEPTED0.01 sdetails
#48ACCEPTED0.01 sdetails
#49ACCEPTED0.01 sdetails
#500.01 sdetails
#510.01 sdetails
#520.01 sdetails
#530.01 sdetails
#540.06 sdetails
#55ACCEPTED0.01 sdetails
#560.01 sdetails
#57ACCEPTED0.01 sdetails
#580.06 sdetails
#59ACCEPTED0.01 sdetails
#600.06 sdetails
#61ACCEPTED0.01 sdetails
#62ACCEPTED0.01 sdetails
#630.04 sdetails
#640.01 sdetails
#650.02 sdetails
#66ACCEPTED0.01 sdetails
#67ACCEPTED0.01 sdetails
#680.06 sdetails
#69ACCEPTED0.01 sdetails
#700.09 sdetails
#710.09 sdetails
#720.09 sdetails
#730.09 sdetails
#740.14 sdetails
#75ACCEPTED0.08 sdetails
#760.14 sdetails
#77ACCEPTED0.06 sdetails
#780.04 sdetails
#79ACCEPTED0.06 sdetails
#800.07 sdetails
#81ACCEPTED0.07 sdetails
#82ACCEPTED0.07 sdetails
#830.10 sdetails
#840.09 sdetails
#850.13 sdetails
#86ACCEPTED0.09 sdetails
#87ACCEPTED0.08 sdetails
#880.05 sdetails
#89ACCEPTED0.06 sdetails

Code

// #ifdef ONLINE_JUDGE
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #endif
#include "bits/stdc++.h"
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fill(arr,val) memset(arr,val,sizeof(arr))
#define FOR(i, a, b) for(__typeof(b) i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for(__typeof(a) i = a, _b = b; i >= _b; --i)
#define ALL(a) (a).begin(), (a).end()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ii pair<int,int>
#define iii pair<int,pair<int,int>>
#define dq deque<int>
#define nend '\n'
using namespace std;

const ll inf = 1e18;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,1,0,-1};
const int MOD = 1e9 + 7;
const ll hashi = 2e9 + 11;

void init_code() {
    fast;
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
}
const int N = 1e5 + 3;
int n, m, par[N];
bool snake[N];
vector<int> g[N];
void solve() {
    cin >> n >> m;
    FOR(i,1,m) {
        int a,b; cin >> a >> b;
        g[a].pb(b); g[b].pb(a);
    }

    set<int> unvis;
    FOR(i,2,n) unvis.insert(i);
    queue<int> q;
    q.push(1);
    par[1] = 0;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (auto v: g[u]) snake[v] = true;
        for (auto it = unvis.begin(); it != unvis.end(); ) {
            int v = *it; ///val of unvis set
            if (snake[v]) { ++it; continue; }
            par[v] = u;
            q.push(v);
            it = unvis.erase(it);
        }
        for (auto v: g[u]) snake[v] = false;
    }

    if (unvis.count(n)) {cout << 0; return;}
    vector<int> path;
    for (int v=n; v; v=par[v]) path.pb(v);
    reverse(ALL(path));
    cout << path.size() << nend;
    for (auto v:path) cout << v;
}

int main() {
    init_code();

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
2 1
1 2

correct output
0

user output
0

Test 2

Verdict:

input
3 1
1 3

correct output
3
1 2 3 

user output
3
123

Test 3

Verdict:

input
3 1
1 3

correct output
3
1 2 3 

user output
3
123

Test 4

Verdict:

input
3 1
1 3

correct output
3
1 2 3 

user output
3
123

Test 5

Verdict:

input
4 1
1 4

correct output
3
1 3 4 

user output
3
124

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:

input
4 2
1 3
2 3

correct output
2
1 4 

user output
2
14

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
5
13245

Test 11

Verdict:

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

correct output
3
1 4 5 

user output
3
145

Test 12

Verdict:

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

correct output
3
1 2 5 

user output
3
125

Test 13

Verdict:

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

correct output
5
1 2 3 4 5 

user output
5
12345

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:

input
5 1
1 5

correct output
3
1 4 5 

user output
3
125

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
5
162710

Test 21

Verdict:

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

correct output
5
1 9 8 7 10 

user output
5
192710

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
5
134210

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
5
123710

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:

input
10 1
1 10

correct output
3
1 9 10 

user output
3
1210

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
5
160272100

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
5
199272100

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
5
12024100

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
5
18271100

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:

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

correct output
3
1 99 100 

user output
3
12100

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
5
11192143200

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
5
11992144200

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
5
13827200

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
5
1162142200

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:

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

correct output
3
1 199 200 

user output
3
12200

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
5
159327151000

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
5
199727201000

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
5
11862271000

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
5
17227081000

Test 54

Verdict:

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

correct output
3
1 691 1000 

user output
3
16911000

Test 55

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 56

Verdict:

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

correct output
4
1 999 998 1000 

user output
3
121000

Test 57

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 58

Verdict:

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

correct output
3
1 832 1000 

user output
3
18321000

Test 59

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 60

Verdict:

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

correct output
3
1 999 1000 

user output
3
1101000

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:

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

correct output
4
1 999 997 1000 

user output
3
161000

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
5
192227731000

Test 65

Verdict:

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

correct output
2
1 1000 

user output
2
11000

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:

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

correct output
3
1 885 1000 

user output
3
18851000

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
5
159286271520100000

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
5
199719272033100000

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
5
11851022594100000

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
5
17074270816100000

Test 74

Verdict:

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

correct output
3
1 99999 100000 

user output
3
12100000

Test 75

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 76

Verdict:

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

correct output
2
1 100000 

user output
2
1100000

Test 77

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 78

Verdict:

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

correct output
3
1 99999 100000 

user output
3
12100000

Test 79

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 80

Verdict:

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

correct output
3
1 99999 100000 

user output
3
12100000

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:

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

correct output
3
1 99999 100000 

user output
3
12100000

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
5
192190277317100000

Test 85

Verdict:

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

correct output
3
1 99999 100000 

user output
3
12100000

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:

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

correct output
3
1 99999 100000 

user output
3
12100000

Test 89

Verdict: ACCEPTED

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

correct output
0

user output
0