# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975574 | dong_gas | Bosses (BOI16_bosses) | C++17 | 2 ms | 3932 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/extc++.h>
#define all(v) v.begin(), v.end()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int n, ans=1e18;
queue<int> hubo[5050];
vector<int> adj[5050];
int a[5050];
void dfs(int u) {
a[u]=1;
for(int& v:adj[u]) {
dfs(v);
a[u]+=a[v];
}
}
int f(int r) {
for(int i=1;i<=n;i++) adj[i].clear(), a[i]=0;
vector<bool> visited(n+1,0);
queue<int> q;
q.push(r);
visited[r]=1;
while(!q.empty()) {
int u=q.front(); q.pop();
while(!hubo[u].empty()) {
int v=hubo[u].front(); hubo[u].pop();
if(visited[v]) continue;
visited[v]=1;
adj[u].push_back(v);
q.push(v);
}
}
int cnt=0;
for(int i=1;i<=n;i++) if(visited[i]) cnt++;
if(cnt<n) return 1e18;
dfs(r);
return accumulate(a+1,a+n+1,0);
}
void solve() {
cin>>n;
for(int i=1;i<=n;i++) {
int k; cin>>k;
while(k-->0) {
ll x; cin>>x;
hubo[x].push(i);
}
}
for(int r=1;r<=n;r++) {
ans=min(ans,f(r));
//cout<<f(r)<<endl;
}
cout<<ans;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
while(tc --> 0) solve();
}
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... |