# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670192 | 2022-12-08T08:53:32 Z | Astrayt | Towns (IOI15_towns) | C++17 | 35 ms | 396 KB |
#include <bits/stdc++.h> #include "towns.h" using namespace std; #define starburst ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); //#define int long long #define pii pair<int,int> #define pb push_back /*int dist[110][110]; int getDistance(int i, int j){ return dist[i][j]; }*/ int hubDistance(int n, int sub){ vector<vector<int>> D(n, vector<int>(n, 0)); for(int i = 0; i < n; ++i) for(int j = i + 1; j < n; ++j) D[i][j] = D[j][i] = getDistance(i, j); int lb = 0, R = 1e9; while(true){ int mn = 1e9; for(int i = 1; i < n; ++i){ for(int j = i + 1; j < n; ++j){ int k = (D[0][i] + D[0][j] - D[i][j]) / 2; if(k < mn && k > lb) mn = k; } } if(mn == 1e9) break; int r = mn; for(int i = 1; i < n; ++i){ for(int j = i + 1; j < n; ++j){ if(mn == (D[0][i] + D[0][j] - D[i][j]) / 2){ for(int p = 0; p < n; ++p){ if(p == i || p == j) continue; int d = (D[i][p] + D[j][p] - D[i][j]) / 2; r = max(r, d); } } } } R = min(R, r); lb = mn; } return R; } /*void solve(int sub){ int n; cin >> n; for(int i = 0; i < n; ++i){ for(int j = 0; j < n; ++j){ cin >> dist[i][j]; } } cout << hubDistance(n, sub) << '\n'; } signed main(){ starburst int t = 1, s; cin >> s >> t; while(t--) solve(s); }*/
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 35 ms | 372 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 396 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |