# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111443 | giaminh2211 | Valley (BOI19_valley) | C++14 | 199 ms | 37704 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>
#define fi first
#define se second
using namespace std;
using ll=long long;
const int N=1e5+13;
struct Segtree{
ll st[N << 2];
ll lazy[N << 2];
void fix(int id, int l, int r){
if(!lazy[id]) return;
st[id] += lazy[id];
if(l!=r){
lazy[id << 1] += lazy[id];
lazy[id << 1 | 1] += lazy[id];
}
lazy[id]=0;
}
void update(int id, int l, int r, int u, int v, ll val){
fix(id, l, r);
if(l > v || r < u) return;
if(u<=l && r<=v){
lazy[id]+=val;
fix(id, l, r);
return;
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... |