Submission #1176589

#TimeUsernameProblemLanguageResultExecution timeMemory
1176589WarinchaiBosses (BOI16_bosses)C++20
0 / 100
0 ms324 KiB
#include<bits/stdc++.h> #define int long long using namespace std; vector<int>adj[5005]; int vis[5005]; int ans[5005]; int cnt[5005]; void dfs(int u){ cnt[u]=1; for(auto x:adj[u]){ if(vis[x])continue; vis[x]=1; dfs(x); cnt[u]+=cnt[x]; ans[u]+=ans[x]; } ans[u]+=cnt[u]; } int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n;cin>>n; for(int i=1;i<=n;i++){ int t;cin>>t; for(int i=1;i<=t;i++){ int x;cin>>x; adj[x].push_back(i); } } int rans=LLONG_MAX; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++)vis[j]=ans[j]=cnt[j]=0; vis[i]=1; dfs(i); if(cnt[i]==n)rans=min(rans,ans[i]); } cout<<rans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...