Longest route

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

typedef long long ll;

const ll N = 1000000;

vector<ll> adj[N];

ll value[N] = {0};

ll state[N] = {0};

bool dfs(ll s, ll parents[]) {
    if (state[s] == 2) return true;
    state[s] = 1;
    for (auto u: adj[s]) {
        if(!dfs(u, parents)) return false;
        if(value[u] < value[s]+1) {
            value[u] = value[s]+1;
            parents[u] = s;
        }
    }
    state[s] = 2;
    //cout << "We push state = " << s << endl;
    return true;
}

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

    ll a,b;
    for(ll i = 0; i<m; i++) {
        cin >> a >> b;
        adj[a].push_back(b);
    }
    ll parents[n+1] = {0};
    parents[1] = -1;
    for(ll s = 1; s <= n; s++) {
        if(state[s] != 2) {
            if(!dfs(s, parents)) {
                cout << "Cycle" << endl;
                return 0;
            }
        }
    }


    a = n;
    ll outputs[n];
    ll id = 0;
    while(a != 1) {
        if(a == 0){
            cout << "IMPOSSIBLE";
            return 0;
        }
        outputs[id] = a;
        a = parents[a];
        id++;
    }
    outputs[id] = 1;
    cout << id+1 << endl;
    for(ll i = id; i>=0; i--) {
        cout << outputs[i] << " ";
    }
    cout << endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED