이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "towns.h"
using namespace std;
//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a:b)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()
const int MX = 115;
int n;
int mem[MX][MX];
int getD(int x, int y) {
if(mem[x][y] != -1) return mem[x][y];
return mem[x][y] = mem[y][x] = getDistance(x,y);
}
int hubDistance(int N, int sub) {
n = N;
RE(i,n) RE(j,n) mem[i][j] = -1;
RE(i,n) mem[i][i] = 0;
int x = 0, y = 0, pathL = 0;
REP(i,1,n) {
int d = getD(x,i);
if(d > pathL) {
pathL = d;
y = i;
}
}
RE(i,n) {
int d = getD(y,i);
if(d > pathL) {
pathL = d;
x = i;
}
}
map<int, int> fromX;
RE(i,n) {
if(i == x || i == y) continue;
int dx = getD(i,x);
int dy = getD(i,y);
int lenI = (dx+dy-pathL)/2;
fromX[dx-lenI] = max(fromX[dx-lenI], max(dx-lenI, max(dy-lenI, lenI)));
}
int ans = fromX.begin()->second;
FOR(p,fromX) ans = min(ans, p.se);
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:38:28: warning: unused parameter 'sub' [-Wunused-parameter]
38 | 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... |