# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1163477 | Sharky | Towns (IOI15_towns) | C++20 | 13 ms | 328 KiB |
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
// #define int long long
map<pair<int, int>, int> cache;
int qc = 0;
int ask(int i, int j) {
if (i == j) return 0;
if (!cache.count({i, j})) {
qc++;
int res = getDistance(i, j);
cache[{i, j}] = cache[{j, i}] = res;
return cache[{i, j}];
}
return cache[{i, j}];
}
}
int32_t hubDistance(int32_t N, int32_t sub) {
cache.clear();
qc = 0;
// cerr << "hi\n";
int upper_bound = (7 * N + 1) / 2;
int mx = -1, u, v;
for (int i = 0; i < N; i++) {
if (ask(0, i) > mx) mx = ask(0, i), u = i;
# | 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... |