oj.uz

Submission #121571

# Submission time Handle Problem Language Result Execution time Memory
121571 2019-06-26T19:17:10 Z DodgeBallMan Bosses (BOI16_bosses) C++14
100 / 100
 571 ms 760 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 5e3 + 10;

int n, ans = INT_MAX;
vector<int> g[N];
int dep[N];
queue<int> q;

int bfs( int root ) {
    int ret = 0;
    for( int i = 1 ; i <= n ; i++ ) dep[i] = INT_MAX;
    dep[root] = 1;
    q.emplace( root );
    while( !q.empty() ) {
        int now = q.front(); q.pop();
        for( int i : g[now] ) if( dep[now] + 1 < dep[i] ) {
            dep[i] = dep[now] + 1;
            q.emplace( i );
        }
    }
    for( int i = 1 ; i <= n ; i++ ) {
        if( dep[i] == INT_MAX ) return INT_MAX;
        ret += dep[i];
    }
    return ret;
}

int main()
{
    scanf("%d",&n);
    for( int i = 1, k ; i <= n ; i++ ) {
        scanf("%d",&k);
        for( int j = 1, t ; j <= k ; j++ ) {
            scanf("%d",&t);
            g[t].emplace_back( i );
        }
    }
    for( int i = 1 ; i <= n ; i++ ) ans = min( ans, bfs( i ) );
    printf("%d",ans);
    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
bosses.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&k);
         ~~~~~^~~~~~~~~
bosses.cpp:40:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&t);
             ~~~~~^~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 122 ms 512 KB Output is correct
15 Correct 14 ms 512 KB Output is correct
16 Correct 531 ms 760 KB Output is correct
17 Correct 571 ms 760 KB Output is correct
18 Correct 570 ms 712 KB Output is correct