제출 #119656

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119656		WhipppedCream	도시들 (IOI15_towns)	C++17	0 / 100	18 ms	1024 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;

const int maxn = 120;

int m, n;

int dist[maxn];

map<int, int> faker;

int hubDistance(int N, int sub)
{
	if(sub > 1) return 0;
	n = N;
	int best = 0, dat = -1;
	for(int i = 1; i< N; i++)
	{
		int here = getDistance(0, i);
		if(here> best)
		{
			best = here;
			dat = i;
		}
	}
	int U = dat;
	best = 0; dat = -1;
	for(int i = 0; i< N; i++)
	{
		if(i == U) continue;
		dist[i] = getDistance(U, i);
		if(dist[i]> best)
		{
			best = dist[i];
			dat = i;
		}
	}
	int V = dat;
	printf("(%d->%d) %d\n", U, V, dist[V]);
	for(int i = 0; i< N; i++)
	{
		if(i == U || i == V) continue;
		int br = dist[i]+getDistance(V, i)-dist[V];
		br /= 2;
		int run = dist[i]-br;
		faker[run] = max(faker[run], br);
	}
	int rad = 1e9;
	for(auto kk : faker)
	{
		int x = kk.X, y = kk.Y;
		// printf("%d\n", max(y, max(x, dist[V]-x)));
		rad = min(rad, max(y, max(x, dist[V]-x)));
	}
	return rad;
}

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