Submission #1275752

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275752		beny	Bosses (BOI16_bosses)	C++20	100 / 100	419 ms	1556 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;

#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define ll long long
//#define smid (nl + nr) / 2
//#define lc id * 2
//#define rc id * 2 + 1
#define migmig std::ios_base::sync_with_stdio(false);std::cin.tie(NULL);std::cout.tie(NULL);
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const int N = 5005;
vector<int> adj[N];
int dis[N];
vector<int> vec[N];

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        int k; cin >> k;
        for (int j = 1; j <= k; j++) {
            int v; cin >> v;
            adj[v].push_back(i);
        }
    }

    ll ans = 1e18;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            dis[j] = -1;
            vec[j].clear();
        }
        dis[i] = 0;
        vec[0].push_back(i);
        queue<int> q; q.push(i);
        while (!q.empty()) {
            int v = q.front();
            q.pop();

            for (int u : adj[v]) {
                if (dis[u] == -1) {
                    dis[u] = dis[v] + 1;
                    q.push(u);
                    vec[dis[u]].push_back(u);
                }
            }
        }

        bool flag = 1;
        for (int j = 1; j <= n; j++) if (dis[j] == -1) flag = 0;
        if (!flag) continue;

        ll res = 0;
        ll sum = 0;
        for (int j = 0; j <= n; j++) {
            res += (n - sum);
            sum += vec[j].size();
        }

        ans = min(ans, res);
    }

    cout << ans;
}

int main() {
    migmig;

    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
}

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