제출 #615672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
615672		Apiram	도시들 (IOI15_towns)	C++14	25 / 100	21 ms	960 KiB

towns

#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
int hubDistance(int N, int sub) {
	int root = 0;
	vector<int>dist(N);
	for (int i = 0;i<N;++i){
		if (i == root)dist[i] = 0;
		else dist[i] = getDistance(i,root);
	}
	for (int i = 0;i<N;++i){
		if (dist[i] > dist[root]){
			root = i;
		}
	}
	for (int i = 0;i<N;++i){
		if (i == root)dist[i] = 0;
		else dist[i] = getDistance(i,root);
	}
	int root2 = root;
	for (int i = 0;i<N;++i){
		if (dist[i] > dist[root2])root2 = i;
	}
	int answer = dist[root2];
	vector<int>dist2(N);
	for (int i = 0;i<N;++i){
		if (i == root2){
			dist2[i] = 0;
		}
		else{
			dist2[i] = getDistance(root2,i);
		}
	}
	for (int i = 0;i<N;++i){
		int x = (dist[i] + dist2[i] - dist[root2])/2;
		answer = min(answer,max(dist[i] - x,dist2[i] - x)); 
	}
	for (int i = 0;i<N;++i){
		int x = (dist[i] + dist2[i] - dist[root2])/2;
		if (answer == max(dist[i] - x,dist2[i] - x)){
			int sub1 = 0,sub2 = 0,sub3  = 0,sub4 = 0;
			for (int j = 0;j<N;++j){
				if (dist[j] <= dist[i] - x && dist2[j] > dist2[i] - x ){
					sub1++;
				}
				else if (dist2[j]<=dist2[i] - x && dist[j] > dist[i] - x){
					sub2++;
				}
				else if (sub3 < sub4)sub3++;
				else sub4++;
			}	
			for (int p = 0;p<2;++p){
				if (sub3 > sub4){
					if (sub1 + 1 < sub3){
						sub1++;
						sub3--;
					}
				}
				else{
					if (sub1 + 1 < sub4){
						sub1++;
						sub4--;
					}
				}
			}
			for (int p = 0;p<2;++p){
				if (sub3 > sub4){
					if (sub2 + 1 < sub3){
						sub2++;
						sub3--;
					}
				}
				else{
					if (sub2 + 1 < sub4){
						sub2++;
						sub4--;
					}
				}
			}
			if (max({sub3,sub1,sub2,sub4}) <=N/2){
				return answer;
			}
		}
	}
	return -answer;
}

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

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

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