#include "towns.h"
#include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,int>m;
int getmindist(int d1,int d2,int d3) {
int dd=(d1+d2-d3)/2;
int d=(d1+d3-d2)/2;
int ddd=(d2+d3-d1)/2;
return max(max(d,dd),ddd);
}
int hubDistance(int n,int sub) {
int maxd=0,maxind=0;
int md=0;
for(int i=1;i<n;i++) {
int p=getDistance(0,i);
m[{0,i}]=m[{i,0}]=p;
if(maxd<p) {
maxd=p;
maxind=i;
}
}
md=maxind;
maxd=0;
maxind=0;
for(int i=0;i<n;i++) {
if(i==md)continue;
int p=getDistance(md,i);
m[{md,i}]=m[{i,md}]=p;
if(maxd<p) {
maxd=p;
maxind=i;
}
}
int minr=INT_MAX;
for(int i=0;i<n;i++) {
if(i==md || i==maxind)continue;
minr=min(minr,getmindist(maxd,m[{i,md}],getDistance(i,maxind)));
}
return minr;
}
Compilation message
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:11:27: warning: unused parameter 'sub' [-Wunused-parameter]
11 | int hubDistance(int n,int sub) {
| ~~~~^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
468 KB |
Output is correct |
2 |
Correct |
11 ms |
468 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
13 ms |
372 KB |
Output is correct |
5 |
Correct |
16 ms |
372 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
432 KB |
Output is correct |
2 |
Correct |
11 ms |
888 KB |
Output is correct |
3 |
Correct |
14 ms |
852 KB |
Output is correct |
4 |
Correct |
13 ms |
872 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
512 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
9 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
10 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |