| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 146228 |
2019-08-22T23:22:44 Z |
Diuven |
Bosses (BOI16_bosses) |
C++14 |
|
1088 ms |
1116 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 5010;
const lint LNF = 2e18;
int n;
vector<int> G[MAX], R[MAX];
int solve(int r){
int res = 1;
queue<int> Q;
int dep[MAX] = {};
dep[r] = 1; Q.push(r);
while(!Q.empty()){
int v; v=Q.front(); Q.pop();
for(int x:R[v]){
if(dep[x]) continue;
Q.push(x); dep[x] = dep[v]+1;
res += dep[x];
}
}
for(int i=1; i<=n; i++) if(dep[i]==0) return INF;
return res;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
cin>>n;
for(int i=1; i<=n; i++){
int k, x; cin>>k;
for(int j=1; j<=k; j++) cin>>x, G[i].push_back(x), R[x].push_back(i);
}
int ans = INF;
for(int i=1; i<=n; i++) ans = min(ans, solve(i));
cout<<ans<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
636 KB |
Output is correct |
| 2 |
Correct |
2 ms |
632 KB |
Output is correct |
| 3 |
Correct |
2 ms |
632 KB |
Output is correct |
| 4 |
Correct |
2 ms |
632 KB |
Output is correct |
| 5 |
Correct |
2 ms |
504 KB |
Output is correct |
| 6 |
Correct |
3 ms |
632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
636 KB |
Output is correct |
| 2 |
Correct |
2 ms |
632 KB |
Output is correct |
| 3 |
Correct |
2 ms |
632 KB |
Output is correct |
| 4 |
Correct |
2 ms |
632 KB |
Output is correct |
| 5 |
Correct |
2 ms |
504 KB |
Output is correct |
| 6 |
Correct |
3 ms |
632 KB |
Output is correct |
| 7 |
Correct |
3 ms |
632 KB |
Output is correct |
| 8 |
Correct |
3 ms |
632 KB |
Output is correct |
| 9 |
Correct |
3 ms |
632 KB |
Output is correct |
| 10 |
Correct |
3 ms |
632 KB |
Output is correct |
| 11 |
Correct |
3 ms |
628 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
636 KB |
Output is correct |
| 2 |
Correct |
2 ms |
632 KB |
Output is correct |
| 3 |
Correct |
2 ms |
632 KB |
Output is correct |
| 4 |
Correct |
2 ms |
632 KB |
Output is correct |
| 5 |
Correct |
2 ms |
504 KB |
Output is correct |
| 6 |
Correct |
3 ms |
632 KB |
Output is correct |
| 7 |
Correct |
3 ms |
632 KB |
Output is correct |
| 8 |
Correct |
3 ms |
632 KB |
Output is correct |
| 9 |
Correct |
3 ms |
632 KB |
Output is correct |
| 10 |
Correct |
3 ms |
632 KB |
Output is correct |
| 11 |
Correct |
3 ms |
628 KB |
Output is correct |
| 12 |
Correct |
7 ms |
760 KB |
Output is correct |
| 13 |
Correct |
6 ms |
760 KB |
Output is correct |
| 14 |
Correct |
180 ms |
896 KB |
Output is correct |
| 15 |
Correct |
7 ms |
888 KB |
Output is correct |
| 16 |
Correct |
729 ms |
1116 KB |
Output is correct |
| 17 |
Correct |
1087 ms |
1016 KB |
Output is correct |
| 18 |
Correct |
1088 ms |
1004 KB |
Output is correct |
