# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129539 | 2019-07-12T13:05:53 Z | johutha | Towns (IOI15_towns) | C++14 | 21 ms | 1016 KB |
#include "towns.h" #include <vector> #include <iostream> #include <algorithm> using namespace std; int hubDistance(int n, int sub) { int mmax = -1; int diabeg = -1; for (int i = 1; i < n; i++) { int q = getDistance(0, i); if (q > mmax) { mmax = q; diabeg = i; } } vector<int> fbeg(n); int diaend = -1; mmax = -1; for (int i = 0; i < n; i++) { if (i == diabeg) continue; fbeg[i] = getDistance(diabeg, i); if (fbeg[i] > mmax) { mmax = fbeg[i]; diaend = i; } } vector<int> fend(n); fend[diabeg] = fbeg[diaend]; for (int i = 0; i < n; i++) { if (i == diabeg || i == diaend) continue; fend[i] = getDistance(diaend, i); } int r = 100000000; int dia = fbeg[diaend]; for (int i = 0; i < n; i++) { int diff = abs(fbeg[i] - fend[i]); r = min(r, (dia + diff)/2); } return r; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 900 KB | Output is correct |
2 | Correct | 16 ms | 764 KB | Output is correct |
3 | Correct | 2 ms | 364 KB | Output is correct |
4 | Correct | 21 ms | 888 KB | Output is correct |
5 | Correct | 21 ms | 888 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1016 KB | Output is correct |
2 | Correct | 16 ms | 760 KB | Output is correct |
3 | Correct | 21 ms | 888 KB | Output is correct |
4 | Correct | 21 ms | 888 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 760 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 1016 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 632 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |