| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 208075 | kai824 | Bosses (BOI16_bosses) | C++17 | 1581 ms | 892 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;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
bool vis[5005];
int cur,nodes;
vector<int> children[5005],children2[5005];
inline int dfs(int x){//returns salary of employee x...
nodes++;
int ans=1;
for(int i=0;i<children2[x].size();i++){
ans+=dfs(children2[x][i]);
}
cur+=ans;
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);cin.tie(0);
queue<int> bfs;
int n,k,a,ans=INT_MAX;
bool broke;
cin>>n;
for(int x=1;x<=n;x++){
cin>>k;
while(k--){
cin>>a;
children[a].push_back(x);
}
}
for(int x=1;x<=n;x++){
for(int i=1;i<=n;i++){vis[i]=0;children2[i].clear();}
bfs.push(x);vis[x]=1;
while(!bfs.empty()){
a=bfs.front();
bfs.pop();
for(int i=0;i<children[a].size();i++){
if(!vis[children[a][i]]){
vis[children[a][i]]=true;
bfs.push(children[a][i]);
children2[a].push_back(children[a][i]);
}
}
}
cur=nodes=0;
dfs(x);
if(nodes!=n)continue;
ans=min(ans,cur);
}
cout<<ans<<'\n';
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... | ||||
