# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082424 | PanosPask | Towns (IOI15_towns) | C++14 | 14 ms | 472 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 <vector>
using namespace std;
int N;
int diameter = 0;
int hubdist = 0;
int v, s, t;
vector<int> d1;
vector<int> d2;
void findAll(int u, vector<int>& d)
{
d.resize(N);
d[u] = 0;
for (int i = 0; i < N; i++) {
if (i != u) {
d[i] = getDistance(u, i);
}
}
}
int getPos(vector<int>& d)
{
int m_i = -1;
int m_v = -1;
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... |