Factory

#include <bits/stdc++.h>

using namespace std;
vector<int> v[505];
int c[505];
int main(){
    
    int n, m; cin >> n >> m;
    for(int i = 0; i < m; ++i){
        int a, b; cin >> a >> b;
        v[a].push_back(b);
        c[b]++;
    }
    priority_queue<pair<int, int>> q;
    for(int i = 1; i <= n; ++i){
        if(c[i] == 0)
            q.push({v[i].size(), i});
    }
    int days = 0;
    while(!q.empty()){
        pair<int, int> a = q.top();
        q.pop();
        if(q.size() > 0){
            pair<int, int> b = q.top();
            q.pop();
            for(auto f: v[b.second]){
            c[f]--;
            if(c[f] == 0)
                q.push({v[f].size(), f});
        }
        }
        for(auto f: v[a.second]){
            c[f]--;
            if(c[f] == 0)
                q.push({v[f].size(), f});
        }
        days++;
        
    }
    cout << days << endl;
    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: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: ACCEPTED

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER