제출 #1056887

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056887		jamesbamber	Split the Attractions (IOI19_split)	C++17	33 / 100	523 ms	1048576 KiB

split

#include "split.h"
#include <iostream>

using namespace std;

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> ids = {1, 2, 3};
	if(a > b) swap(a, b), swap(ids[0], ids[1]);
	if(b > c) swap(b, c), swap(ids[1], ids[2]);
	if(a > b) swap(a, b), swap(ids[0], ids[1]);

	vector<vector<int>> ad(n);
	for(int i=0; i<p.size(); i++){
		ad[p[i]].push_back(q[i]);
		ad[q[i]].push_back(p[i]);
	}


	vector<int> vis(n);
	auto dfs = [&](auto &&dfs, int v, int p, vector<int> &cc) -> void {
		cc.push_back(v);
		vis[v] = 1;
		for(int u: ad[v]){
			if(vis[u] or u == p) continue;
			dfs(dfs, u, v, cc);
		}
	};


	pair<int,int> split = {-1, -1};
	vector<int> sz(n);
	auto calc_sz = [&](auto &&calc_sz, int v, int p) -> void {
		sz[v] = 1;
		for(int u: ad[v]){
			if(u == p) continue;
			calc_sz(calc_sz, u, v);
			sz[v] += sz[u];
		}	
		if(sz[v] >= a and n - sz[v] >= b) split = {v, p};
		if(sz[v] >= b and n - sz[v] >= a) split = {p, v};
	};

	vector<int> ans(n, 0);

	if(a == 1){
		vector<int> order;
		dfs(dfs, 0, -1, order);
		for(int i=0; i<b; i++) ans[order[i]] = ids[1];
		for(int i=0; i<n; i++){
			if(ans[i] != 0) continue;
			if(a) ans[i] = ids[0], a--;
			else if(c) ans[i] = ids[2], c--;
		}
	}
	else{
		calc_sz(calc_sz, 0, -1);
		if(split.first == -1) return ans;
		vector<int> cca, ccb;
		dfs(dfs, split.first, split.second, cca);
		dfs(dfs, split.second, split.first, ccb);

		for(int i=0; i<a; i++) ans[cca[i]] = ids[0];
		for(int i=0; i<b; i++) ans[ccb[i]] = ids[1];
		for(int i=0; i<n; i++){
			if(ans[i] == 0) ans[i] = ids[2];
		}
	}

	return ans;
}

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:13:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for(int i=0; i<p.size(); i++){
      |               ~^~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 11 / 11
• Subtask 3: 22 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36