oj.uz

Submission #824270

# Submission time Handle Problem Language Result Execution time Memory
824270 2023-08-13T22:39:35 Z AlphaMale06 Bosses (BOI16_bosses) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

const int N=5005;
vector<int> adj[N];

bool mark[N];
int ans=0;
int cnt=0;

int gentree(int node){
    mark[node]=true;
    cnt++;
    int sum=1;
    for(int to : adj[node]){
        if(!mark[to]){
            sum+=gentree(to);
        }
    }
    ans+=sum;
    return sum;
}

void clearmark(int n){
    for(int i=1; i<= n; i++){
        mark[i]=0;
    }
}
int main()
{
    int n;
    cin >> n;
    for(int i=0; i< n; i++){
        int k;
        cin >> k;
        for(int j=0; j< k; j++){
            int kita;
            cin >> kita;
            adj[kita].pb(i+1);
        }
    }
    int mn=1e9;
    for(int i=1; i<=n; i++){
        gentree(i);
        if(cnt==n)mn=min(mn, ans);
        clearmark(n+1);
        cnt=0;
        ans=0;
    }
    cout << mn << '\n';
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -