Submission #10301888

---

Source Code Expand

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef __int128 lll;
constexpr ll mod = 1000000007;

int main() {
    int n,m,x,y,c[100001],p[100001];
    for(int i = 0;i < 100001;i++) {
        c[i] = 1;
        p[i] = 0;
    }
    p[1] = 1;
    cin >> n >> m;
    for(int i = 0;i < m;i++) {
        cin >> x >> y;
        if(p[x]) {
            p[y]++;
            if(c[x] == 1) p[x] = 0;
        }
        c[x]--;
        c[y]++;
    }
    int r = 0;
    for(auto e:p) if(e) r++;
    cout << r << endl;
}

Submission Info

Judge Result