oj.uz

Submission #884346

# Submission time Handle Problem Language Result Execution time Memory
884346 2023-12-07T07:56:33 Z vjudge1 Bosses (BOI16_bosses) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define pb push_back
#define pll array<ll, 2>
#define int long long

const int N = 5e3 + 4;
const ll INF = 1ll << 63;

int n;
bool vis[N];
vector<int> in[N];

pll dfs(int v) {
    vis[v] = true;
    pll ret = {0, 0};
    for (int u : in[v]) {
        if (vis[u] == false) {
            pll res = dfs(u);
            ret[0] += res[0];
            ret[1] += res[1];
        }
    }
    ++ret[0];
    ret[1] += ret[0];
    return ret;
}

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

    cin >> n;
    for (int i = 0; i < n; ++i) {
        int k;
        cin >> k;
        while (k--) {
            int v;
            cin >> v;
            --v;
            in[v].pb(i);
        }
    }

    ll ans = INF;
    for (int i = 0; i < n; ++i) {
        pll res = dfs(i);
        bool seeAll = true;
        for (int j = 0; j < n; ++j) {
            seeAll &= vis[j];
            vis[j] = false;
        }
        if (seeAll == true) {
            ans = min(ans, res[1]);
        }
    }
    cout << ans;

    return 0;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -