제출 #784295

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

towns

#include<bits/stdc++.h>
#include "towns.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int hubDistance(int n,int subtsk)
{
	if(subtsk==1||subtsk==2||subtsk<=10)
	{
		int dis[115][115]={0};
		int Max=0,id=-1;
		rep1(i,n-1)
		{
			int x=getDistance(0,i);
			dis[0][i]=dis[i][0]=x;
			if(x>Max){Max=x,id=i;}
		}
		int mx=0,r=0;
		rep(i,n)
		{
			if(i==id){continue;}
			if(dis[id][i])
			{
				if(dis[id][i]>mx){mx=dis[id][i],r=i;}
				continue;
			}
			int v=getDistance(id,i);dis[id][i]=dis[i][id]=v;
			if(v>mx)
			{
				mx=v;
				r=i;
			}
		}
		int res=(1<<30);
		rep(i,n)
		{
			if(i==id||i==r){continue;}
			int fi=dis[i][id],se=dis[i][r];
			if(!fi){fi=getDistance(i,id);dis[i][id]=dis[id][i]=fi;}
			if(!se){se=getDistance(i,r);dis[i][r]=dis[r][i]=fi;}
			if((fi+se-mx)&1){continue;}
			int inter=(fi+se-mx)/2;
			int L=fi-inter,R=se-inter;
			res=min(res,max(L,R));
		}
		if(subtsk>=3)
		{
			return -res;
		}
		return res;
	}
	return 0;
}

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