| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 392777 | Iwanttobreakfree | Bosses (BOI16_bosses) | C++17 | 1 ms | 312 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 <set>
#include <queue>
using namespace std;
int cont;
void dfs(int a,int ori,vector<bool>& visto,vector<vector<int> >& v,vector<int>& acumulacion,int parent){
visto[a]=true;
for(int x:v[a]){
if(!visto[x]){
dfs(x,ori,visto,v,acumulacion,a);
}
}
if(a==ori){
cont=0;
for(int i=0;i<visto.size();i++){
cont+=acumulacion[i];
}
return;
}
acumulacion[parent]+=acumulacion[a];
}
void bfs(int raiz,vector<set<int> >& v,vector<bool>& visto){
int n=visto.size();
queue <int> bfs;
bfs.push(raiz);
vector<vector<int> >constbfs(n,vector<int>());
int nodo;
visto[raiz]=true;
while(!bfs.empty()){
nodo=bfs.front();
bfs.pop();
for(auto x:v[nodo]){
if (!visto[x]){
constbfs[nodo].push_back(x);
bfs.push(x);
visto[x]=true;
}
}
}
vector<int> acumulacion(n,1);
vector<bool>nuevo(n,false);
dfs(raiz,raiz,nuevo,constbfs,acumulacion,raiz);
return;
}
int main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,k,mini=1e9,a;
cin>>n;
vector<set<int> >v (n,set<int>());
vector<bool>visto;
for(int i=0;i<n;i++){
cin>>k;
while(k--){
cin>>a;
a--;
v[a].insert(i);
}
}
for(int i=0;i<n;i++){
visto=vector<bool>(n,false);
bfs(i,v,visto);
if(mini>cont)mini=cont;
}
cout<<mini;
}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... | ||||
