Submission #1168740

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168740		anmattroi	Towns (IOI15_towns)	C++17	0 / 100	9 ms	328 KiB

towns

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

int hubDistance(int N, int sub) {
    int *cached = new int[N];

    int mx = -1, nodeA = -1, nodeB = -1;
    for (int i = 1; i < N; i++) {
        int t = getDistance(0, i);
        if (mx < t) {
            mx = t;
            nodeA = i;
        }
    }
    for (int i = 0; i < N; i++)
    if (i != nodeA) {
        int t = getDistance(nodeA, i);
        cached[i] = t;
        if (mx < t) {
            mx = t;
            nodeB = i;
        }
    }
    int tong = mx;

    int ans = INT_MAX;
    for (int i = 0; i < N; i++)
    if (i != nodeA and i != nodeB) {
        int hieu = cached[i] - getDistance(i, nodeB);
        if (hieu < 0) hieu = -hieu;
        ans = min(ans, (hieu+tong)/2);
    }
    return 17;
    return ans;
}

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