# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105322 | Alexa2001 | Towns (IOI15_towns) | C++17 | 28 ms | 1024 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>
using namespace std;
const int Nmax = 505;
int x, y;
int D0[Nmax], D1[Nmax], Up[Nmax], L[Nmax];
map< int, vector<int> > gr;
map< pair<int,int> , int > mp;
int getDist(int x, int y)
{
if(x == y) return 0;
if(mp[{x,y}]) return mp[{x, y}];
return mp[{x, y}] = mp[{y, x}] = getDistance(x, y);
}
void prepare(int n)
{
int i;
for(i=0; i<n; ++i) D0[i] = getDist(0, i);
x = max_element(D0, D0+n) - D0;
for(i=0; i<n; ++i) D1[i] = getDist(x, i);
y = max_element(D1, D1+n) - D1;
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... |