제출 #116267

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116267		Bruteforceman	도시들 (IOI15_towns)	C++11	0 / 100	19 ms	476 KiB

towns

#include "towns.h"
#include "bits/stdc++.h"
using namespace std;

map <pair <int, int>, int> mp;

int distance(int i, int j) {
	if(i == j) return 0;
	if(i > j) swap(i, j);
	if(mp.find(make_pair(i, j)) != mp.end()) return mp[make_pair(i, j)];
	return mp[make_pair(i, j)] = getDistance(i, j);
}
int hubDistance(int N, int sub) {
	int opt = 0;
	int dist = 0;
	for(int i = 1; i < N; i++) {
		int d = distance(0, i);
		if(d > dist) {
			dist = d;
			opt = i;
		}
	}
	int P = 0, Q = opt;
	dist = 0;
	for(int i = 0; i < N; i++) {
		if(i == opt) continue;
		int d = distance(opt, i);
		if(d > dist) {
			dist = d;
			P = i;
		}
	}
	int R = distance(P, Q);
	for(int i = 0; i < N; i++) {
		int lca_dist = (distance(i, P) + distance(i, Q) - distance(P, Q)) / 2;
		int p_dist = distance(i, P) - lca_dist;
		R = min(R, max(p_dist, distance(P, Q) - p_dist));
	}
	return R;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:13:28: warning: unused parameter 'sub' [-Wunused-parameter]
 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