Submission

PPPPPPPPPP

Score: 100

User: Winzzwz

Problemset: เจ้งของกิจการ

Language: cpp

Time: 0.070 second

Submitted On: 2025-03-05 15:13:46

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n,l,a,b,mx,cnt[100100],vis[100100];
vector <int> v[100100];

int dfs(int i) {
    if (vis[i]) return cnt[i];
    vis[i] = 1;
    for (int j = 0; j < v[i].size(); j++) {
        cnt[i] += dfs(v[i][j])+1;
    }
    return cnt[i];
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> l;
        while (l--) {
            cin >> a >> b;
            if (b > 50) v[a].push_back(i);
        }
    }
    for (int i = 1; i <= n; i++) {
        //cout << "o : " << dfs(i) << "\n";
        mx = max(mx,dfs(i));
    }
    cout << mx;
    
    return 0;
}