oj.uz

Submission #485983

# Submission time Handle Problem Language Result Execution time Memory
485983 2021-11-10T03:42:17 Z chungdinh Bosses (BOI16_bosses) C++17
100 / 100
 971 ms 708 KB 
#include <iostream>
#include <utility>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>

using namespace std;

#define ii pair<int, int>
#define ll long long
#define MP(x, y) make_pair(x, y)

const int N = 5e3 + 5;
const ll INF = 1e18;

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

bool vsd[N];
int par[N];
ll dp[N];

vector<int> lst;
ll bfs(int u) {
    ll res = 0;

    queue<int> q; q.push(u);
    memset(vsd, false, sizeof vsd); vsd[u] = true;
    for (int i = 1; i <= n; i++) dp[i] = 1;
    par[u] = -1;
    lst.clear();

    queue<int> q1;

    while (q.size()) {
        int u = q.front(); q.pop();

        for (int v : g[u]) {
            if (!vsd[v]) {
                vsd[v] = true;
                q.push(v);
                par[v] = u;
            }
        }
        lst.push_back(u);
    }

    for (int i = lst.size(); i >= 0; i--) {
        int u = lst[i];
        if (par[u] > 0) dp[par[u]] += dp[u];
        res += dp[u];
    }

    for (int i = 1; i <= n; i++) if (!vsd[i]) return INF;

    return res;
}

int main() {
    #ifdef CHUNGDINH
    freopen("main.inp", "r", stdin);
    #endif // CHUNGDINH

    cin >> n;
    for (int i = 1; i <= n; i++) {
        int k; cin >> k;
        while (k--) {
            int u; cin >> u;
            g[u].push_back(i);
        }
    }

    ll res = INF;
    for (int i = 1; i <= n; i++) res = min(res, bfs(i));
    cout << res;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 5 ms 460 KB Output is correct
14 Correct 221 ms 600 KB Output is correct
15 Correct 13 ms 588 KB Output is correct
16 Correct 699 ms 644 KB Output is correct
17 Correct 971 ms 708 KB Output is correct
18 Correct 967 ms 672 KB Output is correct