oj.uz

Submission #739651

# Submission time Handle Problem Language Result Execution time Memory
739651 2023-05-10T23:45:45 Z n0sk1ll Bosses (BOI16_bosses) C++17
100 / 100
 499 ms 652 KB 
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

graph g(5003);
bool vis[5003];

int ans=mod;

int do_bfs(int p, int n)
{
    fff(i,1,n) vis[i]=false;
    int proso=0;
    int cur=0;

    queue<pii> bfs;
    bfs.push({p,1});
    while (!bfs.empty())
    {
        auto [p,d]=bfs.front();
        bfs.pop();
        if (vis[p]) continue;

        vis[p]=true;
        proso++;
        cur+=d;

        for (auto it : g[p])
            bfs.push({it,d+1});
    }

    if (proso==n) return cur;
    return mod;
}

int main()
{
    FAST;

    int n; cin>>n;
    fff(i,1,n)
    {
        int kolko; cin>>kolko;
        while (kolko--)
        {
            int zelim; cin>>zelim;
            g[zelim].pb(i);
        }
    }

    fff(i,1,n)
    {
        int temp=do_bfs(i,n);
        ans=min(ans,temp);
    }

    cout<<ans<<"\n";
}

//Note to self: Check for overflow

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 444 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 0 ms 440 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 444 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 0 ms 440 KB Output is correct
7 Correct 1 ms 448 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 444 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 0 ms 440 KB Output is correct
7 Correct 1 ms 448 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 27 ms 620 KB Output is correct
13 Correct 19 ms 596 KB Output is correct
14 Correct 118 ms 540 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 479 ms 640 KB Output is correct
17 Correct 499 ms 652 KB Output is correct
18 Correct 488 ms 596 KB Output is correct