| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 197401 |
2020-01-21T03:20:22 Z |
Juney |
Bosses (BOI16_bosses) |
C++14 |
|
1012 ms |
860 KB |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e3 + 5;
int N, ans = 1e9;
vector<int> G[MAXN];
bool vis[MAXN];
int solve(int n) {
memset(vis, 0, sizeof(vis));
queue<pii> q; q.push(pii(n, 1));
vis[n] = 1;
int sum = 1, cnt = 0;
while(!q.empty()) {
int cur = q.front().fi, dep = q.front().se; q.pop();
cnt++;
for(auto nxt : G[cur]) if(!vis[nxt]) {
vis[nxt] = 1;
sum += dep + 1;
q.push(pii(nxt, dep+1));
}
}
if(cnt == N) return sum;
return 1e9;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> N;
for(int i=1; i<=N; i++) {
int x, y; cin >> x;
for(int j=1; j<=x; j++) {
cin >> y;
G[y].push_back(i);
}
}
for(int i=1; i<=N; i++) ans = min(ans, solve(i));
cout << ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
504 KB |
Output is correct |
| 9 |
Correct |
2 ms |
532 KB |
Output is correct |
| 10 |
Correct |
3 ms |
504 KB |
Output is correct |
| 11 |
Correct |
2 ms |
504 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
504 KB |
Output is correct |
| 9 |
Correct |
2 ms |
532 KB |
Output is correct |
| 10 |
Correct |
3 ms |
504 KB |
Output is correct |
| 11 |
Correct |
2 ms |
504 KB |
Output is correct |
| 12 |
Correct |
6 ms |
508 KB |
Output is correct |
| 13 |
Correct |
5 ms |
636 KB |
Output is correct |
| 14 |
Correct |
172 ms |
632 KB |
Output is correct |
| 15 |
Correct |
6 ms |
632 KB |
Output is correct |
| 16 |
Correct |
670 ms |
840 KB |
Output is correct |
| 17 |
Correct |
1012 ms |
764 KB |
Output is correct |
| 18 |
Correct |
972 ms |
860 KB |
Output is correct |
