oj.uz

Submission #640311

# Submission time Handle Problem Language Result Execution time Memory
640311 2022-09-14T08:08:36 Z ggoh Towns (IOI15_towns) C++14
100 / 100
 22 ms 940 KB 
#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
#define sz(v) ((int)(v).size())
typedef long long lint;
typedef pair<int,int>pii;

int dis[111][111];
int ch,n,maxi,maxj,maxx;
struct tri{
	int a,b,c;
};
bool cmp(tri A, tri B){return A.a<B.a;}
vector<tri>X;
vector<int>V[111],D[111];
int H[111];
void f(int r)
{
	if(ch==1)return ;
	int cnt0=1,cnt1=1,cnt2=0;
	for(auto &k:X)
	{
		if(k.a==r)cnt2++;
		else if(k.a<r)cnt0++;
		else cnt1++;
	}
	if(cnt0>n/2 || cnt1>n/2)return  ;
	if(cnt2<=n/2)
	{
		ch=1;
		return ;
	}
	vector<pii>C;
	for(auto &k:X)
	{
		 if(k.a==r)C.push_back({k.b,k.c});
		 else if(k.a<r)C.push_back({r-k.a+k.b,k.c});
		 else C.push_back({k.a-r+k.b,k.c});
	}
	C.push_back({r,maxi});
	C.push_back({maxx-r,maxj});
	int siz=1;
	for(int i=1;i<=n;i++)
	{
		V[i].clear();
		D[i].clear();
	}
	for(auto &k:C)H[k.second]=k.first;
	for(int i=0;i<n;i++)
	{
		if(V[siz].empty())V[siz].push_back(i);
		else
		{
			if(!dis[V[siz][0]][i])dis[V[siz][0]][i]=dis[i][V[siz][0]]=getDistance(V[siz][0],i);
			if(dis[V[siz][0]][i]==H[V[siz][0]]+H[i])D[siz].push_back(i);
			else V[siz].push_back(i);
			if(sz(V[siz])==sz(D[siz]))
			{
				siz++;
			}
		}
	}
	if(V[siz].empty())siz--;
	int o=0;
	int candi=V[siz][0];
	o+=sz(V[siz]);
	for(int j=1;j<siz;j++)
	{
		if(!dis[V[j][0]][candi])dis[V[j][0]][candi]=dis[candi][V[j][0]]=getDistance(V[j][0],candi);
		if(dis[V[j][0]][candi]==H[V[j][0]]+H[candi])
		{
			for(auto &k:D[j])
			{
				if(!dis[k][candi])dis[k][candi]=dis[candi][k]=getDistance(k,candi);
				if(dis[k][candi]!=H[k]+H[candi])o++;
			}
		}
		else
		{
			o+=sz(V[j]);
		}
	}
	if(o<=n/2)ch=1;
}
int hubDistance(int N, int sub) {
	int R=1e9;
	maxi=-1,maxj=-1,maxx=-1;
	n=N;
	memset(dis,0,sizeof(dis));
	for(int i=1;i<N;i++)
	{
		dis[0][i]=dis[i][0]=getDistance(0,i);
		if(dis[0][i]>maxx)
		{
			maxx=dis[0][i];
			maxi=i;
		}
	}
	maxx=-1;
	for(int i=0;i<N;i++)
	{
		if(i!=maxi)
		{
			if(!dis[maxi][i])dis[maxi][i]=dis[i][maxi]=getDistance(i,maxi);
			if(dis[maxi][i]>maxx)
			{
				maxx=dis[maxi][i];
				maxj=i;
			}
		}
	}
	X.clear();
	for(int i=0;i<N;i++)
	{
		if(i!=maxi && i!=maxj)
		{
			if(!dis[maxj][i])
			{
				int ti=(dis[maxi][0]-dis[maxj][0]+maxx)/2;
				int tj=maxx-ti;
				int t=(dis[maxi][i]-dis[0][i]+dis[maxi][0])/2;
				if(t<ti)dis[maxj][i]=dis[maxi][i]+maxx-2*t;
				else dis[maxj][i]=dis[maxi][i]-ti+tj;
				dis[i][maxj]=dis[maxj][i];
			}
			X.push_back({(dis[maxi][i]-dis[maxj][i]+maxx)/2,(dis[maxi][i]+dis[maxj][i]-maxx)/2,i});
		}
	}
	sort(X.begin(),X.end(),cmp);
	for(auto &k:X)
	{
		R=min(R,max(maxx-k.a,k.a));
	}
	ch=-1;
	f(R);
	if(R!=maxx-R)f(maxx-R);

	return ch*R;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:85:28: warning: unused parameter 'sub' [-Wunused-parameter]
   85 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct
2 Correct 14 ms 412 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 14 ms 404 KB Output is correct
5 Correct 13 ms 408 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 412 KB Output is correct
2 Correct 12 ms 340 KB Output is correct
3 Correct 13 ms 340 KB Output is correct
4 Correct 12 ms 340 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 340 KB Output is correct
2 Correct 15 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 13 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 400 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 408 KB Output is correct
2 Correct 13 ms 412 KB Output is correct
3 Correct 14 ms 392 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 412 KB Output is correct
2 Correct 22 ms 912 KB Output is correct
3 Correct 22 ms 940 KB Output is correct