제출 #1028412

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

towns

#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)a.size()
using ar2 = array<int,2>;
const int mxN = 115;
int n, mem[mxN][mxN];
map<int,int> M;
map<int,set<int>> cnt;
 
int dis(int a, int b){
	if(a==b) return 0;
	if(mem[a][b]!=-1) return mem[a][b];
	if(mem[b][a]!=-1) return mem[b][a];
	return mem[a][b]=mem[b][a]=getDistance(a,b);
}
 
int p[mxN], sz[mxN];
int findSet(int i) { return p[i]==i?i:p[i]=findSet(p[i]); }
bool isSameSet(int i, int j) { return findSet(i)==findSet(j); }
 
void unionSet(int i, int j){
	int x = findSet(i), y = findSet(j);
	if(x==y) return;
	if(sz[x]<sz[y]) swap(x,y);
	p[y]=x; sz[x]+=sz[y];
}

int a, b, diameter; 

int getD(int i, int pos){
	if(cnt[pos].count(i))
		return dis(a,i)-(dis(0,a)-pos);
	return dis(0,i)-pos;
}

bool same(int i, int j, int hubpos){
	int i_u = getD(i,hubpos);
	int u_j = getD(j,hubpos);
	return i_u+u_j != dis(i,j);
}

int hubDistance(int N, int sub) {
	n = N; ar2 mx = {0,0}; 
	M.clear(); cnt.clear();
	memset(mem,-1,sizeof(mem));
	for(int i = 0; i < n; i++) 
		mx=max(mx,{dis(0,i),i});
	a = mx[1]; mx = {0,0};
	for(int i = 0; i < n; i++)
		mx=max(mx,{dis(a,i),i});
	b = mx[1]; diameter = mx[0];
	int ans = diameter;
	
	for(int i = 0; i < n; i++){
		int i_0 = (dis(0,i)+dis(0,a)-dis(a,i))/2;
		int lpos = dis(0,a) - i_0; 
		int rpos = diameter-lpos;
		M[i_0] = max(lpos, rpos);
		cnt[i_0].insert(i);
	}
	for(auto u : M) ans=min(ans, u.second);
	if(sub<=2) return ans;
	
	int tot = 0;
	for(auto u : M){
		int pos = u.first, mx_dis = u.second;
		tot+=sz(cnt[pos]);
		if(mx_dis!=ans) continue;
		if(tot-sz(cnt[pos]) > n/2) continue;
		//if(n-tot > n/2) continue;
		for(int i = 0; i < n; i++) p[i]=i, sz[i]=1;
		/*stack<int> S = stack<int>();
		for(int i = 0; i < n; i++){
			if(sz(S) > n-i) break;
			if(!sz(S) or same(S.top(),i,pos)) 
				unionSet(i,S.top()), S.push(i);
			else S.pop();
		}
		if(!sz(S)) continue;
		int i = S.top(); */
		for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++) 
			if(same(i,j,pos)) unionSet(i,j);
		bool ok = 1;
		for(int i = 0; i < n; i++) 
			ok&=(sz[findSet(i)]<=n/2);
		if(ok) return ans;
	}
	return -ans;
}

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