제출 #16565

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16565		gs14004	도시들 (IOI15_towns)	C++14	0 / 100	23 ms	1348 KiB

towns

#include "towns.h"
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int,int> pi;

int dp[150][150];

int dist(int s, int e){
	if(s == e) return 0;
	if(s > e) swap(s,e);
	if(~dp[s][e]) return dp[s][e];
	return getDistance(s, e);
}

vector<pi> v;

int hubDistance(int N, int sub) {
	memset(dp,-1,sizeof(dp));
	int p = -1, val = -1, q = -1;
	for(int i=1; i<N; i++){
		if(val < dist(0, i)){
			val = dist(0, i);
			p = i;
		}
	}
	val = -1;
	for(int i=0; i<N; i++){
		if(val < dist(p, i)){
			val = dist(p, i);
			q = i;
		}
	}
	for(int i=0; i<N; i++){
		int fl = dist(p, i) - dist(q, i) + val;
		v.push_back(pi(fl / 2, i));
	}
	sort(v.begin(), v.end());
	int R = val;
	for(auto &i : v){
		R = min(R, max(val - i.first, i.first));
	}
	return R;
}

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