| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 865938 |
2023-10-25T04:53:28 Z |
maks007 |
Bosses (BOI16_bosses) |
C++14 |
|
1500 ms |
1444 KB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main () {
int n, ans = LLONG_MAX;
cin >> n;
vector <int> g[n];
for(int i = 0; i < n; i ++) {
int sz;
cin >> sz;
while(sz --) {
int v;
cin >> v;
g[v-1].push_back(i);
}
}
queue <int> q;
for(int i = 0; i < n; i ++) {
vector <int> dist(n, LLONG_MAX);
dist[i] = 0;
q.push(i);
vector <pair <int,int>> temp;
while(!q.empty()) {
int v = q.front();
q.pop();
for(auto u : g[v]) {
if(dist[u] == LLONG_MAX) {
temp.push_back({v, u});
dist[u] = dist[v] + 1;
q.push(u);
}
}
}
if(count(dist.begin(), dist.end(), LLONG_MAX)) continue;
vector <int> g2[n];
vector <int> dp(n, 1);
function <void(int,int)> dfs=[&](int v, int p) {
for(auto u : g2[v]) {
if(p == u) continue;
dfs(u, v);
dp[v] += dp[u];
}
};
for(auto j : temp) g2[j.first].push_back(j.second);
dfs(i,-1);
ans = min(ans, accumulate(dp.begin(), dp.end(), 0LL));
}
cout << ans;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
5 ms |
600 KB |
Output is correct |
| 13 |
Correct |
4 ms |
600 KB |
Output is correct |
| 14 |
Correct |
130 ms |
1280 KB |
Output is correct |
| 15 |
Correct |
27 ms |
860 KB |
Output is correct |
| 16 |
Correct |
600 ms |
1048 KB |
Output is correct |
| 17 |
Execution timed out |
1527 ms |
1444 KB |
Time limit exceeded |
| 18 |
Halted |
0 ms |
0 KB |
- |
