# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
77034 | 2018-09-20T08:05:59 Z | farukkastamonuda | Bosses (BOI16_bosses) | C++14 | 739 ms | 1556 KB |
#include <bits/stdc++.h> #define li 10005 #define lo long long #define inf 1000000000000000000 using namespace std ; lo int n,x,y,mark[li],cnt,ans=inf,val; vector<lo int> v[li]; int main(){ scanf("%lld",&n); for(int i=1;i<=n;i++){ scanf("%lld",&x); for(int j=1;j<=x;j++){ scanf("%lld",&y); v[y].push_back(i); } } lo int cev=0; for(int i=1;i<=n;i++){ cev=0; val=0; memset(mark,0,sizeof(mark)); queue<int> q; q.push(i); cnt=0; mark[i]=1; while(!q.empty()){ int vv=q.front(); q.pop(); cnt++; val+=mark[vv]; if(val>=ans) break; for(int j=0;j<(int)v[vv].size();j++){ int go=v[vv][j]; if(mark[go]) continue; mark[go]=mark[vv]+1; q.push(go); } } if(cnt==n) ans=min(ans,val); } printf("%lld\n",ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 764 KB | Output is correct |
3 | Correct | 2 ms | 764 KB | Output is correct |
4 | Correct | 3 ms | 764 KB | Output is correct |
5 | Correct | 2 ms | 796 KB | Output is correct |
6 | Correct | 2 ms | 800 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 764 KB | Output is correct |
3 | Correct | 2 ms | 764 KB | Output is correct |
4 | Correct | 3 ms | 764 KB | Output is correct |
5 | Correct | 2 ms | 796 KB | Output is correct |
6 | Correct | 2 ms | 800 KB | Output is correct |
7 | Correct | 3 ms | 820 KB | Output is correct |
8 | Correct | 2 ms | 836 KB | Output is correct |
9 | Correct | 2 ms | 840 KB | Output is correct |
10 | Correct | 3 ms | 872 KB | Output is correct |
11 | Correct | 3 ms | 1076 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 764 KB | Output is correct |
3 | Correct | 2 ms | 764 KB | Output is correct |
4 | Correct | 3 ms | 764 KB | Output is correct |
5 | Correct | 2 ms | 796 KB | Output is correct |
6 | Correct | 2 ms | 800 KB | Output is correct |
7 | Correct | 3 ms | 820 KB | Output is correct |
8 | Correct | 2 ms | 836 KB | Output is correct |
9 | Correct | 2 ms | 840 KB | Output is correct |
10 | Correct | 3 ms | 872 KB | Output is correct |
11 | Correct | 3 ms | 1076 KB | Output is correct |
12 | Correct | 9 ms | 1076 KB | Output is correct |
13 | Correct | 7 ms | 1076 KB | Output is correct |
14 | Correct | 172 ms | 1144 KB | Output is correct |
15 | Correct | 25 ms | 1172 KB | Output is correct |
16 | Correct | 739 ms | 1316 KB | Output is correct |
17 | Correct | 218 ms | 1376 KB | Output is correct |
18 | Correct | 208 ms | 1556 KB | Output is correct |