# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208051 | AQT | Towns (IOI15_towns) | C++14 | 33 ms | 516 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;
int dist[2][200];
int par[200], sz[200];
bool midset[200], chk[200];
int graph[200][200];
/*
int getDistance(int i, int j){
//cout << "? " << i << " " << j << endl;
//int k;
//cin >> k;
//return k;
return graph[i][j];
}
*/
int hubDistance(int N, int sub){
int d1 = 0, d2 = 0;
for(int i = 1; i<N; i++){
dist[0][i] = getDistance(0, i);
if(dist[0][i] > dist[0][d1]){
d1 = i;
}
}
for(int i = 0; i<N; i++){
dist[1][i] = getDistance(d1, i);
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... |