oj.uz

답안 #880763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880763 2023-11-30T03:07:10 Z irmuun Bosses (BOI16_bosses) C++17
100 / 100
 954 ms 1188 KB 
#include<bits/stdc++.h>

using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin>>n;
    vector<ll>adj[n+1];
    for(ll i=1;i<=n;i++){
        ll k;
        cin>>k;
        for(ll j=1;j<=k;j++){
            ll x;
            cin>>x;
            adj[x].pb(i);
        }
    }
    ll ans=1e18;
    vector<bool>used(n+1,0);
    ll tot[n+1];
    vector<ll>g[n+1];
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=n;j++){
            g[j].clear();
        }
        fill(all(used),0);
        queue<ll>q;
        q.push(i);
        used[i]=true;
        while(!q.empty()){
            ll x=q.front();
            q.pop();
            for(auto y:adj[x]){
                if(!used[y]){
                    used[y]=true;
                    g[x].pb(y);
                    q.push(y);
                }
            }
        }
        function <void(ll,ll)> dfs=[&](ll x,ll p){
            tot[x]=1;
            for(auto y:g[x]){
                if(y!=p){
                    dfs(y,x);
                    tot[x]+=tot[y];
                }
            }
        };
        dfs(i,0);
        ll cur=0;
        bool ok=true;
        for(ll i=1;i<=n;i++){
            cur+=tot[i];
            if(!used[i]){
                ok=false;
            }
        }
        if(ok) ans=min(ans,cur);
    }
    cout<<ans;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 288 ms 1188 KB Output is correct
15 Correct 63 ms 860 KB Output is correct
16 Correct 901 ms 1112 KB Output is correct
17 Correct 954 ms 1112 KB Output is correct
18 Correct 937 ms 1112 KB Output is correct