제출 #1122164

#제출 시각아이디문제언어결과실행 시간메모리
1122164SalihSahin도시들 (IOI15_towns)C++14
25 / 100
12 ms508 KiB
#include <bits/stdc++.h> #define pb push_back using namespace std; #include "towns.h" int hubDistance(int N, int sub) { int d1 = 0, dis = 0; for(int i = 1; i < N; i++){ int x = getDistance(0, i); if(x > dis){ d1 = i; dis = x; } } vector<int> distod1(N); int d2 = 0; dis = 0; for(int i = 0; i < N; i++){ int x = getDistance(d1, i); distod1[i] = x; if(x > dis){ d2 = i; dis = x; } } int diameter = dis; map<pair<int, int>, int> cnt; int R = 1e9; for(int i = 0; i < N; i++){ if(i == d1 || i == d2) continue; int other = i; int c1 = distod1[other], c2 = getDistance(d2, other); int othertoroot = ((c1 + c2) - diameter)/2; pair<int, int> val = {c1 - othertoroot, c2 - othertoroot}; cnt[val]++; int Rcan = max(c1 - othertoroot, c2 - othertoroot); R = min(R, Rcan); } bool balanced = 1; for(auto itr: cnt){ if(itr.second > N/2) balanced = 0; } if(balanced) return R; else return -R; }

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:6:28: warning: unused parameter 'sub' [-Wunused-parameter]
    6 | 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...