oj.uz

Submission #69787

# Submission time Handle Problem Language Result Execution time Memory
69787 2018-08-21T13:36:44 Z Bodo171 Bosses (BOI16_bosses) C++14
0 / 100
 2 ms 376 KB 
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
const int nmax=5005;
int ad[nmax][nmax];
int q[nmax],d[nmax],nr[nmax];
int n,m,i,j,a,b,p,u,start,x,nod,k;
long long ans;
long long bfs()
{
    q[u=1]=start;
    d[start]=1;
    for(p=1;p<=u;p++)
    {
        x=q[p];
        for(i=1;i<=nr[x];i++)
        {
            nod=ad[x][i];
            if(!d[nod])
                d[nod]=d[x]+1,q[++u]=nod;
        }
    }
    long long ret=0;
    bool busit;
    for(i=1;i<=n;i++)
    {
        ret+=1LL*d[i];
        if(!d[i]) busit=1;
        d[i]=0;
    }
    if(busit) return LLONG_MAX;
    return ret;
}
int main()
{
   // freopen("data.in","r",stdin);
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>k;
        for(j=1;j<=k;j++)
            {
                cin>>x;
                ad[x][++nr[x]]=j;
            }
    }
    ans=LLONG_MAX;
    for(start=1;start<=n;start++)
        ans=min(ans,bfs());
    cout<<ans;
    return 0;
}

Subtask #1
0 / 22.0

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

Subtask #2
0 / 45.0

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

Subtask #3
0 / 33.0

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