이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "towns.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 120;
int m, n;
int dist0[maxn];
int distu[maxn];
int add[maxn], bran[maxn];
map<int, int> cnt;
int hubDistance(int N, int sub)
{
cnt.clear();
if(sub > 2 && sub != 4) return 0;
n = N;
int best = 0, dat = -1;
for(int i = 1; i< N; i++)
{
dist0[i] = getDistance(0, i);
if(dist0[i]> best)
{
best = dist0[i];
dat = i;
}
}
int U = dat;
best = 0; dat = -1;
for(int i = 0; i< N; i++)
{
if(i == U || i == 0) continue;
distu[i] = getDistance(U, i);
if(distu[i]> best)
{
best = distu[i];
dat = i;
}
}
int diam = best;
int V = dat;
// printf("(%d->%d) %d\n", U, V, dist[V]);
for(int i = 0; i< N; i++)
{
if(i == U || i == 0) continue;
int br = dist0[i]+distu[i]-dist0[U];
br /= 2;
int pos = dist0[i]-br;
add[i] = pos;
bran[i] = br;
cnt[pos]++;
}
int rad = 1e9;
int cm = 1;
bool good = false;
for(auto kk : cnt)
{
int x = kk.X, y = kk.Y;
// printf("%d: %d\n", x, cnt[x]);
if(x< add[V]) continue;
rad = min(rad, max(add[x]-add[V]+bran[V], dist0[U]-add[x]));
}
for(auto kk : cnt)
{
int x = kk.X, y = kk.Y;
if(max(add[x]-add[V]+bran[V], dist0[U]-add[x]) == rad)
{
if(max(cm, max(cnt[x], n-cnt[x]-cm))<= n/2) good = true;
}
cm += cnt[x];
}
return good?rad:-rad;
}
컴파일 시 표준 에러 (stderr) 메시지
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:67:17: warning: unused variable 'y' [-Wunused-variable]
int x = kk.X, y = kk.Y;
^
towns.cpp:74:17: warning: unused variable 'y' [-Wunused-variable]
int x = kk.X, y = kk.Y;
^
towns.cpp:49:6: warning: unused variable 'diam' [-Wunused-variable]
int diam = best;
^~~~
# | 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... |