제출 #785512

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

towns

//  ~ Be Name Khoda ~  //

#include "towns.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  300;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;


ll dis1[maxn5], dis2[maxn5], val[maxn5];
vector <pair<int, int>> av;

int hubDistance(int n, int sub){
	int v = 0;
	dis1[0] = 0;
	for(int i = 1; i < n; i++){
		dis1[i] = getDistance(0, i);
		if(dis1[i] >= dis1[v])
			v = i;
	}
	dis2[v] = 0;
	int u = v;
	for(int i = 0; i < n; i++){
		dis2[i] = getDistance(v, i);
		if(dis2[i] >= dis2[u])
			u = i;
	}
	for(int i = 0; i < n; i++){
		dis1[i] = getDistance(u, i);
	}
	ll R = dis1[v];
	int mnid = 0;
	for(int i = 0; i < n; i++){
		val[i] = abs(dis1[i] - dis2[i]);
		if(val[i] <= val[mnid])
			mnid = i;
	}
	ll len = (dis1[mnid] + dis2[mnid] - dis1[v]) / 2;
	return max(dis1[mnid], dis2[mnid]) - len;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:56:37: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   56 |  return max(dis1[mnid], dis2[mnid]) - len;
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
towns.cpp:48:5: warning: unused variable 'R' [-Wunused-variable]
   48 |  ll R = dis1[v];
      |     ^
towns.cpp:30:28: warning: unused parameter 'sub' [-Wunused-parameter]
   30 | 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