Microservice hell

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, m;
long long x;
vector<int> g[N];
int c[N];
long long f[N];
set<pair<int, int> > s;
int out[N];
vector<int> to[N];

void dfs(int u) {
  c[u] = 1;
  for (int v : g[u]) {
    if (c[v] == 1) {
      cout << "No" << '\n';
      exit(0);
    } else if (c[v] == 0) {
      dfs(v);
    }
  }
  c[u] = 2;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> x;
  for (int i = 1; i <= m; i++) {
    int a, b;
    cin >> a >> b;
    g[a].emplace_back(b);
    to[b].emplace_back(a);
    out[a]++;
  }
  for (int i = 1; i <= n; i++) {
    if (c[i] == 0) {
      dfs(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    s.insert(make_pair(out[i], i));
  }
  while (!s.empty()) {
    int u = s.begin()->second;
    s.erase(s.begin());
    f[u]++;
    for (int v : to[u]) {
      out[v]--;
      f[v] += f[u];
    }
    for (int v : to[u]) {
      s.erase(s.find(make_pair(out[v] + 1, v)));
      s.insert(make_pair(out[v], v));
    }
  }
  cout << (*max_element(f + 1, f + n + 1) > x ? "No" : "Yes") << '\n';
  /*
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += f[i];
    if (sum > x) {
      cout << "No" << '\n';
      return 0;
    }
  }
  cout << "Yes" << '\n';
  */
  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: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

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