#include "towns.h"
#include <iostream>
#include <cmath>
using namespace std;
int Weight[111][111], NN, TT, SB, c[111];
//int getDistance(int p1, int p2) { return Weight[p1][p2]; }
int hubDistance(int N, int sub) {
int maxn1 = 0, u = 0;
for (int i = 0; i < N; i++) { int V = getDistance(0, i); if (V > maxn1) { maxn1 = V; u = i; } }
int maxn2 = 0, v = 0;
for (int i = 0; i < N; i++) { int V = getDistance(u, i); if (V > maxn2) { maxn2 = V; v = i; } c[i] = V; }
for (int i = 0; i < N; i++) c[i] -= getDistance(v, i);
int ret = (1 << 30), maxid = 0;
for (int i = 0; i < N; i++) { if (abs(c[i]) < ret) { ret = abs(c[i]); maxid = i; } }
int p[3] = { 0,0,0 }, R = c[maxid], S = (maxn2 + ret) / 2;
for (int i = 0; i < N; i++) {
if (c[i] < R) p[0]++;
if (c[i] == R) p[1]++;
if (c[i] > R) p[2]++;
}
if (p[0] > (N / 2) || p[1] > (N / 2) || p[2] > (N / 2)) return -S;
return S;
}
Compilation message
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:10:28: warning: unused parameter 'sub' [-Wunused-parameter]
int hubDistance(int N, int sub) {
^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
376 KB |
Output is correct |
2 |
Correct |
25 ms |
868 KB |
Output is correct |
3 |
Correct |
2 ms |
868 KB |
Output is correct |
4 |
Correct |
21 ms |
1460 KB |
Output is correct |
5 |
Correct |
27 ms |
2168 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
2168 KB |
Output is correct |
2 |
Correct |
21 ms |
2488 KB |
Output is correct |
3 |
Correct |
21 ms |
3072 KB |
Output is correct |
4 |
Correct |
21 ms |
3612 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
18 ms |
3768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
3768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
16 ms |
3768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
15 ms |
3768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |