oj.uz

Submission #1017092

# Submission time Handle Problem Language Result Execution time Memory
1017092 2024-07-08T20:35:45 Z ivaziva Bosses (BOI16_bosses) C++14
100 / 100
 516 ms 840 KB 
#include <bits/stdc++.h>

using namespace std;

#define MAXN 5010

long long n;
vector<long long> adj[MAXN];
long long dist[MAXN];
queue<long long> bfsq;

void bfs(long long pret)
{
    for (long long i=1;i<=n;i++) dist[i]=LLONG_MAX;
    dist[pret]=1;bfsq.push(pret);
    while (bfsq.empty()==false)
    {
        long long node=bfsq.front();
        bfsq.pop();
        for (long long sled:adj[node])
        {
            if (dist[sled]!=LLONG_MAX) continue;
            dist[sled]=dist[node]+1;
            bfsq.push(sled);
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n;
    for (long long i=1;i<=n;i++)
    {
        long long s;cin>>s;
        for (long long j=0;j<s;j++)
        {
            long long x;cin>>x;
            adj[x].push_back(i);
        }
    }
    long long ans=LLONG_MAX;
    for (long long i=1;i<=n;i++)
    {
        bfs(i);long long sol=0;
        for (long long j=1;j<=n;j++)
        {
            if (dist[j]==LLONG_MAX) {sol=LLONG_MAX;break;}
            else sol+=dist[j];
        }
        ans=min(ans,sol);
    }
    cout<<ans<<endl;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 79 ms 604 KB Output is correct
15 Correct 10 ms 584 KB Output is correct
16 Correct 403 ms 840 KB Output is correct
17 Correct 455 ms 604 KB Output is correct
18 Correct 516 ms 600 KB Output is correct