Submission #1129752

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129752		belgianbot	Bosses (BOI16_bosses)	C++20	67 / 100	1595 ms	824 KiB

bosses

/*
    AUTHOR : BELGIANBOT
*/

#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;

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define pb push_back
#define fi first
#define se second
#define ordered_set tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sz(x) (int)(x.size())
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";
#define No cout << "No\n";
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define int long long
#define double long double


const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;

void solve();

signed main() {
   ios::sync_with_stdio(false);
   cin.tie(0);
   int t = 1;
   //cin >> t;
   while (t--) solve();
   return 0;
}

void solve() {
    int n; cin >> n;
    vector<vector<int>> adj(n);

    for (int i = 0; i < n; i++) {
        int k; cin >> k;
        for (int j = 0; j < k; j++) {
            int a; cin >> a; a--;
            adj[a].pb(i);
        }
    }

    int ans = inf;

    for (int i = 0; i < n; i++) {
        vector<int> dist(n, inf); dist[i] = 1;
        priority_queue<pair<int,int>> q; q.push({-1, i});
        vector<bool> processed(n, false);

        while (!q.empty()) {
            auto [u,v] = q.top(); q.pop();
            if (processed[v]) continue;
            processed[v] = true;

            for (int x : adj[v]) {
                if (dist[x] > dist[v] + 1) {
                    dist[x] = dist[v] + 1;
                    q.push({-dist[x], x});
                }
            }
        }
        int res = 0;
        for (int x : dist) {
            if (x == inf) res = inf;
            else res += x;
        }
        cmin(ans, res);
    }
    cout << ans << '\n';
}

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