oj.uz

Submission #975128

# Submission time Handle Problem Language Result Execution time Memory
975128 2024-05-04T13:24:34 Z momo50 Bosses (BOI16_bosses) C++17
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
int ans=INT_MAX,tmp=0,cnt=0;

bool vis[5007];
vector<int> g[5007];

int dfs(int u)
{
    vis[u]=true;
    cnt++;
    int sum=0;
    for(auto v:g[u])
    {
        if(vis[v])continue;
        sum+=dfs(v);
    }
    tmp+=sum+1;
    return sum+1;
}

int main()
{
    cin.tie(nullptr)->ios::sync_with_stdio(false);

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        while(k--)
        {
            int a;
            cin>>a;
            g[a].emplace_back(i);
        }
    }

    for(int i=1;i<=n;i++)
    {
        cnt=0,tmp=0;
        memset(vis,false,sizeof(vis));
        dfs(i);
        if(cnt!=n)continue;
        ans=min(ans,tmp);
    }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 22.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 33.0

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