제출 #359975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
359975		tengiz05	도시들 (IOI15_towns)	C++17	25 / 100	24 ms	1132 KiB

towns

#include "towns.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
int n;
int hubDistance(int Ni, int sub){
	n = Ni;
	if(sub <= 2){
		vector<int> dist_a(n), dist_b(n), dist_c(n);
		int a, b, c;
		a = 0;
		int maximum_dist = -1, ind = -1;
		for(int i=1;i<n;i++){
			dist_a[i] = getDistance(a, i);
			if(dist_a[i] > maximum_dist){
				maximum_dist = dist_a[i];
				ind = i;
			}
		}b = ind;
		maximum_dist = -1;
		for(int i=0;i<n;i++){
			dist_b[i] = getDistance(b, i);
			if(dist_b[i] > maximum_dist){
				maximum_dist = dist_b[i];
				ind = i;
			}
		}c = ind;
		for(int i=0;i<n;i++){
			dist_c[i] = getDistance(c,i);
		}
		int ans = 2e9;
		for(int i=0;i<n;i++){
			int d1 = (dist_b[i] + dist_c[i] - maximum_dist) / 2;
			int t = max(dist_b[i] - d1, dist_c[i] - d1);
			ans = min(ans, t);
		}
		return ans;
	}return -12431223;
}

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