oj.uz

Submission #991243

# Submission time Handle Problem Language Result Execution time Memory
991243 2024-06-01T15:57:11 Z rsinventor Bosses (BOI16_bosses) C++17
100 / 100
 516 ms 1112 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector <ll> vll;
typedef vector<bool> vb;
typedef vector <string> vs;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef vector <pii> vpii;

#define all(a) (a).begin(), (a).end()
#define pb push_back
#define endl "\n"

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    cin >> n;
    vector<ll> adj[n];
    for(ll i = 0; i < n; i++) {
        ll tmp;
        cin >> tmp;
        for(ll j = 0; j < tmp; j++) {
            ll a;
            cin >> a;
            adj[--a].pb(i);
        }
    }

    ll ans = 1e10;
    for(ll r = 0; r < n; r++) {
        vector<ll> lvl(n);
        queue<ll> q;

        lvl[r] = 1;
        q.push(r);
        while (!q.empty()) {
            ll i = q.front();
            q.pop();
            for (ll a: adj[i]) {
                if (lvl[a]==0) {
                    q.push(a);
                    lvl[a] = lvl[i] + 1;
                }
            }
        }
        ll sum = 0;
        bool flag = true;
        for(ll l: lvl) {
            if(l==0) {
                flag = false;
            }
            sum += l;
        }
        if(flag) {
            ans = min(ans, sum);
        }
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 83 ms 716 KB Output is correct
15 Correct 21 ms 744 KB Output is correct
16 Correct 412 ms 1112 KB Output is correct
17 Correct 516 ms 852 KB Output is correct
18 Correct 516 ms 604 KB Output is correct