제출 #436004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436004		blue	열쇠 (IOI21_keys)	C++17	37 / 100	2561 ms	29192 KiB

keys

#include <vector>
#include "keys.h"
#include <queue>
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 = u.size();

	vector<int> reach_count(N, 0);

	vector<int> edge[N];
	vector<int> col[N];

	for(int j = 0; j < M; j++)
	{
		edge[ u[j] ].push_back( v[j] );
		col[ u[j] ].push_back( c[j] );

		edge[ v[j] ].push_back( u[j] );
		col[ v[j] ].push_back( c[j] );
	}


	for(int src = 0; src < N; src++)
	{
		vector<int> acquired(N, 0);

		vector<int> illegal_edges[N]; //by color

		vector<int> visit(N, 0);

		queue<int> tbv;
		tbv.push(src);

		while(!tbv.empty())
		{
			int x = tbv.front();
			tbv.pop();

			if(visit[x]) continue;

			visit[x] = 1;

			acquired[ r[x] ] = 1;
			for(int f: illegal_edges[ r[x] ])
				tbv.push(f);
			illegal_edges[ r[x] ].clear();

			for(int e = 0; e < edge[x].size(); e++)
			{
				int y = edge[x][e];
				int z = col[x][e];

				if(acquired[z]) tbv.push(y);
				else illegal_edges[z].push_back(y);
			}
		}

		for(int i = 0; i < N; i++) reach_count[src] += visit[i];
	}

	vector<int> res_list;
	int min_count = 1e9;
	for(int i = 0; i < N; i++)
	{
		if(reach_count[i] == min_count) res_list.push_back(i);
		else if(reach_count[i] < min_count)
		{
			min_count = reach_count[i];
			res_list.clear();
			res_list.push_back(i);
		}
	}

	vector<int> res(N, 0);
	for(int r1: res_list) res[r1] = 1;

	return res;
}

컴파일 시 표준 에러 (stderr) 메시지

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:51:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    for(int e = 0; e < edge[x].size(); e++)
      |                   ~~^~~~~~~~~~~~~~~~

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