제출 #433993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433993		qwerasdfzxcl	도시들 (IOI15_towns)	C++14	0 / 100	23 ms	972 KiB

towns

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

using namespace std;
int dist[111][111], n;

int hubDistance(int N, int sub) {
	n = N;
    for (int i=1;i<n;i++) dist[0][i] = getDistance(0, i);
    int a = 0, b = max_element(dist[0], dist[0]+n) - dist[0];
    for (int i=0;i<n;i++) if (i!=b) dist[b][i] = getDistance(b, i);
    set<int> st;
    for (int i=1;i<n;i++) if (i!=b){
        st.insert(dist[a][b]-dist[b][i]+(dist[a][i]+dist[b][i]-dist[a][b])/2);
    }
    int ret = dist[a][b];
    for (auto &x:st) ret = min(ret, max(x, dist[a][b]-x));
    return ret;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:10:52: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   10 |     int a = 0, b = max_element(dist[0], dist[0]+n) - dist[0];
      |                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
towns.cpp:7:28: warning: unused parameter 'sub' [-Wunused-parameter]
    7 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

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