# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81541 | arman_ferdous | Bosses (BOI16_bosses) | C++17 | 2 ms | 632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 5010;
int n;
vector<int> g[N];
int val[N];
int dfs(int u) {
val[u] = 1;
for(int v : g[u]) if(val[v] == -1)
val[u] += dfs(v);
return val[u];
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
int sz, j; scanf("%d", &sz);
while(sz--) {
scanf("%d", &j);
g[j].push_back(i);
}
}
int ans = (int)2e9;
for(int i = 1; i <= n; i++) {
memset(val,-1,sizeof val);
dfs(i);
int here = 0;
for(int j = 1; j <= n; j++) {
here += val[j];
if(val[j] == -1) { here = (int)2e9; break; }
}
ans = min(ans, here);
} printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |