# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167712 | faremy | Towns (IOI15_towns) | C++14 | 21 ms | 892 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 <algorithm>
#include <vector>
struct Leaf
{
int toLeft, toRight, toDiam, maxDist, index;
bool operator <(const Leaf &other) const
{
return (toLeft < other.toLeft);
}
};
struct Hub
{
Hub(int l, int r) : left(l), right(r) {}
int left, right;
};
const int MAXN = 110;
int distToZero[MAXN];
Leaf towns[MAXN];
std::vector<Hub> hubs;
std::vector<int> candidates;
std::vector<int> equiv[MAXN];
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... |