이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <towns.h>
#include <bits/stdc++.h>
using namespace std;
int dist[2][200];
int par[200], sz[200];
bool midset[200];
int graph[200][200];
/*
int getDistance(int i, int j){
cout << "? " << i << " " << j << endl;
int k;
cin >> k;
return k;
return graph[i][j];
}
*/
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];
//cout << "diameter endpoints: " << d1 << " " << d2 << endl;
int ans = dia;
for(int i = 0; i<N; i++){
int k = (dist[0][d1] + dist[1][i] - dist[0][i])/2;
//cout << "which set?: " << i << " " << k << endl;
if(abs(ans-dia/2) > abs(k-dia/2)){
ans = k;
}
midset[i] = 0;
}
int d = ans;
ans = max(ans, dia-ans);
int lft = 0, rht = 0;
for(int i = 0; i<N; i++){
int k = (dist[0][d1] + dist[1][i] - dist[0][i])/2;
//cout << "which set again?: " << i << " " << k << endl;
//cout << dist[0][d1] << " " << dist[1][i] << " " << dist[0][i] << endl;
if(dia-k > ans){
//cout << "lft: " << i << endl;
midset[i] = 1;
lft++;
}
else if(k > ans){
//cout << "rht: " << i << endl;
midset[i] = 1;
rht++;
}
}
if(max(lft, rht) > N/2){
ans = -ans;
return ans;
}
vector<int> v, w;
for(int i =0 ; i<N; i++){
if(midset[i]){
par[i] = -1;
continue;
}
par[i] = i;
v.push_back(i);
sz[i] = 1;
}
int g = -1;
while(v.size()){
//cout << "next iteration: " << k << endl;
while(v.size() >= 2){
int n = v.back();
v.pop_back();
int m = v.back();
v.pop_back();
if(dist[1][n] + dist[1][m] - getDistance(n, m) > 2*d){
par[n] = -1;
sz[m] += sz[n];
w.push_back(m);
}
}
if(v.size() == 1 && w.empty()){
g = v[0];
break;
}
swap(v, w);
w.clear();
}
if(g != -1){
int cnt = 0;
for(int i = 0; i<N; i++){
if(par[i] == i && !midset[i]){
if(dist[1][i] + dist[1][g] - getDistance(i, g) > 2*d){
cnt += sz[i];
//cout << "sz: " << i << " " << sz[i] << endl;
}
}
}
//cout << cnt << endl;
if(cnt > N/2){
ans = -ans;
}
}
else{
ans = -ans;
}
/*
int g = -1, cnt = 0;
for(int i = 0; i<N; i++){
if(midset[i]){
continue;
}
if(cnt == 0){
g = i;
cnt = 1;
}
else if(dist[1][i] + dist[1][g] - getDistance(i, g) > 2*d){
cnt++;
}
else{
cnt--;
if(cnt == 0){
g = -1;
}
}
//cout << i << " " << cnt << endl;
}
//cout << "g: " << g << endl;
if(g != -1){
cnt = 0;
for(int i = 0; i<N; i++){
if(!midset[i] && dist[1][i] + dist[1][g] - getDistance(i, g) > 2*d){
cnt++;
}
}
//cout << cnt << endl;
if(cnt > N/2){
ans = -ans;
}
}
*/
return ans;
}
/*
int main(){
int tempN, sub, T;
cin >> sub >> T;
while(T--){
cin >> tempN;
for(int i =0 ; i<tempN; i++){
for(int j = 0; j<tempN; j++){
cin >> graph[i][j];
}
}
cout << hubDistance(tempN, sub) << endl;
}
}
*/
컴파일 시 표준 에러 (stderr) 메시지
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:20:28: warning: unused parameter 'sub' [-Wunused-parameter]
int hubDistance(int N, int sub){
^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |