oj.uz

Submission #23004

# Submission time Handle Problem Language Result Execution time Memory
23004 2017-05-01T08:29:50 Z ngkan146 Bosses (BOI16_bosses) C++
100 / 100
 733 ms 2276 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mk make_pair
using namespace std;
typedef pair<int,int> ii;
vector <int> G[5001];
bool used[5001];
int n,ans = 999999999,tmp;
int bfs(int root){
    memset(used,0,sizeof(used));
    queue <ii> q;
    q.push(mk(root,1));
    int cnt = n,res = 0;
    used[root] = 1;
    while(q.size()){
        int u = q.front().fi,level=q.front().se;
        q.pop();
        res += level;
        cnt--;
        for(int i=0;i<G[u].size();i++){
            int v = G[u][i];
            if (used[v]) continue;
            used[v] = 1;
            q.push(mk(v,level+1));
        }
    }
    if (cnt > 0) return 999999999;
    return res;
}
void solve(int root){
    ans = min(ans,bfs(root));
}
int main(){
    //freopen("t.in.7","r",stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int k,x;
        scanf("%d",&k);
        for(int j=1;j<=k;j++) scanf("%d",&x),G[x].push_back(i);
    }
    for(int i=1;i<=n;i++) solve(i);
    printf("%d",ans);
}

Compilation message

bosses.cpp: In function 'int bfs(int)':
bosses.cpp:21:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<G[u].size();i++){
                      ^
bosses.cpp: In function 'int main()':
bosses.cpp:36:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
bosses.cpp:39:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&k);
                       ^
bosses.cpp:40:63: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int j=1;j<=k;j++) scanf("%d",&x),G[x].push_back(i);
                                                               ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2144 KB Output is correct
2 Correct 0 ms 2144 KB Output is correct
3 Correct 0 ms 2144 KB Output is correct
4 Correct 0 ms 2144 KB Output is correct
5 Correct 0 ms 2144 KB Output is correct
6 Correct 0 ms 2144 KB Output is correct
7 Correct 0 ms 2144 KB Output is correct
8 Correct 0 ms 2144 KB Output is correct
9 Correct 0 ms 2144 KB Output is correct
10 Correct 0 ms 2144 KB Output is correct
11 Correct 0 ms 2144 KB Output is correct
12 Correct 3 ms 2276 KB Output is correct
13 Correct 3 ms 2276 KB Output is correct
14 Correct 166 ms 2276 KB Output is correct
15 Correct 3 ms 2276 KB Output is correct
16 Correct 666 ms 2276 KB Output is correct
17 Correct 696 ms 2276 KB Output is correct
18 Correct 733 ms 2276 KB Output is correct