# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931535 | AnasAAF | Foehn Phenomena (JOI17_foehn_phenomena) | C++17 | 384 ms | 28736 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 ll long long
#define endl '\n'
#define float double
#define ld long double
ll N = 2e5+10;
ll n, S, T, Q;
vector<ll>v(N);
vector<ll>tree(6*N);
vector<ll>lazy(6*N);
void update(int node, ll l, ll r, ll ql, ll qr, ll val){
//cout<<node<<" "<<l<<" "<<r<<" "<<ql<<" "<<qr<<" "<<val<<endl;
if(lazy[node]!=0){
tree[node]+=lazy[node]*(r-l+1);
if(l!=r){
lazy[node*2]+=lazy[node];
lazy[node*2+1]+=lazy[node];
}
lazy[node]=0;
}
if(ql>r || qr<l)return;
if(ql<=l && qr>=r){
tree[node]+=(val*(r-l+1));
//cout<<"BINGO"<<endl;
if(l!=r){
lazy[node*2]+=val;
lazy[node*2+1]+=val;
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... |