oj.uz

Submission #79514

# Submission time Handle Problem Language Result Execution time Memory
79514 2018-10-15T01:21:29 Z atoiz Bosses (BOI16_bosses) C++14
100 / 100
 680 ms 1176 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

const int MAX = 5007;
const int INF = 1e8;
int n;
vector<int> gr[MAX];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for (int v = 1; v <= n; ++v) {
        int k, u; cin >> k;
        for (int j = 0; j < k; ++j) {
            cin >> u; gr[u].push_back(v);
        }
    }

    int ans = INF;
    for (int root = 1; root <= n; ++root) {
        vector<int> hei(n + 1, INF);
        hei[root] = 0;
		queue<int> qu;
		qu.push(root);
        while (!qu.empty()) {
			int u = qu.front(); qu.pop();
            for (int v : gr[u]) {
                if (hei[v] < INF) continue;
                hei[v] = hei[u] + 1;
                qu.push(v);
            }
        }

        int curAns = n;
        bool full = 1;
        for (int u = 1; u <= n && full; ++u) {
            if (hei[u] == INF) full = 0;
			else curAns += hei[u];
        }
        if (full) ans = min(ans, curAns);
    }
    cout << ans;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 612 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 784 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 3 ms 796 KB Output is correct
11 Correct 3 ms 796 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 2 ms 612 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 784 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 3 ms 796 KB Output is correct
11 Correct 3 ms 796 KB Output is correct
12 Correct 9 ms 796 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 131 ms 1020 KB Output is correct
15 Correct 16 ms 1020 KB Output is correct
16 Correct 632 ms 1052 KB Output is correct
17 Correct 680 ms 1132 KB Output is correct
18 Correct 661 ms 1176 KB Output is correct