# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422748 | 2021-06-10T11:41:50 Z | vanic | Towns (IOI15_towns) | C++14 | 21 ms | 1120 KB |
#include "towns.h" #include <algorithm> #include <iostream> using namespace std; const int maxn=120; int dist[maxn][maxn]; int hubDistance(int n, int sub) { int ind=0; int maksi=0; for(int i=1; i<n; i++){ dist[0][i]=dist[i][0]=getDistance(0, i); if(maksi<dist[0][i]){ maksi=dist[0][i]; ind=i; } } int ind1=0; maksi=0; for(int i=0; i<n; i++){ if(ind==i){ continue; } if(!dist[i][ind]){ dist[i][ind]=dist[ind][i]=getDistance(ind, i); } if(dist[i][ind]>maksi){ maksi=dist[i][ind]; ind1=i; } } swap(ind, ind1); for(int i=0; i<n; i++){ if(ind==i){ continue; } if(!dist[i][ind]){ dist[i][ind]=dist[ind][i]=getDistance(ind, i); } } // cout << ind << ' ' << ind1 << endl; // cout << maksi << endl; int mini=1e9; int br; for(int i=0; i<n; i++){ // cout << i << ' ' << dist[i][ind] << ' ' << dist[i][ind1] << endl; br=(dist[i][ind]+dist[i][ind1]-maksi)/2; br=max(dist[i][ind]-br, dist[i][ind1]-br); // cout << br << endl; mini=min(mini, br); } return mini; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 972 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 980 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 844 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 1120 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 844 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 18 ms | 760 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |