# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708853 | LittleCube | Towns (IOI15_towns) | C++14 | 19 ms | 864 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towns.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;
int hubDistance(int N, int sub)
{
vector<int> dis0(N, 0), disU(N, 0), disD(N, 0);
map<pii, int> mp;
int u = 0, v = 0, mx = 0, uv, u0, v0, luv, R = 1e9;
for (int i = 1; i < N; i++)
{
dis0[i] = getDistance(0, i);
if (dis0[i] > mx)
u = i, mx = dis0[i];
}
for (int i = 0; i < N; i++)
disU[i] = getDistance(u, i);
mx = 0;
for (int i = 0; i < N; i++)
if (disU[i] > mx)
v = i, mx = disU[i];
uv = disU[v];
u0 = dis0[u];
v0 = dis0[v];
Compilation message (stderr)
# | 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... |