# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41139 | ssnsarang2023 | Bosses (BOI16_bosses) | C++14 | 0 ms | 0 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 <cstdio>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define SZ(x) ((int)x.size())
const int N = 5e3+5;
int n, sz[N], total;
bool vis[N];
vector<int> g[N], g2[N];
void dfs(int u) {
sz[u] = 1;
for (int i = 0; i < SZ(g2[u]); ++i) {
int v = g2[u][i];
dfs(v, total);
sz[u] += sz[v];
}
total += sz[u];
}
int make_tree(int root) {
for (int i = 1; i <= n; ++i) vis[i] = false, g2[i].clear();
queue<int> q;
q.push(root);
vis[root] = 1;
int cnt = 1;
while (SZ(q)) {
int u = q.front(); q.pop();
for (int i = 0; i < SZ(g[u]); ++i) {
int v = g[u][i];
if (vis[v]) continue;
++cnt, vis[v] = true;
q.push(v);
g2[u].push_back(v);
}
}
if (cnt < n) return (int)1e9+7;
total = 0;
dfs(root);
return total;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int m; scanf("%d", &m);
for (int j = 1, v; j <= m; ++j) {
scanf("%d", &v);
g[v].push_back(i);
}
}
int res = (int)1e9+7;
for (int i = 1; i <= n; ++i)
res = min(res, make_tree(i));
printf("%d", res);
return 0;
}