Submission #1018703

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018703		parsadox2	도시들 (IOI15_towns)	C++17	25 / 100	14 ms	1028 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;
	pair <int , int> D = make_pair(0 , 1);
	for(int i = 1 ; i < n ; i++)
	{
		dis[0][i] = dis[i][0] = getDistance(0 , i);
		if(dis[0][i] > dis[D.F][D.S])
			D = make_pair(0 , i);
	}
	for(int i = 0 ; i < n ; i++)  if(i != D.S)
	{
		dis[i][D.S] = dis[D.S][i] = getDistance(i , D.S);
		if(dis[i][D.S] > dis[D.F][D.S])
			D = make_pair(i , D.S);
	}
	int ans = dis[D.F][D.S];
	for(int x = 0 ; x < n ; x++)
	{
		dis[x][D.F] = dis[D.F][x] = getDistance(x , D.F);
		int r = (dis[x][D.F] + dis[x][D.S] - dis[D.F][D.S]) / 2;
		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: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39