oj.uz

Submission #107313

# Submission time Handle Problem Language Result Execution time Memory
107313 2019-04-23T09:00:09 Z Gustav Bosses (BOI16_bosses) C++14
100 / 100
 797 ms 728 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
const int inf = 0x3f3f3f3f;
const ll linf = 123456789012345678;
const ll mod = 1000000007;
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl

int n;
vvi c;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    c = vvi(n);
    for(int i = 0; i < n; i++){
        int k;
        cin >> k;
        for(int j = 0; j < k; j++){
            int t;
            cin >> t;
            c[t-1].push_back(i);
        }
    }

    int ans = inf;
    for(int i = 0; i < n; i++){
        int t_ans = 0;
        vi seen(n);
        seen[i] = true;
        int sc = 1;
        queue<pi> q;
        q.push({i,1});
        while(!q.empty()){
            int e = q.front().first;
            int d = q.front().second;
            q.pop();
            for(int x : c[e]){
                if(seen[x]) continue;
                seen[x] = 1;
                q.push({x, d+1});
                sc++;
            }
            t_ans += d;
        }
        if(sc == n)
            ans = min(t_ans, ans);
    }
    cout << ans << "\n";
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 7 ms 488 KB Output is correct
14 Correct 170 ms 512 KB Output is correct
15 Correct 17 ms 640 KB Output is correct
16 Correct 562 ms 696 KB Output is correct
17 Correct 797 ms 716 KB Output is correct
18 Correct 639 ms 728 KB Output is correct