제출 #615936

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
615936		Lucpp	도시들 (IOI15_towns)	C++17	25 / 100	15 ms	1092 KiB

towns

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

int hubDistance(int n, int sub) {
	sub--; // suppress unused warning
	vector<int> d0(n), du(n), dv(n);
	for(int i = 1; i < n; i++) d0[i] = getDistance(0, i);
	int u = int(max_element(d0.begin(), d0.end())-d0.begin());
	for(int i = 0; i < n; i++) du[i] = getDistance(u, i);
	int v = int(max_element(du.begin(), du.end())-du.begin());
	for(int i = 0; i < n; i++) dv[i] = getDistance(v, i);
	int dia = du[v];
	int maxB = 0, maxC = 0;
	for(int i = 0; i < n; i++){
		int b = (dia+du[i]-dv[i])/2;
		int c = dia-b;
		if(b <= dia/2) maxB = max(maxB, b);
		if(c <= dia/2) maxC = max(maxC, c);
	}
	int R = min(dia-maxB, dia-maxC);
	return R;
}

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