제출 #399726

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

towns

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

const int MAXN = 1e6;

int dist[3][MAXN];

int hubDistance(int N, int sub) {
	int p1 = 0, p2 = 0;
	int maxi = 0;
	for(int i = 0; i < N; i++){
		int aux = getDistance(0, i);
		if(aux > maxi) p1 = i, maxi = aux;
	}
	maxi = 0;
	for(int i = 0; i < N; i++){
		dist[0][i] = getDistance(p1, i);
		if(dist[0][i] > maxi) maxi = dist[0][i], p2 = i;
	}
	for(int i = 0; i < N; i++)
		dist[1][i] = getDistance(p2, i);
	
	int diam = dist[0][p2];
	int ans = MAXN;
	for(int i = 0; i < N; i++){
		int x = (diam + dist[0][i] - dist[1][i]) / 2;
		ans = min(ans, max(x, diam - x));
	}
	
	if(sub <= 2) return ans;
	
	int lSize, rSize;
	vector<int> lMid, rMid;
	for(int i = 0; i < N; i++){
		int x = (diam + dist[0][i] - dist[1][i]) / 2;
		if(x < min(ans, diam - ans)) lSize++;
		else if(x == min(ans, diam - ans)) lMid.push_back(i); 
		else if(x == max(ans, diam - ans)) rMid.push_back(i);
		else rSize++;
	}
	
	if(lSize > N / 2 || rSize > N / 2) return -ans;
	
	if(lMid.size() > N / 2){
		return -ans;
	}
	else if(rMid.size() > N / 2){
		return -ans;
	}
	return ans;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:45:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |  if(lMid.size() > N / 2){
      |     ~~~~~~~~~~~~^~~~~~~
towns.cpp:48:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   48 |  else if(rMid.size() > N / 2){
      |          ~~~~~~~~~~~~^~~~~~~
towns.cpp:33:13: warning: 'rSize' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |  int lSize, rSize;
      |             ^~~~~
towns.cpp:33:6: warning: 'lSize' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |  int lSize, rSize;
      |      ^~~~~

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