제출 #785481

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

towns

#include "towns.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << " ";
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 200 + 10;

int n, dis[2][maxn];

int hubDistance(int N, int sub) {
	n = N;
	for (int i = 0; i < n; i++){
		dis[0][i] = getDistance(0, i);
		//debug(i, dis[0][i]);
	}
	int r1 = max_element(dis[0], dis[0] + n) - dis[0];
	//debug(r1);
	for (int i = 0; i < n; i++){
		dis[0][i] = getDistance(r1, i);
		//debug(i, dis[0][i]);
	}
	int r2 = max_element(dis[0], dis[0] + n) - dis[0];
	//debug(r2);
	for (int i = 0; i < n; i++){
		dis[1][i] = getDistance(r2, i);
		//debug(i, dis[1][i]);
	}
	int ans = dis[0][r2];
	for (int i = 0; i < n; i++){
		int tmp = (dis[0][i] + dis[0][r2] - dis[1][i]) / 2;
		ans = min(ans, max(tmp, dis[0][r2] - tmp));
	}
	return ans;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:37:43: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   37 |  int r1 = max_element(dis[0], dis[0] + n) - dis[0];
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
towns.cpp:43:43: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   43 |  int r2 = max_element(dis[0], dis[0] + n) - dis[0];
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
towns.cpp:31:28: warning: unused parameter 'sub' [-Wunused-parameter]
   31 | 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