Submission

PPPPP-----

Score: 50

User: Winzzwz

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

Language: cpp

Time: 0.063 second

Submitted On: 2025-03-05 15:00:23

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

int n,l,a,b,mx,vis[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);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (vis[i]) continue;
        vis[i] = 1;
        queue <int> qu;
        int cnt = 0;
        qu.push(i);
        while (!qu.empty()) {
            int top = qu.front(); qu.pop();
            for (int j = 0; j < v[top].size(); j++) {
                if (vis[v[top][j]]) continue;
                vis[v[top][j]] = 1;
                cnt++;
                qu.push(v[top][j]);
            }
        }
        mx = max(mx,cnt);
    }
    cout << mx;
    
    return 0;
}