제출 #484692

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484692		tranxuanbach	Bosses (BOI16_bosses)	C++17	100 / 100	787 ms	868 KiB

bosses

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using vi = vector <int>;
using vpii = vector <pii>;
using vvi = vector <vi>;

const int N = 5e3 + 5;

int n;
vi par[N];

vi adj[N];
int dist[N];
int ans = INT_MAX;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("KEK.inp", "r", stdin);
    // freopen("KEK.out", "w", stdout);
    cin >> n;
    ForE(i, 1, n){
        int k; cin >> k;
        while (k--){
            int x; cin >> x;
            par[i].emplace_back(x);
            adj[x].emplace_back(i);
        }
    }
    ForE(i, 1, n){
        queue <int> qu;
        memset(dist, -1, sizeof(dist));
        dist[i] = 1; qu.emplace(i);
        while (!qu.empty()){
            int u = qu.front(); qu.pop();
            Fora(v, adj[u]){
                if (dist[v] == -1){
                    dist[v] = dist[u] + 1;
                    qu.emplace(v);
                }
            }
        }
        int tans = 0;
        ForE(j, 1, n){
            if (dist[j] == -1){
                tans = INT_MAX;
                break;
            }
            tans += dist[j];
        }
        ans = min(ans, tans);
    }
    cout << ans << endl;
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

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