제출 #1087025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1087025		TrinhKhanhDung	Bosses (BOI16_bosses)	C++14	100 / 100	412 ms	856 KiB

bosses

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1007050321)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 5003;

int N;
vector<int> adj[MAX];
int d[MAX];

void bfs(int s){
    memset(d, 0x3f, (N + 3) * sizeof(int));
    d[s] = 1;
    queue<int> q; q.push(s);
    while(sz(q)){
        int u = q.front(); q.pop();
        for(int v: adj[u]){
            if(minimize(d[v], d[u] + 1)){
                q.push(v);
            }
        }
    }
}

void solve(){
    cin >> N;
    for(int i = 1; i <= N; i++){
        int K; cin >> K;
        while(K--){
            int x; cin >> x;
            adj[x].push_back(i);
        }
    }

    int ans = INF;
    for(int i = 1; i <= N; i++){
        bfs(i);
        int sum = 0;
        for(int j = 1; j <= N; j++) minimize(sum += d[j], INF);
        minimize(ans, sum);
    }
    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("numtable.inp","r",stdin);
//    freopen("numtable.out","w",stdout);

    solve();

    return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 45 / 45
• Subtask 3: 33 / 33