Longest route

#include <bits/stdc++.h>

using namespace std;

bool topological_sort_rec(int n, vector<vector<int>> &adj, int *state, vector<int> &out, int x) {

    state[x] = 1;

    for (int p : adj[x]) {
        if (state[p] == 1)
            return false;
        else if (state[p] == 0) {
            bool r = topological_sort_rec(n, adj, state, out, p);
            if (!r) return false;
        }
    }

    state[x] = 2;
    out.push_back(x);   
        
    return true;

}

bool topological_sort(int n, vector<vector<int>> &adj, vector<int> &out) {

    int *state = new int[n];
    for (int i = 0; i < n; i++)
        state[i] = 0;
    
    for (int i = 0; i < n; i++) {
        if (state[i] == 0) {
            // not yet visited
            bool r = topological_sort_rec(n, adj, state, out, i);
            if (!r) return false;
        }
    }

    reverse(out.begin(), out.end());
    return true;

}

int main() {

    int n, m;
    cin >> n >> m;

    vector<vector<int>> adj(n);

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        adj[a].push_back(b);
    }

    vector<int> out;
    topological_sort(n, adj, out);

    cout << out.size() << endl;
    for (int c : out) {
        cout << c+1 << " ";
    }

    cout << endl;


}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: ACCEPTED

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: ACCEPTED

Test 21

Verdict: WRONG ANSWER