제출 #119755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119755		WhipppedCream	도시들 (IOI15_towns)	C++17	0 / 100	17 ms	512 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 dist0[maxn];
int distu[maxn];
int add[maxn], bran[maxn];

map<int, int> cnt;
map<int, int> faker;

int hubDistance(int N, int sub)
{
	cnt.clear();
	faker.clear();
	if(sub > 2 && sub != 4) return 0;
	n = N;
	int best = 0, dat = -1;
	for(int i = 1; i< N; i++)
	{
		dist0[i] = getDistance(0, i);
		if(dist0[i]> best)
		{
			best = dist0[i];
			dat = i;
		}
	}
	int U = dat;
	best = 0; dat = -1;
	for(int i = 0; i< N; i++)
	{
		if(i == U || i == 0) continue;
		distu[i] = getDistance(U, i);
		if(distu[i]> best)
		{
			best = distu[i];
			dat = i;
		}
	}
	int diam = best;
	int V = dat;
	// printf("(%d->%d) %d\n", U, V, dist[V]);
	for(int i = 0; i< N; i++)
	{
		if(i == U || i == 0) continue;
		int br = dist0[i]+distu[i]-dist0[U];
		br /= 2;
		int pos = dist0[i]-br;
		add[i] = pos;
		bran[i] = br;
		cnt[pos]++;
		faker[pos] = max(faker[pos], br);
	}
	int rad = 1e9;
	int cm = 1;
	bool good = false;
	for(auto kk : faker)
	{
		int x = kk.X, y = kk.Y;
		// printf("%d: %d\n", x, cnt[x]);
		if(x< add[V]) continue;
		rad = min(rad, max(y, max(add[x]-add[V]+bran[V], dist0[U]-add[x])));
	}
	for(auto kk : cnt)
	{
		int x = kk.X, y = kk.Y;
		if(max(add[x]-add[V]+bran[V], dist0[U]-add[x]) == rad)
		{		
			if(max(cm, max(cnt[x], n-cnt[x]-cm))<= n/2) good = true;
		}
		cm += cnt[x];
	}
	return good?rad:-rad;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:77:17: warning: unused variable 'y' [-Wunused-variable]
   int x = kk.X, y = kk.Y;
                 ^
towns.cpp:51:6: warning: unused variable 'diam' [-Wunused-variable]
  int diam = best;
      ^~~~

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