oj.uz

Submission #339450

# Submission time Handle Problem Language Result Execution time Memory
339450 2020-12-25T10:39:08 Z bigDuck Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 411 ms 15744 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

int n, q, s, t, a[200010];
int neg=0, pos=0;


int seg[800010];

void lazy(int v){
seg[2*v]+=seg[v]; seg[2*v+1]+=seg[v];
seg[v]=0;
return;
}



void update(int v, int tl, int tr, int l, int r, int x){
    if(l>r){
        return;
    }
    if( (l==tl) && (r==tr) ){
        seg[v]+=x; return;
    }
    lazy(v);
    int mid=(tl+tr)>>1ll;
    update(v*2, tl, mid, l,min(r, mid), x); update(2*v+1, mid+1, tr, max(l, mid+1), r, x);
}



int query(int v, int tl, int tr, int p){

    if(tl==tr){
        return seg[v];
    }

    int mid=(tl+tr)>>1ll;
    lazy(v);
    if(p<=mid){
        return query(2*v, tl, mid, p);
    }
    else{
        return query(2*v+1, mid+1, tr, p);
    }
}





int32_t main(){
INIT
cin>>n>>q>>s>>t;
for(int i=0; i<=n; i++){
    cin>>a[i];
    if(i>0){
        if( (a[i])>a[i-1] ){
            pos+=(a[i]-a[i-1]);
        }
        else{
            neg+=(a[i]-a[i-1]);
        }
    }
}



//cout<<neg<<" "<<pos<<"\n";

while(q--){
    int l, r, x; cin>>l>>r>>x;

    int a1=a1=( (l-1)>0 )?(query(1, 1, n, l-1)+a[l-1]):(0), a2=query(1, 1, n, l)+a[l];
    int a3=query(1, 1, n, r)+a[r], a4=query(1, 1, n, min(r+1, n))+a[min(r+1, n)];
    //cout<<a1<<" "<<a2<<" "<<a3<<" "<<a4<<"\n";
    if( (a2>a1) ){
        pos-=a2-a1;
    }
    else{
        neg-=a2-a1;
    }
    if( (a4>a3) ){
        pos-=a4-a3;
    }
    else{
        neg-=a4-a3;
    }


    update(1, 1, n, l, r, x);
    a1=( (l-1)>0 )?(query(1, 1, n, l-1)+a[l-1]):(0), a2=query(1, 1, n, l)+a[l];
    a3=query(1, 1, n, r)+a[r], a4=query(1, 1, n, min(r+1, n))+a[min(r+1, n)];

    if( (a2>a1) ){
        pos+=a2-a1;
    }
    else{
        neg+=a2-a1;
    }
    if( (a4>a3) ){
        pos+=a4-a3;
    }
    else{
        neg+=a4-a3;
    }
    //cout<<a1<<" "<<a2<<" "<<a3<<" "<<a4<<"\n";
    cout<<(t*(-neg)-s*pos)<<"\n";
}



return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int32_t main()':
foehn_phenomena.cpp:83:14: warning: operation on 'a1' may be undefined [-Wsequence-point]
   83 |     int a1=a1=( (l-1)>0 )?(query(1, 1, n, l-1)+a[l-1]):(0), a2=query(1, 1, n, l)+a[l];
      |            ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 393 ms 12908 KB Output is correct
2 Correct 404 ms 13932 KB Output is correct
3 Correct 398 ms 14060 KB Output is correct
4 Correct 408 ms 13572 KB Output is correct
5 Correct 398 ms 14748 KB Output is correct
6 Correct 261 ms 9580 KB Output is correct
7 Correct 256 ms 9580 KB Output is correct
8 Correct 378 ms 14444 KB Output is correct
9 Correct 378 ms 14884 KB Output is correct
10 Correct 378 ms 13676 KB Output is correct
11 Correct 239 ms 9452 KB Output is correct
12 Correct 260 ms 10232 KB Output is correct
13 Correct 347 ms 10476 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 393 ms 12908 KB Output is correct
23 Correct 404 ms 13932 KB Output is correct
24 Correct 398 ms 14060 KB Output is correct
25 Correct 408 ms 13572 KB Output is correct
26 Correct 398 ms 14748 KB Output is correct
27 Correct 261 ms 9580 KB Output is correct
28 Correct 256 ms 9580 KB Output is correct
29 Correct 378 ms 14444 KB Output is correct
30 Correct 378 ms 14884 KB Output is correct
31 Correct 378 ms 13676 KB Output is correct
32 Correct 239 ms 9452 KB Output is correct
33 Correct 260 ms 10232 KB Output is correct
34 Correct 347 ms 10476 KB Output is correct
35 Correct 400 ms 13064 KB Output is correct
36 Correct 401 ms 14572 KB Output is correct
37 Correct 406 ms 15212 KB Output is correct
38 Correct 411 ms 15112 KB Output is correct
39 Correct 410 ms 15312 KB Output is correct
40 Correct 398 ms 15084 KB Output is correct
41 Correct 407 ms 14828 KB Output is correct
42 Correct 404 ms 14956 KB Output is correct
43 Correct 393 ms 14316 KB Output is correct
44 Correct 400 ms 14700 KB Output is correct
45 Correct 394 ms 14828 KB Output is correct
46 Correct 409 ms 15744 KB Output is correct
47 Correct 263 ms 10216 KB Output is correct
48 Correct 207 ms 10220 KB Output is correct
49 Correct 396 ms 13420 KB Output is correct
50 Correct 239 ms 10092 KB Output is correct
51 Correct 255 ms 10476 KB Output is correct
52 Correct 381 ms 10348 KB Output is correct