| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 220471 |
2020-04-08T01:36:12 Z |
Calico |
Bosses (BOI16_bosses) |
C++17 |
|
1500 ms |
1064 KB |
#include <bits/stdc++.h>
using namespace std;
int n, ans = 1000000000;
vector<int> adj[5001];
vector<int> adj_tr[5001];
vector<int> dp(5001);
void dfs(int now) {
int s = 0;
for (int u: adj_tr[now]) {
dfs(u);
s += dp[u];
}
dp[now] = s+1;
}
int bfs(int fi) {
vector<int> dist(n+1, 10000000), prv(n+1);
queue<int> q;
q.push(fi); dist[fi] = 1;
while (q.size()) {
int now = q.front(); q.pop();
for (int u: adj[now]) {
if (dist[u] > dist[now] + 1) {
dist[u] = dist[now] + 1;
q.push(u); prv[u] = now;
}
}
}
for (int i = 1; i <= n; i++) {
adj_tr[i].clear(); dp[i] = 0;
}
for (int i = 1; i <= n; i++) {
if (i != fi) {
if (prv[i] == 0) return ans;
adj_tr[prv[i]].push_back(i);
}
}
dfs(fi);
int rs = 0;
//cout << fi << ": ";
for (int i = 1; i <= n; i++) {
rs += dp[i];
//cout << dp[i] << ' ';
}
//cout << '\n';
return rs;
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
int k; cin >> k;
while (k--) {
int x; cin >> x;
adj[x].push_back(i);
}
}
for (int i = 1; i <= n; i++) {
ans = min(ans, bfs(i));
}
cout << ans << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
640 KB |
Output is correct |
| 2 |
Correct |
5 ms |
640 KB |
Output is correct |
| 3 |
Correct |
5 ms |
640 KB |
Output is correct |
| 4 |
Correct |
5 ms |
640 KB |
Output is correct |
| 5 |
Correct |
5 ms |
640 KB |
Output is correct |
| 6 |
Correct |
5 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
640 KB |
Output is correct |
| 2 |
Correct |
5 ms |
640 KB |
Output is correct |
| 3 |
Correct |
5 ms |
640 KB |
Output is correct |
| 4 |
Correct |
5 ms |
640 KB |
Output is correct |
| 5 |
Correct |
5 ms |
640 KB |
Output is correct |
| 6 |
Correct |
5 ms |
640 KB |
Output is correct |
| 7 |
Correct |
5 ms |
640 KB |
Output is correct |
| 8 |
Correct |
5 ms |
640 KB |
Output is correct |
| 9 |
Correct |
5 ms |
640 KB |
Output is correct |
| 10 |
Correct |
5 ms |
640 KB |
Output is correct |
| 11 |
Correct |
5 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
640 KB |
Output is correct |
| 2 |
Correct |
5 ms |
640 KB |
Output is correct |
| 3 |
Correct |
5 ms |
640 KB |
Output is correct |
| 4 |
Correct |
5 ms |
640 KB |
Output is correct |
| 5 |
Correct |
5 ms |
640 KB |
Output is correct |
| 6 |
Correct |
5 ms |
640 KB |
Output is correct |
| 7 |
Correct |
5 ms |
640 KB |
Output is correct |
| 8 |
Correct |
5 ms |
640 KB |
Output is correct |
| 9 |
Correct |
5 ms |
640 KB |
Output is correct |
| 10 |
Correct |
5 ms |
640 KB |
Output is correct |
| 11 |
Correct |
5 ms |
640 KB |
Output is correct |
| 12 |
Correct |
10 ms |
768 KB |
Output is correct |
| 13 |
Correct |
8 ms |
768 KB |
Output is correct |
| 14 |
Correct |
203 ms |
1064 KB |
Output is correct |
| 15 |
Correct |
54 ms |
768 KB |
Output is correct |
| 16 |
Correct |
669 ms |
888 KB |
Output is correct |
| 17 |
Execution timed out |
1585 ms |
1024 KB |
Time limit exceeded |
| 18 |
Halted |
0 ms |
0 KB |
- |
