oj.uz

Submission #814417

# Submission time Handle Problem Language Result Execution time Memory
814417 2023-08-08T07:23:19 Z burythelightdeepwithin Bosses (BOI16_bosses) C++14
100 / 100
 917 ms 980 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5003;

vector <int> adj[N], adj2[N];
int vs[N], sz[N], ans, tmp = 1e9+7, n;
queue <int> q;

void bfs(){
    while(!q.empty()){
        int u = q.front();
        vs[u] = 1;
        //cout << "BFS " << u << endl;
        q.pop();
        for (auto v: adj[u]){
            if (!vs[v]){
                q.push(v);
                adj2[u].push_back(v);
                vs[v] = 1;
            }
        }
    }
    //cout << endl;
}

void dfs(int u, int par){
    sz[u]++;
    for (auto v: adj2[u]){
        if (v != par){
            dfs(v, u);
            sz[u] += sz[v];
        }
    }
    ans += sz[u];
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++){
        int m;
        cin >> m;
        for (int j = 1; j <= m; j++){
            int x;
            cin >> x;
            adj[x].push_back(i);
        }
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            vs[j] = 0;
            sz[j] = 0;
            adj2[j].clear();
        }
        q.push(i);
        bfs();
        bool able = true;
        for (int j = 1; j <= n; j++){
            if (!vs[j]){
                able = 0;
            }
        }
        if (!able){
            continue;
        }
        ans = 0;
        dfs(i, i);
        tmp = min(tmp, ans);
        //cout << ans << " WHAT\n";
    }
    cout << tmp;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 560 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 157 ms 968 KB Output is correct
15 Correct 37 ms 780 KB Output is correct
16 Correct 575 ms 912 KB Output is correct
17 Correct 917 ms 980 KB Output is correct
18 Correct 907 ms 980 KB Output is correct