Submission #1036585

#	Time	Username	Problem	Language	Result	Execution time	Memory
1036585		vjudge1	Towns (IOI15_towns)	C++17	0 / 100	9 ms	1116 KiB

towns

#include "towns.h"

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

int n;

int dist[200][200];

int query(int i,int j){
	if(j<i)swap(i,j);
	if(!dist[i][j])dist[i][j]=getDistance(i,j);
	return dist[i][j];
}

int hubDistance(int N, int sub) {
	n=N;
	int past=-1,point1=-1;
	for(int i=1;i<n;i++){
		if(past<query(0,i)){
			point1=i;
			past=query(0,i);
		}
	}
	past=-1;
	int point2=-1;
	for(int i=0;i<n;i++){
		if(i==point1)continue;
		if(past<query(point1,i)){
			point2=i;
			past=query(point1,i);
		}
	}
	int ds=query(point1,point2);
	int ans=1e9;
	for(int i=0;i<n;i++){
		if(i==point1||i==point2)continue;
		int tem=(query(point1,i)+query(point2,i)-ds)/2;
		int val1=query(point1,i)-tem;
		int val2=query(point2,i)-tem;
		ans=min(ans,max({tem,val1,val2}));
	}
	return ans;
}

Compilation message (stderr)

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

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