# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68909 | Vahan | Bosses (BOI16_bosses) | C++17 | 1559 ms | 1968 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<iostream>
#include<vector>
#include<deque>
#include<cstdio>
using namespace std;
vector<int> r[20000],g[20000];
deque<int> q;
int n,pp,u[100000],pat=-1;
int dfs(int v,int p)
{
int x=1;
for(int i=0;i<r[v].size();i++)
{
int to=r[v][i];
if(to==p)
continue;
x+=dfs(to,v);
}
pp+=x;
return x;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
int a;
scanf("%d",&a);
for(int j=1;j<=a;j++)
{
int b;
scanf("%d",&b);
if(i!=b)
g[b].push_back(i);
}
}
for(int i=1;i<=n;i++)
{
q.push_back(i);
u[i]=1;
int t=0;
while(!q.empty())
{
int v=q.front();
q.pop_front();
t++;
for(int j=0;j<g[v].size();j++)
{
int to=g[v][j];
if(u[to]==0)
{
u[to]=1;
q.push_back(to);
r[v].push_back(to);
}
}
}
if(t==n)
{
pp=0;
dfs(i,-1);
if(pp<pat || pat==-1)
pat=pp;
}
else
q.clear();
for(int j=1;j<=n;j++)
{
u[j]=0;
r[j].clear();
}
}
cout<<pat<<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... |