# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470051 | flashmt | Dynamic Diameter (CEOI19_diameter) | C++17 | 4093 ms | 260028 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 <bits/stdc++.h>
using namespace std;
const int N = 100100;
struct Edge
{
int x, y;
long long c;
};
struct SegmentTree
{
int low, mid, high;
long long v, save;
SegmentTree *l, *r;
SegmentTree(int low, int high, long long initialDist[]): low(low), high(high)
{
mid = (low + high) / 2;
save = 0;
if (low == high) v = initialDist[low];
else
{
l = new SegmentTree(low, mid, initialDist);
r = new SegmentTree(mid + 1, high, initialDist);
v = max(l->v, r->v);
}
}
void pushDown()
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... |