제출 #1185934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185934		trvhung	Bosses (BOI16_bosses)	C++20	100 / 100	744 ms	1016 KiB

bosses

#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>

// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;

// #define   ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define            ll long long
#define           ull unsigned long long
#define            ld long double
#define            pb push_back
#define  bit(mask, i) ((mask >> i) & 1)
#define            el '\n'
#define             F first
#define             S second

template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};

const int maxn = 5e3 + 5;
int n, s[maxn];
vector<int> adj[maxn], g[maxn];
bool vis[maxn];

void calcS(int u) {
	int sum = 0;
	for (int v: g[u]) {
		calcS(v);
		sum += s[v];
	}
	s[u] = sum + 1;
}

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

	int res = INF;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j)
			vis[j] = false, g[j].clear(), s[i] = 0;

		queue<int> q; q.push(i); vis[i] = true;
		while (!q.empty()) {
			int u = q.front(); q.pop();

			for (int v: adj[u])
				if (!vis[v]) {
					vis[v] = true;
					g[u].push_back(v);
					q.push(v);
				}
		}

		bool check = true;
		for (int j = 1; j <= n; ++j)
			check &= vis[j];

		if (!check) continue;

		calcS(i); int sum = 0;
		for (int j = 1; j <= n; ++j)
			sum += s[j];

		minimize(res, sum);
	}

	cout << res;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    if (!MULTI) solve();
    else {
        int test; cin >> test;
        while (test--) solve();
    }
    
    return 0;
}

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