# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
23004 | 2017-05-01T08:29:50 Z | ngkan146 | Bosses (BOI16_bosses) | C++ | 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
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | 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 |