# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
208089 | 2020-03-10T02:00:05 Z | kai824 | Bosses (BOI16_bosses) | C++17 | 959 ms | 760 KB |
#include "bits/stdc++.h" using namespace std; #define int long long int n,k,a,ans=INT_MAX; int dist[5005]; int cur,nodes; vector<int> children[5005]; int32_t main() { ios_base::sync_with_stdio(false);cin.tie(0); queue<int> bfs; cin>>n; for(int x=1;x<=n;x++){ cin>>k; while(k--){ cin>>a; children[a].emplace_back(x); } } for(int x=1;x<=n;x++){ for(int i=1;i<=n;i++){ dist[i]=INT_MAX; } bfs.emplace(x);dist[x]=cur=1; nodes=0; while(!bfs.empty()){ nodes++; a=bfs.front(); bfs.pop(); for(int i=0;i<children[a].size();i++){ if(dist[children[a][i]]==INT_MAX){ dist[children[a][i]]=dist[a]+1; cur+=dist[a]+1; bfs.emplace(children[a][i]); } } } if(nodes!=n)continue; ans=min(ans,cur); } cout<<ans<<'\n'; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 504 KB | Output is correct |
3 | Correct | 5 ms | 504 KB | Output is correct |
4 | Correct | 5 ms | 504 KB | Output is correct |
5 | Correct | 5 ms | 504 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 504 KB | Output is correct |
3 | Correct | 5 ms | 504 KB | Output is correct |
4 | Correct | 5 ms | 504 KB | Output is correct |
5 | Correct | 5 ms | 504 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 504 KB | Output is correct |
8 | Correct | 5 ms | 504 KB | Output is correct |
9 | Correct | 5 ms | 504 KB | Output is correct |
10 | Correct | 5 ms | 504 KB | Output is correct |
11 | Correct | 5 ms | 504 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 5 ms | 504 KB | Output is correct |
3 | Correct | 5 ms | 504 KB | Output is correct |
4 | Correct | 5 ms | 504 KB | Output is correct |
5 | Correct | 5 ms | 504 KB | Output is correct |
6 | Correct | 5 ms | 376 KB | Output is correct |
7 | Correct | 5 ms | 504 KB | Output is correct |
8 | Correct | 5 ms | 504 KB | Output is correct |
9 | Correct | 5 ms | 504 KB | Output is correct |
10 | Correct | 5 ms | 504 KB | Output is correct |
11 | Correct | 5 ms | 504 KB | Output is correct |
12 | Correct | 11 ms | 504 KB | Output is correct |
13 | Correct | 9 ms | 632 KB | Output is correct |
14 | Correct | 237 ms | 636 KB | Output is correct |
15 | Correct | 27 ms | 632 KB | Output is correct |
16 | Correct | 818 ms | 760 KB | Output is correct |
17 | Correct | 932 ms | 632 KB | Output is correct |
18 | Correct | 959 ms | 632 KB | Output is correct |