Submission #1206275

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206275		Aviansh	Towns (IOI15_towns)	C++20	13 / 100	488 ms	504 KiB

towns

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

using namespace std;

int hubDistance(int n, int sub) {
	//int R = getDistance(0,1);
	int dist[n][n];
	for(int i = 0;i<n;i++){
        fill(dist[i],dist[i]+n,0);
	}
	for(int i = 0;i<n;i++){
        for(int j = i+1;j<n;j++){
            dist[i][j]=dist[j][i]=getDistance(i,j);
        }
	}
	int ans = 2e9;
    for(int i = 0;i<n;i++){
        for(int j = i+1;j<n;j++){
            for(int k = j+1;k<n;k++){
                int dists[n];
                int a = ((dist[i][j]+dist[j][k]+dist[i][k])/2)-dist[j][k];
                int b = ((dist[i][j]+dist[j][k]+dist[i][k])/2)-dist[i][k];
                int c = ((dist[i][j]+dist[j][k]+dist[i][k])/2)-dist[i][j];
                for(int l = 0;l<n;l++){
                    dists[l]=max({dist[i][l]-a,dist[j][l]-b,dist[k][l]-c});
                }
                ans=min(ans,*max_element(dists,dists+n));
            }
        }
    }
	return ans;
}

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