제출 #60221

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

towns

#include "towns.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}

const int N = 256;

int D[N][N];

int hubDistance(int n, int sub) {
	for (int i = 0;i < n;++i)
		for (int j = 0;j < i;++j)
			D[i][j] = D[j][i] = getDistance(i,j);
	int mx = 0;
	for (int i = 0;i < n;++i)
		for (int j = 0;j < n;++j)
			smax(mx,D[i][j]);
	int x = max_element(D[0],D[0] + n) - D[0];
	int y = max_element(D[x],D[x] + n) - D[x];
	//cerr << x << ' ' << y << ' ' << mx << '\n';
	assert(D[x][y] == mx);
	vi s;
	pii ans = mp((int)(2e9),0);
	map < int , int > M;
	for (int k = 0;k < n;++k)
		if (k != x && k != y)
			++M[(D[x][y] - (D[x][k] - D[y][k])) / 2];
	int ok = 1;
	for (auto it : M)
		ok &= it.se <= (n / 2),s.pb(it.fi);
	s.pb(D[x][y]);
	sort(all(s));
	s.resize(unique(all(s)) - s.begin());
	for (auto it : s)
		smin(ans,mp(max(D[x][y] - it,it),ok));
	return ans.fi * (1 - 2 * ans.se);
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:30:37: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
  int x = max_element(D[0],D[0] + n) - D[0];
          ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
towns.cpp:31:37: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
  int y = max_element(D[x],D[x] + n) - D[x];
          ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
towns.cpp:22:28: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance(int n, int sub) {
                            ^~~

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