oj.uz

Submission #374068

# Submission time Handle Problem Language Result Execution time Memory
374068 2021-03-06T14:17:48 Z ritul_kr_singh Bosses (BOI16_bosses) C++17
100 / 100
 784 ms 876 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << " " <<
#define nl << "\n"

vector<vector<int>> g;
vector<bool> vis;

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    g.resize(n);
    vis.resize(n);
    for(int i=0; i<n; ++i){
        int k; cin >> k;
        for(int j=0; j<k; ++j){
            int x; cin >> x;
            g[x-1].push_back(i);
        }
    }
    int ans = 1e18;
    for(int root=0; root<n; ++root){
        for(int i=0; i<n; ++i) vis[i] = false;
        queue<pair<int, int>> q;
        vis[root] = true;
        q.emplace(root, 1);
        bool ok = true;
        int curr = 0;
        while(!q.empty()){
            int u = q.front().first, d = q.front().second;
            q.pop();
            curr += d;
            for(int v : g[u]){
                if(!vis[v]){
                    vis[v] = true;
                    q.emplace(v, d+1);
                }
            }
        }
        for(int i=0; i<n; ++i) if(!vis[i]) ok = false;
        if(ok) ans = min(ans, curr);
    }
    cout << ans nl;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 6 ms 492 KB Output is correct
13 Correct 5 ms 492 KB Output is correct
14 Correct 215 ms 644 KB Output is correct
15 Correct 90 ms 620 KB Output is correct
16 Correct 665 ms 876 KB Output is correct
17 Correct 784 ms 620 KB Output is correct
18 Correct 783 ms 744 KB Output is correct