# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256293 | Bruteforceman | Progression (NOI20_progression) | C++11 | 1457 ms | 60664 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 maxn = 3e5 + 10;
const long long inf = 1e16;
long long a[maxn];
int arr[maxn];
int n;
struct node {
long long sum, lazyadd, lazyass;
long long left, right;
int pre, suf, opt, sz;
} t[maxn * 4], zero;
void addNode(node &p, long long val) {
p.left += val;
p.right += val;
p.sum += val * p.sz;
if(p.lazyass == inf) {
p.lazyadd += val;
} else {
p.lazyass += val;
}
}
void assNode(node &p, long long val) {
p.left = val;
p.right = val;
p.sum = val * p.sz;
p.opt = p.pre = p.suf = p.sz;
p.lazyadd = 0;
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... |