제출 #1141485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141485		aarb_.tomatexd	도시들 (IOI15_towns)	C++20	0 / 100	8 ms	328 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
#define ll long long 
#define SZ(x) ((int)(x).size())
using namespace std;
int hubDistance(int N, int sub) {
    int farthest = 1, maxDist = 0;
    for (int i = 2; i <= N; i++) {
        int d = getDistance(1, i);
        if (d > maxDist) {
            maxDist = d;
            farthest = i;
        }
    }
    int diamStart = farthest;
    maxDist = 0;
    for (int i = 1; i <= N; i++) {
        if (i == diamStart) continue;
        int d = getDistance(diamStart, i);
        if (d > maxDist) {
            maxDist = d;
            farthest = i;
        }
    }
    int diamEnd = farthest;
    vector<pair<int, int>> nodes;
    for (int i = 1; i <= N; i++) {
        nodes.push_back({getDistance(diamStart, i), i});
    }
    sort(nodes.begin(), nodes.end());
    int hub = nodes[maxDist / 2].second;
    if (sub == 1 || sub == 2) return maxDist;
    
    vector<int> distances;
    for (int i = 1; i <= N; i++) {
        if (i != hub) distances.push_back(getDistance(hub, i));
    }
    sort(distances.begin(), distances.end());
    int maxGroupSize = (N - 1) / 2;
    if (distances[N - 2] <= maxGroupSize) return maxDist;
    return -1; 
}

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