제출 #817028

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
817028		aVe	열쇠 (IOI21_keys)	C++17	9 / 100	3072 ms	451328 KiB

keys

#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int n, m;
vector<pii> G[100100];
vi find_reachable(vi r, vi u, vi v, vi c) {
	n = (int)r.size();
	m = (int)c.size();
	vi reach(n, 0);
	for(int i = 0; i < (int)u.size(); i++){
		G[u[i]].pb(mp(v[i], c[i]));
		G[v[i]].pb(mp(u[i], c[i]));
	}
	for(int room = 0; room < n; room++){
		queue<pair<int, vector<bool>>> q;
		vector<bool> ini(n, false);
		bool vis[n];
		memset(vis, false, sizeof vis);
		vis[room] = true;
		ini[r[room]] = true;
		q.push(mp(room, ini));
		while(!q.empty()){
			int at = q.front().first;
			vector<bool> ava = q.front().second;
			if(!ava[r[at]])	ava[r[at]] = true;
			q.pop();
			for(auto next : G[at]){
				if(ava[next.second] && !vis[next.first]){
					vis[next.first] = true;
					q.push(mp(next.first, ava));
				}
			}
		}
		int cnt = 0;
		for(int i  = 0; i < n; i++){
			if(vis[i])	cnt++;
		}
		reach[room] = cnt;
	}
	int sm = *min_element(reach.begin(), reach.end());
	vi ans(n, 0);
	for(int i = 0; i < n; i++){
		if(reach[i] == sm)
			ans[i] = 1;
	}
	return ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 11
• Subtask 3: 0 / 17
• Subtask 4: 0 / 30
• Subtask 5: 0 / 33