# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758818 | nihon | Bosses (BOI16_bosses) | C++14 | 1 ms | 428 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 N 5005
using namespace std;
int n,i,j,x,k,f[N],g[N],t,mn=2e9;
vector<int> v[N];
struct elem
{
int x;
int t;
}q[N];
void bfs()
{
int st=1,dr=1,p;
f[i]=1;
q[st].x=i;
q[st].t=1;
while(st<=dr)
{
int y=q[st].x;
for(j=0;j<v[y].size();++j)
{
if(!f[v[y][j]])
{
++dr;
q[dr].x=v[y][j];
q[dr].t=q[st].t+1;
t+=q[dr].t;
f[v[y][j]]=1;
}
}
++st;
}
}
int main()
{
cin>>n;
for(i=1;i<=n;++i)
{
cin>>k;
for(j=1;j<=k;++j)
{
cin>>x;
v[x].push_back(i);
}
}
for(i=1;i<=n;++i)
{
t=1;
for(j=1;j<=n;++j)
{
f[j]=0;
g[j]=0;
}
bfs();
mn=min(mn,t);
}
cout<<mn;
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... |