Snakeless path

input/code.cpp: In function 'int main()':
input/code.cpp:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int i=0;i<path.size();i++){
      |                     ~^~~~~~~~~~~~
input/code.cpp:90:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             cout << path[i] << (i < path.size()-1 ? ' ' : '\n');
      |                                 ~~^~~~~~~~~~~~~~~

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m;
    cin >> n >> m;
    
    // Using vector of unordered_sets for blocked edges
    // To save memory and time, use sorted vectors and binary search
    vector<vector<int>> blocked(n+1, vector<int>());
    
    for(int i=0;i<m;i++){
        int a, b;
        cin >> a >> b;
        blocked[a].push_back(b);
        blocked[b].push_back(a);
    }
    
    // Sort the blocked lists for binary search
    for(int i=1;i<=n;i++) {
        sort(blocked[i].begin(), blocked[i].end());
    }
    
    // BFS variables
    vector<int> parent(n+1, -1);
    queue<int> q;
    vector<bool> visited(n+1, false);
    
    // Start BFS from node 1
    q.push(1);
    visited[1] = true;
    parent[1] = 0;
    
    while(!q.empty()){
        int current = q.front();
        q.pop();
        
        // If reached n, stop
        if(current == n){
            break;
        }
        
        // Iterate through all possible neighbors
        // Since the graph is complete minus blocked edges,
        // neighbors are all nodes from 1 to n except blocked and current
        // To optimize, iterate through all nodes and skip blocked ones
        
        // However, for large n, this is too slow.
        // Alternative approach: iterate through all nodes not blocked and not visited
        
        // To optimize, iterate through all nodes and check if they are not blocked and not visited
        // Given the constraints, it's still manageable in C++
        
        for(int neighbor=1; neighbor<=n; neighbor++){
            if(neighbor == current || visited[neighbor]){
                continue;
            }
            // Check if neighbor is blocked
            // Binary search in blocked[current]
            if(!binary_search(blocked[current].begin(), blocked[current].end(), neighbor)){
                visited[neighbor] = true;
                parent[neighbor] = current;
                q.push(neighbor);
                // Early exit if reached n
                if(neighbor == n){
                    break;
                }
            }
        }
    }
    
    if(!visited[n]){
        cout << "0\n";
    }
    else{
        // Reconstruct the path
        vector<int> path;
        int node = n;
        while(node != 0){
            path.push_back(node);
            node = parent[node];
        }
        reverse(path.begin(), path.end());
        // Output
        cout << path.size() << "\n";
        for(int i=0;i<path.size();i++){
            cout << path[i] << (i < path.size()-1 ? ' ' : '\n');
        }
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: TIME LIMIT EXCEEDED

Test 71

Verdict: TIME LIMIT EXCEEDED

Test 72

Verdict: TIME LIMIT EXCEEDED

Test 73

Verdict: TIME LIMIT EXCEEDED

Test 74

Verdict: TIME LIMIT EXCEEDED

Test 75

Verdict: ACCEPTED

Test 76

Verdict: TIME LIMIT EXCEEDED

Test 77

Verdict: ACCEPTED

Test 78

Verdict: TIME LIMIT EXCEEDED

Test 79

Verdict: ACCEPTED

Test 80

Verdict: TIME LIMIT EXCEEDED

Test 81

Verdict: TIME LIMIT EXCEEDED

Test 82

Verdict: TIME LIMIT EXCEEDED

Test 83

Verdict: TIME LIMIT EXCEEDED

Test 84

Verdict: TIME LIMIT EXCEEDED

Test 85

Verdict: TIME LIMIT EXCEEDED

Test 86

Verdict: ACCEPTED

Test 87

Verdict: ACCEPTED

Test 88

Verdict: TIME LIMIT EXCEEDED

Test 89

Verdict: ACCEPTED