# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520121 | 2022-01-28T12:54:52 Z | krit3379 | Bosses (BOI16_bosses) | C++17 | 712 ms | 708 KB |
#include<bits/stdc++.h> using namespace std; #define N 5005 long long cnt,sum,ans=1e18; vector<int> g[N]; bitset<N> vis; queue<pair<int,int>> q; int main(){ int n,i,k,c,a,cou; scanf("%d",&n); for(i=1;i<=n;i++){ scanf("%d",&k); while(k--)scanf("%d",&c),g[c].push_back(i); } for(i=1;i<=n;i++){ vis=0; sum=cnt=0; q.push({i,1}); vis[i]=true; while(!q.empty()){ a=q.front().first; cou=q.front().second; q.pop(); cnt++; sum+=cou; for(auto x:g[a])if(!vis[x])vis[x]=true,q.push({x,cou+1}); } if(cnt==n)ans=min(ans,sum); } printf("%lld",ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 2 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 0 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 2 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 0 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 412 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 1 ms | 332 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
11 | Correct | 1 ms | 416 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 2 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 0 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 412 KB | Output is correct |
8 | Correct | 1 ms | 332 KB | Output is correct |
9 | Correct | 1 ms | 332 KB | Output is correct |
10 | Correct | 1 ms | 332 KB | Output is correct |
11 | Correct | 1 ms | 416 KB | Output is correct |
12 | Correct | 5 ms | 460 KB | Output is correct |
13 | Correct | 4 ms | 420 KB | Output is correct |
14 | Correct | 161 ms | 508 KB | Output is correct |
15 | Correct | 3 ms | 460 KB | Output is correct |
16 | Correct | 566 ms | 600 KB | Output is correct |
17 | Correct | 701 ms | 616 KB | Output is correct |
18 | Correct | 712 ms | 708 KB | Output is correct |