Microservice hell

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

// Debug printing
#ifdef DEBUG
#define deb(fmt, args...) printf("DEBUG: %d: " fmt, __LINE__, ##args)
#else
#define deb(fmt, args...)
#endif


// int search2(
//     int initial,
//     int start_node,
//     vector<vector<int>> &edges,
//     vector<bool> &visited,
//     vector<ll> &num_calls,
//     int depth
// ) {
//     // this is to detect a loop
//     if (impossible) return 0;
//     if (initial == start_node) {
//         impossible = true;
//         return depth;
//     } else if (num_calls[start_node] != 0) {
//         return num_calls[start_node];
//     } else {
//         visited[start_node] = true;
//         // deb("%d\n", start_node);
//         // ll res = 0;
//         for (int i = 0; i < edges[start_node].size(); i++) {
//             num_calls[start_node] += search(initial, edges[start_node][i], edges, visited, num_calls, depth + 1);
//         }
//         if (num_calls[start_node] == 0) num_calls[start_node] = 1;
//         // num_paths[start_node] = res;
//         deb("%d, %d, %lu\n", initial, start_node, num_calls[start_node]);
//         return num_calls[start_node];
//     }
// }

bool impossible = false;
ll search(int node, vector<vector<int>> &edges, vector<pair<ll, int>> &num_paths)
{
    if (impossible) {
        return 0;
    }
    if (num_paths[node].second == 1) {
        // deb("loop");
        impossible = true;
        return 0;
    }
    if (num_paths[node].first > 1) {
        return num_paths[node].first;
    }
    num_paths[node].second = 1;
    for (auto u : edges[node]) {
        num_paths[node].first += search(u, edges, num_paths);
    }
    // if (edges[node].size() == 0) {
    //     num_paths[node].first = 1;
    // }
    num_paths[node].second = 2;
    // deb("%d, num_paths: %llu\n", node, num_paths[node].first);
    return num_paths[node].first;
}

int main(int argc, char *argv[])
{
	// Read the input parameters
	int n, m;
    ll k;
	cin >> n >> m >> k;

	vector<vector<int>> edges(n + 1);
    int tmp, tmp2;
	for (int i = 0; i < m; i++) {
        cin >> tmp >> tmp2;
		edges[tmp].push_back(tmp2);
	}

    // for (int i = 0; i < n; i++) {
    //     for (auto u : edges[i + 1]) {
    //         deb("%d %d\n", i+1, u);
    //     }
    // }

    vector<bool> visited(n + 1, false);
    vector<ll> num_calls(n + 1, 0);
    // search(tmp, 1, edges, visited, num_paths, 1);
    ll max = 0;
    vector<pair<ll, int>> num_paths(n + 1, {1, 0});
    for (int i = 0; i < n; i++) {
        ll res = search(i + 1, edges, num_paths);
        // for (auto u : edges[i + 1]) {
            // res += search(i + 1, u, edges, visited, num_calls, 1);
            //
        // }
        if (max < res) max = res;
    }

    if (max < k && !impossible) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

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: ACCEPTED