제출 #777057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777057		OrazB	Bosses (BOI16_bosses)	C++17	0 / 100	2 ms	2644 KiB

bosses

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

vector<int> E[N];

void dfs(int nd, vector<ll>&vis, vector<ll>&sub, ll&sum){
	vis[nd] = sub[nd] = 1;
	set<int> s;
	for (auto i : E[nd]){
		if (!vis[i]){
			vis[i] = 1;
			s.insert(i);
		}
	}
	for (auto i : s){
		dfs(i, vis, sub, sum);
		sub[nd] += sub[i];
	}
	sum += sub[nd];
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++){
		int k;
		cin >> k;
		while(k--){
			int x;
			cin >> x;
			E[x].pb(i);
		}
	}
	ll mn = 1e18;
	for (int r = 1; r <= n; r++){
		ll sum = 0;
		vector<ll> vis(n+1, 0), sub(n+1, 0);
		dfs(r, vis, sub, sum);
		bool tr = 0;
		for (int j = 1; j <= n; j++) if (!vis[j]){tr=1;break;}
		if (!tr) mn = min(mn, sum);
	}
	cout << mn << '\n';
}	

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