oj.uz

Submission #757679

# Submission time Handle Problem Language Result Execution time Memory
757679 2023-06-13T14:42:45 Z DavidAA007 Bosses (BOI16_bosses) C++14
0 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
#define mod 1000000007
#define bit(x,i)(((x)>>(i))&1)
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
const long long int mare=1e9;
long long int T,n,m,k,x,y,c,i,j;
long long int aux,start,maxx,summax,minn,contor;
long long int dist[5005];
vector<int> G[5005];
queue<int> q;
long long int bfs(int nod)
{
    for(i=1;i<=n;i++)
    {
        dist[i]=mare;
    }
    dist[nod]=1;
    q.push(nod);
    while(!q.empty())
    {
        int j=q.front();
        c=dist[j];
        q.pop();
        for(auto t:G[j])
        {
            if(c+1<dist[t])
            {
                dist[t]=c+1;
                q.push(t);
            }
        }
    }
    bool ok=1;
    for(j=1;j<=n;j++)
    {
        if(dist[j]==mare)
        {
            ok=0;
            break;
        }
        contor=contor+dist[j];
    }
    if(!ok)
        return mare;
    return contor;
}
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>k;
        for(j=1;j<=k;j++)
        {
            cin>>x;
            G[x].push_back(i);
        }
    }
    minn=mare;
    for(i=1;i<=n;i++)
    {
        minn=min(minn,bfs(i));
    }
    cout<<minn;
    return 0;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 0 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 0 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 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -