oj.uz

Submission #646003

# Submission time Handle Problem Language Result Execution time Memory
646003 2022-09-28T13:20:41 Z JJAnawat Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 115 ms 14664 KB 
#include<bits/stdc++.h>

using namespace std;

long long n,q,s,t;
long long ar[200005],dif[200005],fw[200005];

void upd(long long x,long long val){
    for(;x<=200000;x+=x&-x)
        fw[x]+=val;
}

long long qr(long long x){
    long long sum=0;
    for(;x>=1;x-=x&-x)
        sum+=fw[x];
    return sum;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> q >> s >> t >> ar[0];
    for(long long i=1;i<=n;i++){
        cin >> ar[i];
        dif[i]=ar[i]-ar[i-1];
        if(dif[i]>0){
            upd(i,-dif[i]*s);
        }
        else{
            upd(i,-dif[i]*t);
        }
    }
    long long l,r,x;
    while(q--){
        cin >> l >> r >> x;
        if(dif[l]>0){
            if(dif[l]+x>0){
                dif[l]+=x;
                upd(l,-x*s);
            }
            else{//+ -> -
                upd(l,dif[l]*s-(dif[l]+x)*t);
                dif[l]+=x;

            }
        }
        else{//dif[l]<0
            if(dif[l]+x>0){
                upd(l,dif[l]*t-(x+dif[l])*s);
                dif[l]+=x;
                //cout << x << ' ' << dif[l] << ' ' << "hello\n";
            }
            else{
                dif[l]+=x;
                upd(l,-x*t);
            }
        }
        if(r!=n){
           r++;
        if(dif[r]>0){
            if(dif[r]-x>0){
                dif[r]-=x;
                upd(r,x*s);
            }
            else{//+ -> -
                upd(r,dif[r]*s-(dif[r]-x)*t);
                dif[r]-=x;
            }
        }
        else{//- -> +
            if(dif[r]-x>0){
                upd(r,dif[r]*t-(dif[r]-x)*s);
                dif[r]-=x;
            }
            else{//- -> -
                dif[r]-=x;
                upd(r,x*t);
            }
        }
        }

        long long ans=qr(n);
        cout << ans << '\n';
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 6348 KB Output is correct
2 Correct 106 ms 7172 KB Output is correct
3 Correct 105 ms 7756 KB Output is correct
4 Correct 103 ms 12424 KB Output is correct
5 Correct 101 ms 13516 KB Output is correct
6 Correct 94 ms 12588 KB Output is correct
7 Correct 85 ms 12568 KB Output is correct
8 Correct 101 ms 13368 KB Output is correct
9 Correct 107 ms 13672 KB Output is correct
10 Correct 111 ms 12364 KB Output is correct
11 Correct 90 ms 12492 KB Output is correct
12 Correct 83 ms 13224 KB Output is correct
13 Correct 84 ms 13356 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 428 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 101 ms 6348 KB Output is correct
23 Correct 106 ms 7172 KB Output is correct
24 Correct 105 ms 7756 KB Output is correct
25 Correct 103 ms 12424 KB Output is correct
26 Correct 101 ms 13516 KB Output is correct
27 Correct 94 ms 12588 KB Output is correct
28 Correct 85 ms 12568 KB Output is correct
29 Correct 101 ms 13368 KB Output is correct
30 Correct 107 ms 13672 KB Output is correct
31 Correct 111 ms 12364 KB Output is correct
32 Correct 90 ms 12492 KB Output is correct
33 Correct 83 ms 13224 KB Output is correct
34 Correct 84 ms 13356 KB Output is correct
35 Correct 104 ms 11944 KB Output is correct
36 Correct 108 ms 13416 KB Output is correct
37 Correct 109 ms 14216 KB Output is correct
38 Correct 110 ms 13932 KB Output is correct
39 Correct 115 ms 14116 KB Output is correct
40 Correct 109 ms 13976 KB Output is correct
41 Correct 107 ms 13852 KB Output is correct
42 Correct 115 ms 14016 KB Output is correct
43 Correct 105 ms 13152 KB Output is correct
44 Correct 107 ms 13572 KB Output is correct
45 Correct 107 ms 13668 KB Output is correct
46 Correct 106 ms 14664 KB Output is correct
47 Correct 88 ms 13180 KB Output is correct
48 Correct 94 ms 13212 KB Output is correct
49 Correct 92 ms 12304 KB Output is correct
50 Correct 89 ms 13000 KB Output is correct
51 Correct 93 ms 13536 KB Output is correct
52 Correct 83 ms 13192 KB Output is correct