제출 #64724

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64724		FLDutchman	Towns (IOI15_towns)	C++14	25 / 100	42 ms	7020 KiB

towns

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

typedef int INT;

#define int long long
#define FOR(i, l, r) for(int i = (l); i < (r); i++)
#define pb push_back
#define fst first
#define snd second
#define LSB(k) k&-k

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

const int mod = 1e9+7;
int D;


INT hubDistance(INT N, INT sub) {
	ii far = {-1, -1};
	FOR(i, 1, N) far = max({getDistance(0, i), i}, far);
	vi d1, d2;
	int I = far.snd;
	far = {-1, -1};
	FOR(i, 0, N) {
		if(i == I) d1.pb(0);
		else d1.pb(getDistance(I, i)), far = max(far, {d1.back(), i});
	}
	int J = far.snd;
	D = far.fst;
	FOR(i, 0, N){
		if(i == J) d2.pb(0);
		else d2.pb(getDistance(J, i));
	}
	int R = 1e9;
	FOR(i, 0, N){
		int d = (d1[i] + d2[i] - D)/2;
		R = min(R, max(d1[i]-d, d2[i]-d));
	}
	return R;
}

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

towns.cpp: In function 'INT hubDistance(INT, INT)':
towns.cpp:24:42: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  FOR(i, 1, N) far = max({getDistance(0, i), i}, far);
                                          ^
towns.cpp:30:30: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   else d1.pb(getDistance(I, i)), far = max(far, {d1.back(), i});
                              ^
towns.cpp:30:30: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
towns.cpp:36:30: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   else d2.pb(getDistance(J, i));
                              ^
towns.cpp:36:30: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
towns.cpp:43:9: warning: conversion to 'INT {aka int}' from 'long long int' may alter its value [-Wconversion]
  return R;
         ^
towns.cpp:22:28: warning: unused parameter 'sub' [-Wunused-parameter]
 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