# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46265 | 2018-04-18T10:59:53 Z | ikura355 | Bosses (BOI16_bosses) | C++14 | 640 ms | 1476 KB |
#include<bits/stdc++.h> using namespace std; #define ll long long const int maxn = 5000 + 5; const ll inf = 1e9; int n; vector<int> way[maxn]; int d[maxn]; queue<int> q; ll bfs(int x) { memset(d,0,sizeof(d)); d[x] = 1; q.push(x); while(!q.empty()) { int u = q.front(); q.pop(); for(auto v : way[u]) { if(!d[v]) { d[v] = d[u]+1; q.push(v); } } } ll sum = 0; for(int x=1;x<=n;x++) { sum += d[x]; if(d[x]==0) return inf; } return sum; } int main() { scanf("%d",&n); for(int x=1;x<=n;x++) { int m; scanf("%d",&m); while(m--) { int y; scanf("%d",&y); way[y].push_back(x); } } ll ans = inf; for(int x=1;x<=n;x++) ans = min(ans, bfs(x)); printf("%lld",ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 540 KB | Output is correct |
4 | Correct | 2 ms | 540 KB | Output is correct |
5 | Correct | 2 ms | 560 KB | Output is correct |
6 | Correct | 2 ms | 616 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 540 KB | Output is correct |
4 | Correct | 2 ms | 540 KB | Output is correct |
5 | Correct | 2 ms | 560 KB | Output is correct |
6 | Correct | 2 ms | 616 KB | Output is correct |
7 | Correct | 2 ms | 652 KB | Output is correct |
8 | Correct | 2 ms | 656 KB | Output is correct |
9 | Correct | 3 ms | 660 KB | Output is correct |
10 | Correct | 3 ms | 664 KB | Output is correct |
11 | Correct | 2 ms | 712 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 540 KB | Output is correct |
4 | Correct | 2 ms | 540 KB | Output is correct |
5 | Correct | 2 ms | 560 KB | Output is correct |
6 | Correct | 2 ms | 616 KB | Output is correct |
7 | Correct | 2 ms | 652 KB | Output is correct |
8 | Correct | 2 ms | 656 KB | Output is correct |
9 | Correct | 3 ms | 660 KB | Output is correct |
10 | Correct | 3 ms | 664 KB | Output is correct |
11 | Correct | 2 ms | 712 KB | Output is correct |
12 | Correct | 6 ms | 840 KB | Output is correct |
13 | Correct | 6 ms | 840 KB | Output is correct |
14 | Correct | 131 ms | 1112 KB | Output is correct |
15 | Correct | 9 ms | 1112 KB | Output is correct |
16 | Correct | 591 ms | 1212 KB | Output is correct |
17 | Correct | 640 ms | 1368 KB | Output is correct |
18 | Correct | 624 ms | 1476 KB | Output is correct |