제출 #387357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
387357		alireza_kaviani	도시들 (IOI15_towns)	C++11	35 / 100	25 ms	876 KiB

towns

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

#define SZ(x)		int(x.size())
#define sep			' '

const int MAXN = 1e3 + 10;
const int MOD = 1e9 + 7;

int cnt , dist[4][MAXN];

int ask(int ind , int v , int n){
	int mx = 0;
	for(int i = 0 ; i < n ; i++){
		dist[ind][i] = getDistance(v , i); cnt--;
		if(dist[ind][i] > dist[ind][mx])	mx = i;
	}
	return mx;
}

int get(int v , int u){
	if(v == 0)	return dist[0][u];
	if(u == 0)	return dist[0][v];
	cnt--;
	assert(cnt >= 0);
	return getDistance(v , u);
}

int hubDistance(int N, int sub) {
	int v = ask(0 , 0 , N);
	int u = ask(1 , v , N);
	ask(2 , u , N);
	int mn = MOD; cnt = N * (N - 1) / 2;
	for(int i = 0 ; i < N ; i++){
		mn = min(mn , abs(dist[1][i] - dist[2][i]));
//		cout << i << sep << dist[1][i] << sep << dist[2][i] << endl; 
	}
//	cout << v << sep << u << endl;
	int xl = 0 , xr = 0 , yl = 0 , yr = 0;
	vector<int> v1 , v2;
	for(int i = 0 ; i < N ; i++){
		int val = dist[1][i] - dist[2][i];
		dist[3][i] = (dist[1][i] + dist[2][i] - dist[1][u]) / 2;
		if(val < -mn)	xl++;
		if(val == -mn)	yl++ , v1.push_back(i);
		if(val == mn)	yr++ , v2.push_back(i);
		if(val > mn)	xr++;
	}
	int R = (dist[1][u] + mn) / 2;
	if(xl <= N / 2 && yl <= N / 2 && xr + yr <= N / 2)	return R;
	if(xr <= N / 2 && yr <= N / 2 && xl + yl <= N / 2)	return R;
	if(sub == 1 || sub == 2 || sub == 4)	return -R;
	yl = yr = 0;
	for(int i = 0 ; i < SZ(v1) ; i++){
		int cur = 1;
		for(int j = 0 ; j < i ; j++){
			if(dist[3][v1[i]] + dist[3][v1[j]] > get(v1[i] , v1[j]))	cur++;
		}
		yl = max(yl , cur);
	}
	for(int i = 0 ; i < SZ(v2) ; i++){
		int cur = 1;
		for(int j = 0 ; j < i ; j++){
			if(dist[3][v2[i]] + dist[3][v2[j]] > get(v2[i] , v2[j]))	cur++;
		}
		yr = max(yr , cur);
	}
	//cout << xl << sep << yl << sep << xr << sep << yr << endl;
	if(xl <= N / 2 && yl <= N / 2 && xr + SZ(v2) <= N / 2)	return R;
	if(xr <= N / 2 && yr <= N / 2 && xl + SZ(v1) <= N / 2)	return R;
	return -R;
}

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