oj.uz

Submission #991250

# Submission time Handle Problem Language Result Execution time Memory
991250 2024-06-01T16:04:50 Z rsinventor Bosses (BOI16_bosses) C++17
100 / 100
 527 ms 844 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;
        vector<bool> visited(n);

        lvl[r] = 1;
        visited[r] = true;
        q.push(r);
        while (!q.empty()) {
            ll i = q.front();
            q.pop();
            for (ll a: adj[i]) {
                if (!visited[a]) {
                    visited[a] = true;
                    q.push(a);
                    lvl[a] = lvl[i] + 1;
                }
            }
        }
        bool flag = true;
        for(int v: visited) {
            if(!v) {
                flag = false;
            }
        }
        if(flag) {
            ll sum = 0;
            for(ll l: lvl) {
                sum += l;
            }
            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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 352 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 352 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 2 ms 624 KB Output is correct
14 Correct 88 ms 604 KB Output is correct
15 Correct 21 ms 604 KB Output is correct
16 Correct 410 ms 844 KB Output is correct
17 Correct 527 ms 608 KB Output is correct
18 Correct 499 ms 772 KB Output is correct