제출 #1209266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1209266		bangan	Keys (IOI21_keys)	C++20	9 / 100	46 ms	8264 KiB

keys

#include <bits/stdc++.h>

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u_in, std::vector<int> v_in, std::vector<int> c) {
	int n = r.size();
	int m = u_in.size();

	{
		int max = *std::max_element(c.begin(), c.end());
		assert(max == 0);
	}

	std::vector<std::vector<int>> adj(n);
	for (int i = 0; i < m; i++) {
		adj[u_in[i]].push_back(v_in[i]);
		adj[v_in[i]].push_back(u_in[i]);
	}

	std::vector<bool> vis(n);
	auto dfs = [&](auto self, int v) -> void {
		vis[v] = true;
		for (int u : adj[v]) {
			if (!vis[u]) {
				self(self, u);
			}
		}
	};

	std::vector<int> reach(n);
	for (int i = 0; i < n; i++) {
		if (r[i] == 0) {
			fill(vis.begin(), vis.end(), false);
			dfs(dfs, i);
			reach[i] = std::count(vis.begin(), vis.end(), true);
		} else {
			reach[i] = 1;
		}
	}

	std::vector<int> ans(n);
	for (int i = 0; i < n; i++) {
		if (reach[i] == *std::min_element(reach.begin(), reach.end())) {
			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