# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147015 | jun6873 | City Mapping (NOI18_citymapping) | C++11 | 8 ms | 1272 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 "citymapping.h"
#include <bits/stdc++.h>
using namespace std;
// long long get_distance(int X, int Y);
using lint = long long;
const lint inf = 1e18;
int n, t=0, *A, *B, *W;
void f(vector<int> v) {
int x = v[0], y = v[0], z = v[0];
vector<lint> a, b, c, d;
lint mxd;
mxd = 0;
for (int i : v) {
lint d = get_distance(x, i);
if (d > mxd) mxd = d, y = i;
a.push_back(d);
}
mxd = 0;
for (int i : v) {
lint d = get_distance(y, i);
if (d > mxd) mxd = d, z = i;
b.push_back(d);
}
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... |