oj.uz

Submission #272883

# Submission time Handle Problem Language Result Execution time Memory
272883 2020-08-18T17:44:21 Z toonewbie Bosses (BOI16_bosses) C++17
100 / 100
 858 ms 760 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define endl '\n'
#define ll long long
#define pi pair<int,int>

using namespace std;

const int MOD = 1e9 + 7;
const int N = 5005;

int n;
vector<int> g[N];

int used[N], sz[N];
int get(int rt) {
    for (int i = 1; i <= n; i++) {
        used[i] = 0;
        sz[i] = -1;
    }
    queue<int> q; q.push(rt); used[rt] = 1; sz[rt] = 1;
    while(!q.empty()) {
        int cur = q.front(); q.pop();
        for (int i : g[cur]) {
            if (used[i] == 0) {
                used[i] = 1;
                q.push(i);
                sz[i] = sz[cur] + 1;
            }
        }
    }
    int res = 0;
    for (int i = 1; i <= n; i++) {
        if (sz[i] == -1) return -1;
        res += sz[i];
    }
    return res;
}

int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1, c, x; i <= n; i++) {
        cin >> c;
        while(c--) cin >> x, g[x].pb(i);
    }
    int res = MOD;
    for (int i = 1; i <= n; i++) {
        int cur = get(i);
        if (cur != -1) res = min(res, cur);
    }
    cout << res << endl;
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 0 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 4 ms 512 KB Output is correct
14 Correct 141 ms 616 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 613 ms 680 KB Output is correct
17 Correct 816 ms 760 KB Output is correct
18 Correct 858 ms 760 KB Output is correct