제출 #855199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855199		NK_	Bosses (BOI16_bosses)	C++17	100 / 100	471 ms	852 KiB

bosses

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
 
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 18;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N; cin >> N;
	V<vi> adj(N); for(int i = 0; i < N; i++) {
		int k; cin >> k;
		while(k--) {
			int x; cin >> x; --x;
			adj[x].pb(i);
		}
	}

	auto bfs = [&](int r) {

		vi dst(N, MOD), vis(N); dst[r] = 0;
		queue<int> q; q.push(r);

		while(sz(q)) {
			int u = q.front(); q.pop();

			if (vis[u]) continue;
			vis[u] = 1;

			for(auto& v : adj[u]) {
				if (dst[v] > dst[u]+1) {
					dst[v] = dst[u] + 1;
					q.push(v);
				}
			}
		}

		int ans = 0;
		for(int u = 0; u < N; u++) {
			ans += dst[u] + 1;
			ans = min(ans, MOD);
		}

		return ans;
	};

	int ans = MOD;
	for(int i = 0; i < N; i++) ans = min(ans, bfs(i));
	cout << ans << nl;

	exit(0-0);
} 	 

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