제출 #39841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39841		MladenP	Bosses (BOI16_bosses)	C++14	100 / 100	683 ms	2312 KiB

bosses

#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define mid (l+r)/2
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 5010
vector<int> adj[MAXN];
lld dist[MAXN], n;
bool pos[MAXN];
queue<int> q;
lld BFS(int st) {
    for(int i = 1; i <= n; i++) pos[i] = 0;
    q.push(st);
    pos[st] = true; dist[st] = 1;
    while(!q.empty()) {
        int v = q.front(); q.pop();
        for(auto x : adj[v]) {
            if(!pos[x]) {
                dist[x] = dist[v] + 1; pos[x] = true;
                q.push(x);
            }
        }
    }
    lld rez = 0;
    for(int i = 1; i <= n; i++) {
        if(!pos[i]) return LINF;
        rez += dist[i];
    }
    return rez;
}

int main() {
    //ios::sync_with_stdio(false);cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++) {
        int k; cin >> k;
        for(int j = 1; j <= k; j++) {
            int x; cin >> x;
            adj[x].pb(i);
        }
    }
    lld rez = LINF;
    for(int i = 1; i <= n; i++) {
        rez = min(rez, BFS(i));
    }
    cout << rez;
    return 0;
}

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