# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292273 | Ahmad_Hasan | Bosses (BOI16_bosses) | C++17 | 1583 ms | 1392 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>
using namespace std;
vector<vector<int> >adj;
vector<vector<int> >adj2;
vector<int>vis;
vector<int>vis2;
int n;
pair<int,int> dfs(int cr){
vis[cr]=1;
pair<int,int>tmp;
tmp.first=0,tmp.second=0;
int cntc=0,cnttl=0;
for(int i=0;i<adj2[cr].size();i++){
if(!vis[adj2[cr][i]]){
tmp=dfs(adj2[cr][i]);
cntc+=tmp.first;
cnttl+=tmp.second;
}
}
return {cntc+1,cnttl+cntc+1};
}
void bfs(int cr){
queue<int>q;
q.push(cr);
vis2[cr]=1;
int cnt=1;
while(!q.empty()){
int ncr=q.front(); q.pop();
for(int i=0;i<adj[ncr].size();i++){
if(!vis2[adj[ncr][i]]){
vis2[adj[ncr][i]]=1;
cnt++;
adj2[ncr].push_back(adj[ncr][i]);
q.push(adj[ncr][i]);
}
if(cnt==n)
return;
}
}
}
int main()
{///{}
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n;
adj=vector<vector<int> >(n+1);
for(int i=1;i<=n;i++){
int nt;
cin>>nt;
while(nt--){
int tm;
cin>>tm;
adj[tm].push_back(i);
}
}
int ans=INT_MAX;
for(int i=1;i<=n;i++){
vis=vector<int> (n+1);
vis2=vector<int> (n+1);
adj2=vector<vector<int> > (n+1);
bfs(i);
int f=1;
for(int i=1;i<=n;i++)
if(!vis2[i]){
f=0;
break;
}
if(f)
ans=min(ans,dfs(i).second);
}
cout<<ans<<'\n';
return 0;
}
/***
4
1 2
1 1
1 2
1 2
*/
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... |