Submission #1018701

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018701		parsadox2	Towns (IOI15_towns)	C++17	13 / 100	22 ms	1112 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;

const int N = 1e2 + 20;
int n , dis[N][N];

int hubDistance(int nn , int sub) {
	n = nn;
	for(int i = 0 ; i < n ; i++)  for(int j = i + 1 ; j < n ; j++)
		dis[i][j] = dis[j][i] = getDistance(i , j);
	pair <int , int> D = make_pair(0 , 1);
	for(int i = 0 ; i < n ; i++)  for(int j = i + 1 ; j < n ; j++)  if(dis[i][j] > dis[D.F][D.S])
		D = make_pair(i , j);
	int ans = dis[D.F][D.S];
	//cout << D.F << " " << D.S << " " << dis[D.F][D.S] << endl;
	for(int x = 0 ; x < n ; x++)
	{
		int r = (dis[x][D.F] + dis[x][D.S] - dis[D.F][D.S]) / 2;
		//cout << x << " " << r << " " << dis[x][D.F] << " " << dis[x][D.S] << endl;
		ans = min(ans , max(dis[x][D.F] , dis[x][D.S]) - r);
	}
	return ans;
}

Compilation message (stderr)

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

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