Submission #1122709

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1122709	2024-11-30 23:32:54	gustavo_d	Towns (IOI15_towns)	C++17	0 / 100	1 ms	324 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;
const int MAXN = 111;
int cache[MAXN][MAXN];
int dist(int a, int b) {
  if (a > b) swap(a, b);
  if (a == b) return 0;
  // if (cache[a][b] != -1) return cache[a][b];
  return cache[a][b] = getDistance(a, b);
}
int hubDistance(int n, int sub) {
  for (int i=0; i<n; i++) {
    for (int j=0; j<n; j++) {
      cache[i][j] = -1;
    }
  }
  int r = 1e9;
  if (sub == 1 or true) {
    for (int i=0; i<n; i++) {
      for (int j=i+1; j<n; j++) {
        cerr << endl << endl;
        cerr << "Olhando: " << i << ' ' << j << endl;
        map<pair<int, int>, int> mx_dist;
        for (int k=0; k<n; k++) {
          if (k == i or k == j) continue;
          int a = (dist(i, k) + dist(j, k) - dist(i, j)) / 2;
          int x = dist(i, k) - a;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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