oj.uz

Submission #541845

# Submission time Handle Problem Language Result Execution time Memory
541845 2022-03-24T14:42:13 Z TheTrapper Bosses (BOI16_bosses) C++14
100 / 100
 700 ms 724 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using vll=vector<ll>;
using vpl=vector<pll>;
using vstr=vector<string>;
using sll=set<ll>;
using spl=set<pll>;
ll INF=1e18;
#define PI 3.14159265
ll MOD=1e9+7;



ll n=0;
vll v[5005];
bool visited[5005];
ll dist[5005];
queue<ll>q;
ll minimum=INF;
ll BFS(ll x)
{
    dist[x]=1;
    q.push(x);
    visited[x]=true;
    while(!q.empty())
    {
        ll y=q.front();
        q.pop();
        for(auto e:v[y])
        {
            if(!visited[e])
            {
                q.push(e);
                visited[e]=true;
                dist[e]=dist[y]+1;
            }
        }
    }
    ll s=0;
    for(ll i=1;i<=n;i++)
    {
        if(!visited[i])
        {
            return INF;
        }
        s += dist[i];
    }
    return s;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for(ll i=0;i<n;i++)
    {
        ll x;
        cin >> x;
        for(ll j=0;j<x;j++)
        {
            ll e;
            cin >> e;
            v[e].push_back(i+1);
        }
    }
    for(ll i=1;i<=n;i++)
    {
        ll b=BFS(i);
        minimum=min(minimum,b);
        memset(visited,false,sizeof(visited));
    }
    cout << minimum << '\n';
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 3 ms 660 KB Output is correct
14 Correct 128 ms 596 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 530 ms 724 KB Output is correct
17 Correct 700 ms 692 KB Output is correct
18 Correct 681 ms 688 KB Output is correct