oj.uz

Submission #91979

# Submission time Handle Problem Language Result Execution time Memory
91979 2018-12-31T17:53:16 Z Kamisama Bosses (BOI16_bosses) C++14
100 / 100
 558 ms 732 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int maxn=5e3+7;
int n,h[maxn],res;
vector<int> adj[maxn];
inline void Bfs(const int &root){
    queue<int> q;
    fill(h,h+n+1,0);
    h[root]=1;
    int sum=1,nEdges=0;
    q.push(root);
    while(q.size()){
        int u=q.front();
        q.pop();
        for(int v: adj[u]){
            if(h[v]) continue;
            nEdges++;
            h[v]=h[u]+1;
            sum+=h[v];
            q.push(v);
        }
    }
    if(nEdges==n-1)res=min(res,sum);
}
inline void Read(int &x){
    register char c;
    for(c=getchar();c>'9'||c<'0';c=getchar());
    for(x=0;'0'<=c&&c<='9';c=getchar())x=10*x+c-'0';
}
inline void Write(const int &x){
    if(x>9) Write(x/10);
    putchar(x%10+'0');
}
int main(){
    Read(n);
    for(int i=1,k=0;i<=n;i++){
        Read(k);
        for(int j=1,x=0;j<=k;j++) Read(x),adj[x].push_back(i);
    }
  	res=(int)1e9+7;
    for(int i=1;i<=n;i++) Bfs(i);
    Write(res);
    return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 7 ms 380 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 119 ms 612 KB Output is correct
15 Correct 13 ms 504 KB Output is correct
16 Correct 506 ms 636 KB Output is correct
17 Correct 548 ms 732 KB Output is correct
18 Correct 558 ms 660 KB Output is correct