Submission

PPPTTTTTTT

Score: 30

User: ShynyC

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

Language: cpp

Time: 1.095 second

Submitted On: 2025-04-15 16:14:21

#include <iostream>
#include <vector>
using namespace std;

int main(){
    int n,l,coma, percent,max = 0;
    cin >> n;
    vector<int> companies;
    vector<int> counts(n,0);
    for(int i = 0; i < n; i++){
        companies.push_back(i);
    }
    for(int i = 0; i < n; i++){
        cin >> l;
        for(int j = 0; j < l; j++){
            cin >> coma >> percent;
            if(percent > 50){
                companies[i] = coma-1;
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(j != companies[j]){
                companies[j] = companies[companies[j]];
            }
        }
    }

    for(int i = 0; i < n; i++){
        counts[companies[i]]++;
    }
    for(int i = 0; i < n; i++){
        if(counts[i] > max){
            max = counts[i];
        }
    }
    cout << max-1;
}