Terrible security

input/code.cpp: In function 'bool topological_sort_dfs(int, std::vector<std::vector<int> >&, std::vector<short int>&, std::vector<int>&)':
input/code.cpp:102:14: warning: unused variable 'acylic' [-Wunused-variable]
  102 |         bool acylic = topological_sort_dfs(u, adj, status, result);
      |              ^~~~~~
input/code.cpp: In function 'bool topological_sort(std::vector<std::vector<int> >&, std::vector<int>&, int)':
input/code.cpp:125:18: warning: unused variable 'acyclic' [-Wunused-variable]
  125 |             bool acyclic = topological_sort_dfs(i, adj, status, result);
      |                  ^~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:150:10: warning: unused variable 'acylic' [-Wunused-variable]
  150 |     bool acylic = topological_sort(adj, result, 1);
      |          ^~~~~~

#include <bits/stdc++.h>

#define REP(i, a, b) for (int i = a; i < b; i++)

// Type Aliases for 1D and 2D vectors with initialization
#define vll(n, val) vector<long long>(n, val) // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) vector<vector<int>>(n, vector<int>(m, val))              // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val) vector<vector<long long>>(n, vector<long long>(m, val)) // 2D vector of long longs (n x m), initialized to val

using namespace std;

void print_vector(vector<int> &x)
{
    for (int v : x)
    {
        cout << v << " ";
    }
    cout << "\n";
}

void print_matrix(vector<vector<int>> &matrix)
{
    cout << "\n"
         << "----------------" << "\n";
    for (vector<int> row : matrix)
    {
        print_vector(row);
    }
    cout << "\n"
         << "----------------" << "\n";
}

int calc_max_digit(int n)
{
    int max_digit = 0;
    while (n > 0 && max_digit < 9)
    {
        int digit = n % 10;
        if (digit > max_digit)
        {
            max_digit = digit;
        }
        n /= 10;
    }
    return max_digit;
}

// edges as edge list for outgoing node as pairs (end, cost)
vector<ll> dijkstras(int start_point, vector<vector<pair<int, int>>> edges)
{
    int n = edges.size();
    vector<bool> processed(n, false);
    vector<ll> distances(n, LLONG_MAX);
    distances[start_point] = 0;
    priority_queue<pair<ll, int>> pq;
    pq.push({0, start_point});
    while (!pq.empty())
    {
        int curr = pq.top().second;
        pq.pop();
        if (processed[curr])
        {
            continue;
        }
        processed[curr] = true;
        ll distance = distances[curr];

        for (pair<int, int> edge : edges[curr])
        {

            if (distance + edge.second < distances[edge.first])
            {
                distances[edge.first] = distance + edge.second;
                pq.push({-distances[edge.first], edge.first});
            }
        }
    }
    return distances;
}

bool topological_sort_dfs(int s, vector<vector<int>> &adj, vector<short> &status, vector<int> &result)
{
    if (status[s] == 1)
    {
        // status[s] = 2;
        // result.push_back(s);
        return false;
    }
    else if (status[s] == 2)
    {
        return true;
    }
    status[s] = 1;
    // process node s
    for (auto u : adj[s])
    {
        if (u == s)
        {
            continue;
        }
        bool acylic = topological_sort_dfs(u, adj, status, result);
        // if (!acylic)
        // {
        //     return false;
        // }
    }
    status[s] = 2;
    result.push_back(s);
    // cout << "Finished " << s << "\n";
    return true;
}

bool topological_sort(vector<vector<int>> &adj, vector<int> &result, int start = 0)
{
    int n = adj.size();
    vector<short> status(n, 0);

    // cout << "Topological sort of size " << n << "\n";

    for (int i = start; i < n; i++)
    {
        if (status[i] == 0)
        {
            bool acyclic = topological_sort_dfs(i, adj, status, result);
        }
    }
    return true;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;

    vector<vector<int>> adj(n + 1, vector<int>());

    for (int i = 0; i < n; i++)
    {
        int end;
        cin >> end;
        adj[i + 1].push_back(end);
    }

    vector<int> result;

    bool acylic = topological_sort(adj, result, 1);

    print_vector(result);

    vector<int> opens(n + 1, 0);
    for (vector<int>::reverse_iterator riter = result.rbegin();
         riter != result.rend(); ++riter)
    {
        opens[*riter] = 1;
        // cout << "In loop with value" << *riter << "\n";
        if (adj[*riter][0] != *riter)
        {
            // cout << "Computing fleeing mates for key " << *riter << "\n";
            int succ = opens[adj[*riter][0]];
            if (succ == 0)
            {
                opens[*riter] += 1;
            }
            opens[*riter] += opens[adj[*riter][0]];
        }
    }

    for (int i = 0; i < q; i++)
    {
        int key;
        cin >> key;
        cout << opens[key] << " ";
    }
    cout << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: WRONG ANSWER

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: WRONG ANSWER

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: WRONG ANSWER

Test 63

Verdict: WRONG ANSWER

Test 64

Verdict: WRONG ANSWER

Test 65

Verdict: WRONG ANSWER

Test 66

Verdict: WRONG ANSWER

Test 67

Verdict: WRONG ANSWER

Test 68

Verdict: WRONG ANSWER

Test 69

Verdict: WRONG ANSWER

Test 70

Verdict: WRONG ANSWER

Test 71

Verdict: WRONG ANSWER

Test 72

Verdict: WRONG ANSWER

Test 73

Verdict: WRONG ANSWER

Test 74

Verdict: WRONG ANSWER