oj.uz

Submission #971301

# Submission time Handle Problem Language Result Execution time Memory
971301 2024-04-28T11:03:35 Z detectivebowon Bosses (BOI16_bosses) C++17
0 / 100
 1 ms 600 KB 
#include<bits/stdc++.h>
#define ep emplace
#define epb emplace_back
#define int long long
using namespace std;
int n,va[5007],ans=LLONG_MAX;
vector<int> adj[5007];
bool visited[5007];
void bfs(int node)
{
    queue<int> q;
    q.ep(node);
    while(!q.empty())
    {
        auto u=q.front();
        q.pop();
        for(auto v:adj[u])
        {
            if(visited[v]) continue;
            visited[v]=true;
            va[v]=va[u]+1;
            q.ep(v);
        }
    }
}
signed main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int num;
        cin>>num;
        while(num--)
        {
            int v;
            cin>>v;
            adj[v].epb(i);
        }
    }
    for(int i=1;i<=n;i++)
    {
        memset(visited,false,sizeof(visited));
        memset(va,0,sizeof(va));
        visited[i]=true;
        va[i]=1;
        bfs(i);
        int value=0;
        for(int j=1;j<=n;j++)
        {
            if(!visited[i])
            {
                value=LLONG_MAX;
                break;
            }
            value+=va[j];
        }
        // cout<<value<<"\n";
        ans=min(ans,value);
    }
    cout<<ans;
}

Subtask #1
0 / 22.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 33.0

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