oj.uz

Submission #936216

# Submission time Handle Problem Language Result Execution time Memory
936216 2024-03-01T12:21:19 Z adkjt Bosses (BOI16_bosses) C++14
0 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
#define ll long long
vector<int> g[5555];
int vis[5555];
queue<pii> qu;

int main()
{
    cin.tie()->sync_with_stdio(0);
    int n;cin>>n;
    for(int i=1;i<=n;i++)
    {
        int m;cin>>m;
        for(int j=1;j<=m;j++)
        {
            int k;cin>>k;
            g[k].push_back(i);
        }
    }
    ll ans=1e18;
    for(int i=1;i<=n;i++)
    {
        memset(vis,0,sizeof vis);
        qu.push({i,1});ll cnt=1;
        vis[i]=1;
        //cout<<'\n'<<i<<'\n';
        while(!qu.empty())
        {
            pii now=qu.front();
            qu.pop();
            for(auto x:g[now.f])
            {
                if(vis[x]) continue;
                vis[x]=1;
                //cout<<now.f<<' '<<x<<'\n';
                qu.push({x,now.s+1});
                cnt+=now.s+1;
                //cout<<cnt<<'\n';
            }
        }
        ans=min(cnt,ans);
       // cout<<ans<<' '<<i<<'\n';
    }
    cout<<ans;
    return 0;
}

Subtask #1
0 / 22.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 33.0

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