제출 #120875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
120875		Bruteforceman	도시들 (IOI15_towns)	C++11	13 / 100	22 ms	640 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) {
	mp.clear();
	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;
		}
	}


	map <int, int> dist_chain;
	map <int, int> pos_chain;

	int R = distance(P, Q);
	int radius_pos = 0;

	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;
		int val = max(p_dist, distance(P, Q) - p_dist);
		R = min(R, val);
		dist_chain[i] = lca_dist;
		pos_chain[i] = p_dist;
		if(R == val) {
			radius_pos = p_dist;
		}
	}

	vector <int> unmatched;

	int l = 0;
	int r = 0;

	for(int i = 0; i < N; i++) {
		if(pos_chain[i] < radius_pos) ++l;
		if(pos_chain[i] > radius_pos) ++r;
 	}
 	if(l > (N / 2) || r > (N / 2)) return -R;

	// cout << radius_pos << endl;	
 // 	for(int i = 0; i < N; i++) {
 // 		cout << i << ' ' << pos_chain[i] << ' ' << endl;
 // 	}
 // 	exit(0);


	for(int i = 0; i < N; i++) {
		if(pos_chain[i] != radius_pos) continue;
		if(unmatched.empty()) {
			unmatched.push_back(i);
		}

		int x = i;
		int y = unmatched.back();
		int d = distance(x, y);
		int lca_dist = (distance(P, x) + distance(P, y) - distance(x, y)) / 2;
		int meet = distance(P, x) - lca_dist;
		if(meet != dist_chain[x]) {
			unmatched.push_back(x);
		} else {
			unmatched.pop_back();
		}
	}
	if(unmatched.empty()) return R;

	int piv = unmatched.back();

	int cnt = 0;
	for(int i = 0; i < N; i++) {
		if(pos_chain[i] != radius_pos) continue;
		int x = i;
		int y = piv;
		int d = distance(x, y);
		int lca_dist = (distance(P, x) + distance(P, y) - distance(x, y)) / 2;
		int meet = distance(P, x) - lca_dist;	
		if(meet != dist_chain[x]) {
			++cnt;
		}
	}
	if(cnt > (N / 2)) R *= -1;
	return R;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:81:7: warning: unused variable 'd' [-Wunused-variable]
   int d = distance(x, y);
       ^
towns.cpp:99:7: warning: unused variable 'd' [-Wunused-variable]
   int d = distance(x, y);
       ^
towns.cpp:14:28: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance(int N, int sub) {
                            ^~~

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