제출 #207276

#제출 시각아이디문제언어결과실행 시간메모리
207276AQT도시들 (IOI15_towns)C++14
0 / 100
31 ms376 KiB
#include <towns.h> #include <bits/stdc++.h> using namespace std; int dist[2][200]; int hubDistance(int N, int sub){ int d1 = 0, d2 = 0; for(int i = 1; i<N; i++){ dist[0][i] = getDistance(0, i); if(dist[0][i] > dist[0][d1]){ d1 = i; } } for(int i = 0; i<N; i++){ dist[1][i] = getDistance(d1, i); if(dist[1][i] > dist[1][d2]){ d2 = i; } } int dia = dist[1][d2]; int ans = dia; for(int i = 0; i<N; i++){ int k = (dist[0][d1] + dist[0][i] - dist[1][i])/2; if(abs(ans-dia/2) > abs(k-dia/2)){ ans = k; } } return min(ans, dia-ans); }

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:8:28: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance(int N, int sub){
                            ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...