# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68903 | alenam0161 | Bosses (BOI16_bosses) | C++17 | 4 ms | 728 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;
#define pb push_back
const int N = 5007;
vector<int> g[N],g1[N];
bool used[N];
int cur=0;
int dfs(int v,int p=-1){
int x=0;
for(int to:g1[v]){
if(to==p)continue;
x+=dfs(to,v);
}
cur+=x+1;
return x+1;
}
int main()
{
int n;
scanf("%d",&n);
pair<int,int> mb={-1e9,-1e9};
for(int i=1;i<=n;++i){
int k;
scanf("%d",&k);
for(int j=0;j<k;++j){
int p;
scanf("%d",&p);
g[p].pb(i);
mb=max(mb,{(int)g[p].size(),p});
}
}
int ans=1e9;
for(int i=1;i<=n;++i){
if(g[i].size()==0)continue;
if(abs((int)g[i].size()-mb.first)>1)continue;
for(int j=1;j<=n;++j)g1[j].resize(0);
queue<int> q;
q.push(i);
memset(used,0,sizeof(used));
used[i]=true;
int hw=1;
while(!q.empty()){
int v=q.front();q.pop();
for(auto to:g[v]){
if(used[to]==true)continue;
g1[v].pb(to);
q.push(to);
used[to]=true;
hw++;
}
}
if(hw==n){
cur=0;
dfs(i);
ans=min(ans,cur);
}
}
cout<<ans<<endl;
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... |