Microservice hell

input/code.cpp: In function 'void dfs(long long int)':
input/code.cpp:35:9: warning: unused variable 'sum' [-Wunused-variable]
   35 |     int sum = 0;
      |         ^~~
input/code.cpp: In function 'long long int solve()':
input/code.cpp:58:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 0; i < ans.size(); i++){
      |                     ~~^~~~~~~~~~~~

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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int n;
vector<vector<int>> adj;
vector<bool> visited, recStack;
vector<int> ans;
bool isCyclic = false; 

vector<int> sol;

bool dfs_cycle(int v) {
    visited[v] = true;
    recStack[v] = true;

    for (int u : adj[v]) {
        if (!visited[u]) {
            if (dfs_cycle(u)) return true;
        } else if (recStack[u]) {
            return true; 
        }
    }

    recStack[v] = false; 
    return false;
}

void dfs(int v) {
    visited[v] = true;
    int sum = 0;
    for (int u : adj[v]) {
        if (!visited[u])
            dfs(u);
    }
    ans.push_back(v);
}

void topological_sort() {
    visited.assign(n, false);
    for (int i = 0; i < n; ++i) {
        if (!visited[i]) {
            dfs(i);
        }
    }
    //reverse(ans.begin(), ans.end());
}


int solve(){
    int u = ans[ans.size()-1];
    vector<pair<int,int>> dp(n,{0,0}); // ,no. paths
    
    for (int i = 0; i < ans.size(); i++){
        for (int v : adj[ans[i]]){
            int a,b;
            a = dp[v].first;
            b = dp[v].second;
            dp[ans[i]].second += (b < 1)? 1 : b;
            dp[ans[i]].first += a+b;
        }
    }
    
    for (auto& a : dp){
        a.first += a.second;
    }
    
    return dp[u].first;
}

signed main() {
    int m, X;
    cin >> n >> m >> X;
    adj.resize(n);

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a-1].push_back(b-1);
    }
   
    visited.assign(n, false);
    recStack.assign(n, false);
    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            if (dfs_cycle(i)) {
                isCyclic = true;
                break;
            }
        }
    }

    if (isCyclic) {
        cout << "No" << endl;
        return 1;
    } else {
        topological_sort();
    }
    
    int temp = solve();
    
    if (temp > X){
        cout << "No";
    } else {
        cout << "Yes";
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: RUNTIME ERROR

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: RUNTIME ERROR

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: RUNTIME ERROR

Test 24

Verdict: RUNTIME ERROR

Test 25

Verdict: ACCEPTED

Test 26

Verdict: RUNTIME ERROR

Test 27

Verdict: ACCEPTED

Test 28

Verdict: RUNTIME ERROR

Test 29

Verdict: RUNTIME ERROR

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: RUNTIME ERROR

Test 34

Verdict: RUNTIME ERROR

Test 35

Verdict: ACCEPTED

Test 36

Verdict: RUNTIME ERROR

Test 37

Verdict: ACCEPTED

Test 38

Verdict: RUNTIME ERROR

Test 39

Verdict: RUNTIME ERROR

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: RUNTIME ERROR

Test 44

Verdict: RUNTIME ERROR

Test 45

Verdict: ACCEPTED

Test 46

Verdict: RUNTIME ERROR

Test 47

Verdict: ACCEPTED

Test 48

Verdict: RUNTIME ERROR

Test 49

Verdict: RUNTIME ERROR

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: RUNTIME ERROR

Test 54

Verdict: RUNTIME ERROR

Test 55

Verdict: ACCEPTED

Test 56

Verdict: RUNTIME ERROR

Test 57

Verdict: ACCEPTED

Test 58

Verdict: RUNTIME ERROR

Test 59

Verdict: RUNTIME ERROR

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: RUNTIME ERROR

Test 64

Verdict: RUNTIME ERROR

Test 65

Verdict: ACCEPTED

Test 66

Verdict: RUNTIME ERROR

Test 67

Verdict: ACCEPTED

Test 68

Verdict: RUNTIME ERROR

Test 69

Verdict: RUNTIME ERROR

Test 70

Verdict: ACCEPTED