제출 #404077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
404077		SavicS	Bosses (BOI16_bosses)	C++14	100 / 100	781 ms	672 KiB

bosses

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

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 5005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;

vector<int> g[maxn];

bool used[maxn];
int d[maxn];
int bfs(int s){
	ff(i,1,n)d[i] = used[i] = 0;
	queue<int> q;

	used[s] = 1;
	q.push(s);
	while(!q.empty()){
		int v = q.front(); q.pop();
		for(auto u : g[v]){
			if(!used[u]){
				used[u] = 1;
				d[u] = d[v] + 1;
				q.push(u);	
			}
		}
	}	
	
	bool ok = 1;
	ff(i,1,n)ok &= used[i];
	if(!ok)return inf;
	
	int ans = n;
	ff(i,1,n)ans += d[i];
	return ans;
	
}

int main()
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
	cin >> n;
	ff(i,1,n){
		int K;
		cin >> K;
		ff(j,1,K){
			int X;
			cin >> X;
			g[X].pb(i);
		}
	}
	
	int rez = inf;
	ff(i,1,n)rez = min(rez, bfs(i));
	cout << rez << endl;	
	
    return 0;
}
/**

4
1 4
3 1 3 4
2 1 2
1 3

// probati bojenje sahovski ili slicno

**/

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