# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986501 | boris_mihov | Fish 3 (JOI24_fish3) | C++17 | 584 ms | 62232 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 <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
typedef long long llong;
const int MAXN = 300000 + 10;
const llong INF = 4e18;
int n, q;
llong d;
struct SegmentTree
{
struct Node
{
llong sumD;
llong minH;
llong lazy;
Node()
{
sumD = minH = lazy = 0;
}
friend Node operator + (const Node &left, const Node &right)
{
Node result;
result.sumD = left.sumD + right.sumD;
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... |