# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123899 | sebinkim | Two Antennas (JOI19_antennas) | C++14 | 860 ms | 39432 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;
struct segtree{
int T[606060], L[606060], C[606060];
void spread(int p)
{
L[p << 1] = max(L[p << 1], L[p]);
T[p << 1] = max(T[p << 1], L[p << 1] - C[p << 1]);
L[p << 1 | 1] = max(L[p << 1 | 1], L[p]);
T[p << 1 | 1] = max(T[p << 1 | 1], L[p << 1 | 1] - C[p << 1 | 1]);
L[p] = 0;
}
void update(int p)
{
C[p] = min(C[p << 1], C[p << 1 | 1]);
T[p] = max(T[p << 1], T[p << 1 | 1]);
}
void init(int p, int s, int e)
{
T[p] = -1e9, L[p] = 0, C[p] = 2e9;
if(s != e){
init(p << 1, s, s + e >> 1);
init(p << 1 | 1, (s + e >> 1) + 1, e);
}
}
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... |