# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489839 | ala2 | Bosses (BOI16_bosses) | C++14 | 1039 ms | 262148 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>
#define int long long
using namespace std;
vector<int>v[50500];
int vi[5010][5010];
int d[5050][5050];
vector<int>gr[50500];
int vv[5050][5050];
int dfs(int node,int i)
{
if(d[i][node])
return d[i][node];
if(gr[node].size()==0)
{
return d[i][node]=1;;
}
int sum=0;
for(int u=0;u<gr[node].size();u++)
{
sum+=dfs(gr[node][u],i);
}
return d[i][node]=sum+1;
}
signed main()
{
// memset(gr,0,sizeof gr);
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int k;
cin>>k;
for(int j=0;j<k;j++)
{
int x;
cin>>x;
if(!vv[x][i]&&x<=n){
v[x].push_back(i+1);
vv[x][i]=1;
}
}
}
int mn=10000000000;
for(int i=1;i<n+1;i++)
{
//cout<<"_______________________"<<endl;
for(int uu=0;uu<=n;uu++)
{
gr[uu].clear();
}
queue<int>q;
q.push(i);
vi[i][i]=1;
while(!q.empty())
{
int x=q.front();
q.pop();
for(int j=0;j<v[x].size();j++)
{
int h=v[x][j];
if(!vi[i][h])
{
vi[i][h]=1;
q.push(h);
// cout<<" "<<i<<" "<<h<<endl;
gr[x].push_back(h);
}
}
}
if(v[i].size())
int c=dfs(i,i);
int yy=0; int bb=0;
for(int j=1;j<=n;j++)
{
// // cout<<" "<<i<<" "<<j<<" "<<d[i][j]<<endl;
yy+=d[i][j];
if(d[i][j]==0)
bb=1;
}
if(bb)
continue;
// cout<<" "<<i<<" "<<yy<<endl;
mn=min(mn,yy);
}
cout<<mn<<endl;
}
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... |