제출 #1233515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1233515		Timosh	Keys (IOI21_keys)	C++20	0 / 100	0 ms	328 KiB

keys

#include <bits/stdc++.h>

using namespace std;

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c)
{
	int n = r.size();
	int m = c.size();
	int mn = n + 1;
	vector<int> ans(n);
	vector<vector<pair<int, int>>> g(n);
	for (int i = 0; i < m; i++)
		g[u[i]].push_back({v[i], c[i]}), g[v[i]].push_back({u[i], c[i]});
	for (int i = 0; i < n; i++)
	{
		vector<int> vis(n), colvis(n);
		vector<vector<int>> col(n);
		for (auto &x : g[i])
			col[x.second].push_back(x.first);
		queue<int> q;
		for (auto &x : g[i])
			if (x.second == r[i])
				q.push(x.first);
		while (!q.empty())
		{
			int x = q.front();
			q.pop();
			if (vis[x])
				continue;
			vis[x] = 1;
			for (auto &y : g[x])
				col[y.second].push_back(y.first);
			if (colvis[r[x]])
				continue;
			colvis[r[x]] = 1;
			for (auto &y : col[r[x]])
				q.push(y);
		}
		for (auto &j : vis)
			ans[i] += j;
	}
	mn=*min_element(ans.begin(), ans.end());
	for (int i = 0; i < n; i++)
		ans[i] = mn == ans[i];
	return ans;
}

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