Submission #1168726

#TimeUsernameProblemLanguageResultExecution timeMemory
1168726anmattroiTowns (IOI15_towns)C++17
0 / 100
8 ms328 KiB
#include "towns.h"
#include <bits/stdc++.h>

using namespace std;

int hubDistance(int N, int sub) {
    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);
        if (mx < t) {
            mx = t;
            nodeB = i;
        }
    }
    int tong = mx;

    int ans = INT_MAX;
    for (int i = 0; i < N; i++) {
        int hieu = getDistance(i, nodeA) - getDistance(i, nodeB);
        if (hieu < 0) hieu = -hieu;
        ans = min(ans, (hieu+tong)/2);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...