oj.uz

Submission #596580

# Submission time Handle Problem Language Result Execution time Memory
596580 2022-07-14T21:09:01 Z 1zaid1 Bosses (BOI16_bosses) C++17
100 / 100
 1194 ms 1228 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
// #define int long long

const int M = 1e4+2;
vector<int> node[M], nod[M];
bitset<5005> vis;
int n;

pair<int, int> dfs(int s) {
    int a = 0, b = 0;
    vis[s] = true;
    for (int i:nod[s]) {
        if (!vis[i]) {
            auto [x, y] = dfs(i);
            a += x; b += y;
        }
    } return {a+1, b+a+1};
}

int solve(int s) {
    vis = 0;
    vis[s] = true;
    queue<int> q;
    q.push(s);
    int cnt = 0;
    for (int i = 1; i <= n; i++) nod[i].clear();
    while (!q.empty()) {
        int f = q.front(); q.pop();
        for (int i:node[f]) {
            if (!vis[i]) {
                vis[i] = true;
                nod[f].push_back(i);
                q.push(i);
            }
        } cnt++;
    } vis = 0;
    if (cnt != n) return INT_MAX;
    return dfs(s).second;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;

    for (int i = 1; i <= n; i++) {
        int m;
        cin >> m;

        for (int j = 1; j <= m; j++) {
            int a;
            cin >> a;
            node[a].push_back(i);
        }
    }

    int mn = INT_MAX;
    for (int i = 1; i <= n; i++) {
        mn = min(mn, solve(i));
    } cout << mn << endl;

    return 0;
}
/*
4
1 4
3 1 3 4
2 1 2
1 3

*/

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 0 ms 724 KB Output is correct
3 Correct 0 ms 724 KB Output is correct
4 Correct 0 ms 724 KB Output is correct
5 Correct 0 ms 724 KB Output is correct
6 Correct 0 ms 724 KB Output is correct
7 Correct 0 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 0 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 183 ms 1092 KB Output is correct
15 Correct 28 ms 956 KB Output is correct
16 Correct 621 ms 1056 KB Output is correct
17 Correct 1194 ms 1228 KB Output is correct
18 Correct 1190 ms 1228 KB Output is correct