oj.uz

Submission #531137

# Submission time Handle Problem Language Result Execution time Memory
531137 2022-02-27T19:56:38 Z OttoTheDino Bosses (BOI16_bosses) C++17
100 / 100
 581 ms 708 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

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

    int n; cin >> n;
    vi adj[n+1];

    rep (i,1,n) {
        int k; cin >> k;
        rep (j,1,k) {
            int x; cin >> x;
            adj[x].pb(i);
        }
    }

    int ans = 1e9;

    rep (i,1,n) {
        int d[n+1] = {};
        d[i] = 1;
        queue<int> q;
        q.push(i);
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int v : adj[u]) {
                if (!d[v]) {
                    d[v] = d[u]+1;
                    q.push(v);
                }
            }
        }
        int suc = 1, sum = 0;
        rep (j,1,n) {
            sum += d[j];
            suc &= (d[j]>0);
        }

        if (suc) ans = min(ans, sum);
    }

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

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 4 ms 324 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 123 ms 460 KB Output is correct
15 Correct 25 ms 460 KB Output is correct
16 Correct 486 ms 708 KB Output is correct
17 Correct 581 ms 652 KB Output is correct
18 Correct 578 ms 640 KB Output is correct