Submission

----------

Score: 0

User: Winzzwz

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

Language: cpp

Time: 0.033 second

Submitted On: 2025-03-05 14:53:07

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

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

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); cnt[a]+=cnt[i]+1;}
        }
    }
    for (int i = 1; i <= n; i++) {
        int cntt = cnt[i];
        for (int j = 0; j < v[i].size(); j++) {
            cntt += cnt[v[i][j]];
        }
        mx = max(cntt,mx);
    }
    cout << mx;
    
    return 0;
}