# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68906 | 2018-08-19T08:16:38 Z | alenam0161 | Bosses (BOI16_bosses) | C++17 | 782 ms | 952 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back const int N = 5007; vector<int> g[N],g1[N]; int dis[N]; int main() { int n; scanf("%d",&n); pair<int,int> mb={-1e9,-1e9}; for(int i=1;i<=n;++i){ int k; scanf("%d",&k); for(int j=0;j<k;++j){ int p; scanf("%d",&p); g[p].pb(i); mb=max(mb,{(int)g[p].size(),p}); } } int ans=1e9; for(int i=1;i<=n;++i){ if(g[i].size()==0)continue; queue<int> q; q.push(i); memset(dis,0,sizeof(dis)); dis[i]=1; int hw=1; int cur=1; while(!q.empty()){ int v=q.front();q.pop(); for(auto to:g[v]){ if(dis[to]>0)continue; q.push(to); dis[to]=dis[v]+1; hw++; cur+=dis[to]; } } if(hw==n){ // cur=0; // dfs(i); ans=min(ans,cur); } } cout<<ans<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 3 ms | 740 KB | Output is correct |
3 | Correct | 2 ms | 740 KB | Output is correct |
4 | Correct | 2 ms | 740 KB | Output is correct |
5 | Correct | 2 ms | 740 KB | Output is correct |
6 | Correct | 3 ms | 748 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 3 ms | 740 KB | Output is correct |
3 | Correct | 2 ms | 740 KB | Output is correct |
4 | Correct | 2 ms | 740 KB | Output is correct |
5 | Correct | 2 ms | 740 KB | Output is correct |
6 | Correct | 3 ms | 748 KB | Output is correct |
7 | Correct | 2 ms | 748 KB | Output is correct |
8 | Correct | 3 ms | 896 KB | Output is correct |
9 | Correct | 2 ms | 896 KB | Output is correct |
10 | Correct | 2 ms | 896 KB | Output is correct |
11 | Correct | 4 ms | 896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 504 KB | Output is correct |
2 | Correct | 3 ms | 740 KB | Output is correct |
3 | Correct | 2 ms | 740 KB | Output is correct |
4 | Correct | 2 ms | 740 KB | Output is correct |
5 | Correct | 2 ms | 740 KB | Output is correct |
6 | Correct | 3 ms | 748 KB | Output is correct |
7 | Correct | 2 ms | 748 KB | Output is correct |
8 | Correct | 3 ms | 896 KB | Output is correct |
9 | Correct | 2 ms | 896 KB | Output is correct |
10 | Correct | 2 ms | 896 KB | Output is correct |
11 | Correct | 4 ms | 896 KB | Output is correct |
12 | Correct | 7 ms | 896 KB | Output is correct |
13 | Correct | 6 ms | 896 KB | Output is correct |
14 | Correct | 147 ms | 896 KB | Output is correct |
15 | Correct | 6 ms | 896 KB | Output is correct |
16 | Correct | 650 ms | 936 KB | Output is correct |
17 | Correct | 745 ms | 952 KB | Output is correct |
18 | Correct | 782 ms | 952 KB | Output is correct |