제출 #615605

#제출 시각아이디문제언어결과실행 시간메모리
615605Apiram도시들 (IOI15_towns)C++14
25 / 100
16 ms472 KiB
#include "towns.h" #include <bits/stdc++.h> using namespace std; int hubDistance(int N, int sub) { int root = 0; vector<int>dist(N); for (int i = 0;i<N;++i){ if (i == root)dist[i] = 0; else dist[i] = getDistance(i,root); } for (int i = 0;i<N;++i){ if (dist[i] > dist[root]){ root = i; } } for (int i = 0;i<N;++i){ if (i == root)dist[i] = 0; else dist[i] = getDistance(i,root); } int root2 = root; for (int i = 0;i<N;++i){ if (dist[i] > dist[root2])root2 = i; } int answer = dist[root2]; vector<int>dist2(N); for (int i = 0;i<N;++i){ if (i == root2){ dist2[i] = 0; } else{ dist2[i] = getDistance(root2,i); } } for (int i = 0;i<N;++i){ int x = (dist[i] + dist2[i] - dist[root2])/2; answer = min(answer,max(dist[i] - x,dist2[i] - x)); } bool ok = 0; for (int i = 0;i<N;++i){ int x = (dist[i] + dist2[i] + - dist[root2])/2; if (answer == max(dist[i] - x,dist2[i] - x)){ int sub1 = 0,sub2 = 0; for (int j = 0;j<N;++j){ if (dist[j] <= dist[i] - x){ sub1++; } if (dist2[j]<=dist2[i] - x){ sub2++; } } int remain = N - sub1 - sub2; remain = (remain + 1)/2; if (max({remain,sub1,sub2}) <=N/2){ ok = true; } } } return answer * ((ok)?1:-1); }

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

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