# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995596 | asdasdqwer | Diversity (CEOI21_diversity) | C++14 | 244 ms | 46160 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;
#define int int64_t
#define pii array<int,2>
struct Segtree {
vector<int> seg, lz;
int n;
Segtree(int sz) {
n=1;
while (n<sz)n*=2;
seg.assign(2*n,0);
lz.assign(2*n,0);
}
void pushdown(int x, int l) {
if (lz[x] == 0) return;
lz[2*x+1] += lz[x];
lz[2*x+2] += lz[x];
seg[2*x+1] += (l/2) * lz[x];
seg[2*x+2] += (l/2) * lz[x];
lz[x]=0;
}
void inc(int l, int r, int v, int x, int lx, int rx) {
if (lx >= r || rx <= l) return;
if (lx >= l && rx <= r) {
seg[x] += (rx-lx) * v;
lz[x] += v;
# | 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... |