# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
295749 | peti1234 | Towns (IOI15_towns) | C++17 | 24 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 <bits/stdc++.h>
#include "towns.h"
using namespace std;
const int c=112;
int dist[c][c], a, b, h, n, mini;
/*
int getDistance(int a, int b) {
//cout << a << " " << b << "\n";
int x; cin >> x;
return x;
}
*/
int tav(int a, int b) {
if (a==b) return 0;
if (!dist[a][b]) dist[a][b]=getDistance(a, b), dist[b][a]=dist[a][b];
return dist[a][b];
}
int tavol(int x) {
int pos=0;
for (int i=0; i<n; i++) {
int p=tav(x, i);
if (p>tav(x,pos)) pos=i;
}
return pos;
}
int hubDistance(int q, int w) {
n=q;
for (int i=0; i<n; i++) for (int j=0; j<n; j++) dist[i][j]=0;
a=tavol(0), b=tavol(a), h=tav(a, b), mini=h;
for (int i=0; i<n; i++) {
int x=tav(a, 0), y=tav(a, i), z=tav(i, 0), p=(x+y-z)/2;
//cout << "lehet " << i << " " << x << " " << y << " " << z << " " << p << "\n";
mini=min(mini, max(p, h-p));
}
return mini;
}
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... |