# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066405 | boris_7 | Bosses (BOI16_bosses) | C++17 | 0 ms | 348 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;
using ll = long long;
vector<vector<ll>>gp;
vector<ll>vis;
vector<ll> sub;
ll ans = LLONG_MAX,cnt=0,comp=0;
void dfs(ll u){
vis[u]=1;
for(ll &i:gp[u]){
if(!vis[i]){
dfs(i);
sub[u]+=sub[i];
}
}
cnt+=sub[u];
comp++;
if(comp==gp.size()){
ans = min(ans,cnt);
}
}
void solve(){
ll n;
cin>>n;
gp = vector<vector<ll>>(n);
for(ll i =0;i<n;i++){
ll x;
cin>>x;
while(x--){
ll v;
cin>>v;
gp[--v].push_back(i);
}
}
for(ll i = 0;i<n;i++){
vis = vector<ll>(n);
sub = vector<ll>(n,1);
cnt = 0,comp=0;
dfs(i);
}
cout<<ans<<endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
// ll t;cin>>t;while(t--)
solve();
}
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... |