Submission #1080020

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080020		Trumling	Towns (IOI15_towns)	C++14	13 / 100	14 ms	928 KiB

towns

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

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 9999999999999
typedef long long ll;

int hubDistance(int N, int sub) {
	ll n=N;
	vector<vector<ll>>g(N,vector<ll>(N));

	ll maxi=-1;
	pair<ll,ll>curr;
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
		{
			ll R=getDistance(i,j);
			g[i][j]=R;
			g[j][i]=R;

			if(maxi<R)
				{
					maxi=g[i][j];
					curr={i,j};
				}
		}

	ll ans=INF;
	for(int i=0;i<n;i++)
		if(i!=curr.F && i!=curr.S)
		{
			ll f=(g[i][curr.F] + g[i][curr.S] - maxi)/2;
			ans=min(ans,max(g[i][curr.F]-f,g[i][curr.S]-f));

		}
	return ans;
}

Compilation message (stderr)

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:40:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   40 |  return ans;
      |         ^~~
towns.cpp:12:28: warning: unused parameter 'sub' [-Wunused-parameter]
   12 | int hubDistance(int N, 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