#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 110 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "towns.h"
int dis[N][N];
int f(int u, int v){
if(u > v) swap(u,v);
if(dis[u][v] != -1) return dis[u][v];
return dis[u][v] = getDistance(u,v);
}
int hubDistance(int n, int sub) {
memset(dis,-1,sizeof dis);
pii mx = {-1,-1};
rep1(i,n-1){
pii px = {f(0,i),i};
amax(mx,px);
}
int s = mx.ss;
mx = {-1,-1};
rep(i,n){
if(i == s) conts;
pii px = {f(s,i),i};
amax(mx,px);
}
auto [diam,t] = mx;
int ans = inf1;
rep(i,n){
if(i == s or i == t) conts;
int d1 = f(s,i), d2 = f(t,i);
int d = d1+d2;
assert(d >= diam);
int x = (d-diam)/2;
d1 -= x, d2 -= x;
amin(ans,max(d1,d2));
}
return ans;
}
Compilation message
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:70:28: warning: unused parameter 'sub' [-Wunused-parameter]
70 | int hubDistance(int n, int sub) {
| ~~~~^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
344 KB |
Output is correct |
2 |
Correct |
10 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
19 ms |
532 KB |
Output is correct |
5 |
Correct |
14 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
348 KB |
Output is correct |
2 |
Correct |
9 ms |
900 KB |
Output is correct |
3 |
Correct |
12 ms |
1032 KB |
Output is correct |
4 |
Correct |
12 ms |
860 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
11 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
536 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |