Submission #587542

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
587542	2022-07-02 05:15:53	benson1029	Towns (IOI15_towns)	C++14	25 / 100	20 ms	352 KiB

towns

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
int dis0[200], disX[200], disY[200];
int hubDistance(int N, int sub) {
  int X = 1;
  for(int i=1; i<N; i++) {
    dis0[i] = getDistance(0, i);
    if(dis0[i] > dis0[X]) {
      X = i;
    }
  }
  int Y = 0;
  for(int i=0; i<N; i++) {
    if(i==X) continue;
    disX[i] = getDistance(X, i);
    if(disX[i] > disX[Y]) {
      Y = i;
    }
  }
  // diameter: X to Y
  for(int i=0; i<N; i++) {
    if(i==Y) continue;
    disY[i] = getDistance(Y, i);
  }
  int ans = 1e9;
  int C = 0;
  for(int i=0; i<N; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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