oj.uz

Submission #34556

# Submission time Handle Problem Language Result Execution time Memory
34556 2017-11-12T12:07:39 Z Extazy Bosses (BOI16_bosses) C++14
100 / 100
 803 ms 2452 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

const int N = 5007;

int n,ans;
vector < int > v[N];
bool used[N];
int level[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int i;

    scanf("%d", &n);
    for(i=1;i<=n;i++) {
        int x;
        scanf("%d", &x);
        while(x--) {
            int y;
            scanf("%d", &y);
            v[y].push_back(i);
        }
    }

    ans=numeric_limits < int >::max();

    for(int root=1;root<=n;root++) {
        int cnt=0,curr=0;
        queue < int > q;

        memset(used,0,sizeof(used));
        used[root]=true;
        level[root]=1;
        q.push(root);
        
        while(!q.empty()) {
            int where=q.front();
            q.pop();

            ++cnt;
            curr+=level[where];

            for(i=0;i<(int)(v[where].size());i++) {
                if(!used[v[where][i]]) {
                    used[v[where][i]]=true;
                    level[v[where][i]]=level[where]+1;
                    q.push(v[where][i]);
                }
            }
        }

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

    printf("%d\n", ans);

    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:18:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
bosses.cpp:21:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x);
                        ^
bosses.cpp:24:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &y);
                            ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2320 KB Output is correct
2 Correct 0 ms 2320 KB Output is correct
3 Correct 0 ms 2320 KB Output is correct
4 Correct 0 ms 2320 KB Output is correct
5 Correct 0 ms 2320 KB Output is correct
6 Correct 0 ms 2320 KB Output is correct
7 Correct 0 ms 2320 KB Output is correct
8 Correct 0 ms 2320 KB Output is correct
9 Correct 0 ms 2320 KB Output is correct
10 Correct 0 ms 2320 KB Output is correct
11 Correct 0 ms 2320 KB Output is correct
12 Correct 6 ms 2320 KB Output is correct
13 Correct 6 ms 2320 KB Output is correct
14 Correct 153 ms 2320 KB Output is correct
15 Correct 3 ms 2320 KB Output is correct
16 Correct 729 ms 2452 KB Output is correct
17 Correct 803 ms 2452 KB Output is correct
18 Correct 779 ms 2452 KB Output is correct