# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49475 | rzbt | Bosses (BOI16_bosses) | C++14 | 3 ms | 504 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 MAXN 5005
#define pb push_back
using namespace std;
int n;
vector<int> niz[MAXN];
vector<int> cudni[MAXN];
queue<int> q;
bool posecen[MAXN];
int tp;
void bfs(int t){
memset(posecen,0,sizeof(posecen));
tp=0;
q.push(t);
posecen[t]=true;
while(!q.empty()){
tp++;
t=q.front();
q.pop();
for(auto x:niz[t]){
if(posecen[x])continue;
cudni[t].pb(x);
posecen[x]=true;
q.push(x);
}
}
}
int res=1e9;
int ucena;
int dfs(int t){
int cena=1;
for(auto x:cudni[t])
cena+=dfs(x);
ucena+=cena;
return cena;
}
int main()
{
scanf("%d", &n);
for(int i=1;i<=n;i++){
int tk;
scanf("%d", &tk);
for(int j=0;j<tk;j++){
int t;
scanf("%d", &t);
niz[t].pb(i);
}
}
for(int i=1;i<=n;i++){
bfs(i);
if(tp!=n)continue;
for(int i=0;i<MAXN;i++)cudni[i].clear();
ucena=0;
dfs(i);
res=min(res,ucena);
}
printf("%d",res);
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... |