oj.uz

Submission #723605

# Submission time Handle Problem Language Result Execution time Memory
723605 2023-04-14T06:12:16 Z The_Samurai Bosses (BOI16_bosses) C++17
100 / 100
 636 ms 828 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")

#include "bits/stdc++.h"

using namespace std;
using ll = long long;
int INF = 2e9;


void solve() {
    int n;
    cin >> n;
    vector<vector<int>> in(n + 1);
    for (int i = 1; i <= n; i++) {
        int k;
        cin >> k;
        while (k--) {
            int j;
            cin >> j;
            in[j].emplace_back(i);
        }
    }
    int ans = 2e9;
    vector<pair<int, int>> queue(n + 1);
    for (int i = 1; i <= n; i++) {
        // root -> i
        queue[0] = {i, 0};
        vector<bool> vis(n + 1);
        vector<int> cost(n + 1, 1);
        int pos = 1;
        vis[i] = 1;
        for (int j = 0; j < pos; j++) {
            int u = queue[j].first;
            for (int v: in[u]) {
                if (!vis[v]) {
                    vis[v] = 1;
                    queue[pos] = {v, u};
                    pos++;
                }
            }
        }
        if (pos != n) continue;
        for (int j = n - 1; j >= 0; j--) {
            cost[queue[j].second] += cost[queue[j].first];
        }
        int now = 0;
        for (int j = 1; j <= n; j++)
            now += cost[j];
        ans = min(ans, now);
    }
    cout << ans;
}

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

    int queries = 1;
#ifdef test_cases
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
//    cin >> queries;
#else
    //    cin >> queries;
#endif

    for (int test_case = 1; test_case <= queries; test_case++) {
        solve();
//        cout << '\n';
    }
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 92 ms 556 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 458 ms 608 KB Output is correct
17 Correct 636 ms 716 KB Output is correct
18 Correct 614 ms 828 KB Output is correct