제출 #587542

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
587542		benson1029	도시들 (IOI15_towns)	C++14	25 / 100	20 ms	352 KiB

towns

#include "towns.h"
#include<bits/stdc++.h>
using namespace std;

int dis0[200], disX[200], disY[200];

int hubDistance(int N, int sub) {
	int X = 1;
	for(int i=1; i<N; i++) {
		dis0[i] = getDistance(0, i);
		if(dis0[i] > dis0[X]) {
			X = i;
		}
	}
	int Y = 0;
	for(int i=0; i<N; i++) {
		if(i==X) continue;
		disX[i] = getDistance(X, i);
		if(disX[i] > disX[Y]) {
			Y = i;
		}
	}
	// diameter: X to Y
	for(int i=0; i<N; i++) {
		if(i==Y) continue;
		disY[i] = getDistance(Y, i);
	}
	int ans = 1e9;
	int C = 0;
	for(int i=0; i<N; i++) {
		if(i==X || i==Y) continue;
		int sum = (disX[Y] + disX[i] + disY[i]) / 2;
		int tmp = max(sum - disX[i], sum - disY[i]);
		if(tmp < ans) {
			C = i;
			ans = tmp;
		}
	}
	if(sub==4) {
		int compX = 1, compY = 1, oth = N - 2;
		for(int i=0; i<N; i++) {
			if(i==X || i==Y) continue;
			int sum = (disX[Y] + disX[i] + disY[i]) / 2;
			if(sum - disY[i] < sum - disY[C]) {
				compX++;
				oth--;
			} else if(sum - disX[i] < sum - disX[C]) {
				compY++;
				oth--;
			}
		}
		if(compX <= N/2 && compY <= N/2 && oth <= N/2) return ans;
		else return -ans;
	}
	return ans;
}

• Subtask 1: 13 / 13
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39