oj.uz

Submission #531316

# Submission time Handle Problem Language Result Execution time Memory
531316 2022-02-28T11:51:07 Z bonk Bosses (BOI16_bosses) C++14
100 / 100
 706 ms 648 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 5002;
vector<int>v[N];
int n;

ll ans = 1e18;

void bfs(int s){
    vector<bool>vis(N, 0);
    queue<pair<int, int>>q;
    vis[s] = true;
    q.emplace(s, 1);

    int cnt = 1;
    ll total = 0;

    while(!q.empty()){
        auto now = q.front(); q.pop();

        total += now.second;

        for(auto x: v[now.first]){
            if(!vis[x]){
                cnt++;
                vis[x] = true;
                q.emplace(x, now.second + 1);
            }
        }
    }

    if(cnt == n) ans = min(ans, total);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;

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

    cout << ans << endl;

    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 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 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 436 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 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 5 ms 560 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 112 ms 496 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 483 ms 616 KB Output is correct
17 Correct 706 ms 648 KB Output is correct
18 Correct 632 ms 636 KB Output is correct