Submission #383854

#	Time	Username	Problem	Language	Result	Execution time	Memory
383854		Leonardo_Paes	Towns (IOI15_towns)	C++17	25 / 100	20 ms	384 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
int hubDistance(int N, int sub){
	int n = N;
    if(sub >= 3) return -1;
    vector<int> dist_a(n), dist_b(n), dist_c(n);
    int a = 0, b, c;
    int maximum_dist = -1, ind = -1;
    for(int i=1; i<n; i++){
      dist_a[i] = getDistance(a, i);
      if(dist_a[i] > maximum_dist){
        maximum_dist = dist_a[i];
        ind = i;
      }
    }
    b = ind;
    maximum_dist = -1;
    for(int i=0;i<n;i++){
      dist_b[i] = getDistance(b, i);
      if(dist_b[i] > maximum_dist){
        maximum_dist = dist_b[i];
        ind = i;
      }
    }
    c = ind;
    for(int i=0;i<n;i++){
      dist_c[i] = getDistance(c,i);
    }
    int ans = 2000000000;
    for(int i=0; i<n; i++){
      int d1 = (dist_b[i] + dist_c[i] - maximum_dist) / 2;
      int t = max(dist_b[i] - d1, dist_c[i] - d1);
      ans = min(ans, t);
    }
    return ans;
}

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