# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
27021 | 2017-07-08T17:18:15 Z | bill_kondo | Bosses (BOI16_bosses) | C++14 | 703 ms | 2316 KB |
#include "bits/stdc++.h" using namespace std; #define pb push_back #define debug(args...) fprintf(stderr,args) #define FOR(i,a,b) for(int i = a; i <= b; ++i) #define REP(i,a,b) for(int i = a; i >= b; --i) typedef long long ll; typedef pair<int,int>pii; const int maxn = 5e3 + 10; const ll INF = 1e18; int n; vector<int>g[maxn]; bool mrk[maxn]; ll dis[maxn]; ll solve(int root){ FOR(i,1,n){ mrk[i] = false; dis[i] = INF; } queue<int>Q; dis[root] = 1; mrk[root] = true; Q.push(root); while(!Q.empty()){ int v = Q.front(); Q.pop(); for(auto u: g[v]) if(!mrk[u]){ mrk[u] = true; dis[u] = dis[v] + 1; Q.push(u); } } ll ret = 0; FOR(i,1,n){ if(!mrk[i]) return INF; ret += dis[i]; } return ret; } int main(){ scanf("%d",&n); FOR(i,1,n){ int k; scanf("%d",&k); while(k--){ int node; scanf("%d",&node); g[node].pb(i); } } ll ans = INF; FOR(i,1,n) ans = min(ans,solve(i)); printf("%lld\n",ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2184 KB | Output is correct |
2 | Correct | 0 ms | 2184 KB | Output is correct |
3 | Correct | 0 ms | 2184 KB | Output is correct |
4 | Correct | 0 ms | 2184 KB | Output is correct |
5 | Correct | 0 ms | 2184 KB | Output is correct |
6 | Correct | 0 ms | 2184 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2184 KB | Output is correct |
2 | Correct | 0 ms | 2184 KB | Output is correct |
3 | Correct | 0 ms | 2184 KB | Output is correct |
4 | Correct | 0 ms | 2184 KB | Output is correct |
5 | Correct | 0 ms | 2184 KB | Output is correct |
6 | Correct | 0 ms | 2184 KB | Output is correct |
7 | Correct | 0 ms | 2184 KB | Output is correct |
8 | Correct | 0 ms | 2184 KB | Output is correct |
9 | Correct | 0 ms | 2184 KB | Output is correct |
10 | Correct | 0 ms | 2184 KB | Output is correct |
11 | Correct | 0 ms | 2184 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2184 KB | Output is correct |
2 | Correct | 0 ms | 2184 KB | Output is correct |
3 | Correct | 0 ms | 2184 KB | Output is correct |
4 | Correct | 0 ms | 2184 KB | Output is correct |
5 | Correct | 0 ms | 2184 KB | Output is correct |
6 | Correct | 0 ms | 2184 KB | Output is correct |
7 | Correct | 0 ms | 2184 KB | Output is correct |
8 | Correct | 0 ms | 2184 KB | Output is correct |
9 | Correct | 0 ms | 2184 KB | Output is correct |
10 | Correct | 0 ms | 2184 KB | Output is correct |
11 | Correct | 0 ms | 2184 KB | Output is correct |
12 | Correct | 3 ms | 2316 KB | Output is correct |
13 | Correct | 3 ms | 2316 KB | Output is correct |
14 | Correct | 203 ms | 2316 KB | Output is correct |
15 | Correct | 49 ms | 2316 KB | Output is correct |
16 | Correct | 656 ms | 2316 KB | Output is correct |
17 | Correct | 696 ms | 2316 KB | Output is correct |
18 | Correct | 703 ms | 2316 KB | Output is correct |