제출 #553686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
553686		keta_tsimakuridze	도시들 (IOI15_towns)	C++14	0 / 100	16 ms	364 KiB

towns

#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 505;
int d[3][N], dist[N][N];
int hubDistance(int n, int sub) {
	int U = 0, V = 0;
	for(int i = 1; i < n; i++) {
		d[0][i] = getDistance(0, i); 
		if(d[0][i] >= d[0][U]) U = i;
	}
	for(int i = 0; i < n; i++) {
		if(U == i) continue;
		
		d[1][i] = getDistance(U, i);
		
		if(d[1][i] >= d[1][V]) V = i;
	}
	
	for(int i = 0; i < n; i++) {
		if(V == i) continue;
		
		d[2][i] = getDistance(V, i);	
	}
	int R = 1e9;
	for(int i = 0; i < n; i++) {
		int D = (d[1][i] + d[2][i] - d[2][U]) / 2;
		R = min(R, max(d[1][i] - D, d[2][i] - D));
	}	
	return R;
/*	
	vector<int> v;
	int Distance = 0;
	for(int i = 0; i < n; i++) {
		int D = (d[1][i] + d[0][i] - d[0][U]) / 2;
		D = d[1][i] - D;
		v.push_back(D);
		if(i == V) Distance = D;
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	int R = 1e9;
	for(int i = 0; i < v.size(); i++) {
		if(v[i] > Distance) break;
		int x = (d[1][V] + d[0][V] - d[0][U]) / 2 + Distance - v[i];
		R = min(R, max(v[i], x));
	}
	return R;
*/
}
/*
int main() {
	int n;
	cin >> n;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) cin >> dist[i][j];
	}
	cout << hubDistance(n, 0) << endl;
}
*/

컴파일 시 표준 에러 (stderr) 메시지

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:6:28: warning: unused parameter 'sub' [-Wunused-parameter]
    6 | int hubDistance(int n, int sub) {
      |                        ~~~~^~~

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