oj.uz

Submission #880371

# Submission time Handle Problem Language Result Execution time Memory
880371 2023-11-29T08:37:27 Z JakobZorz Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 92 ms 12436 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second

void solve(){
    int n,q,s,t;
    cin>>n>>q>>s>>t;
    vector<int>arr(n+1);
    for(int&i:arr)
        cin>>i;
    vector<ll>diff(n);
    ll res=0;
    for(int i=0;i<n;i++){
        diff[i]=arr[i+1]-arr[i];
        if(diff[i]>0){
            res-=diff[i]*s;
        }else{
            res-=diff[i]*t;
        }
    }
    
    while(q--){
        int l,r,x;
        cin>>l>>r>>x;
        l--;
        //if(l!=-1){
            if(diff[l]>0){
                res+=diff[l]*s;
            }else{
                res+=diff[l]*t;
            }
            diff[l]+=x;
            if(diff[l]>0){
                res-=diff[l]*s;
            }else{
                res-=diff[l]*t;
            }
        //}
        
        if(r!=n){
            if(diff[r]>0){
                res+=diff[r]*s;
            }else{
                res+=diff[r]*t;
            }
            diff[r]-=x;
            if(diff[r]>0){
                res-=diff[r]*s;
            }else{
                res-=diff[r]*t;
            }
        }
        
        cout<<res<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}

/*
 
3 5 1 2
0 4 1 8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
 
 */

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 9556 KB Output is correct
2 Correct 91 ms 10140 KB Output is correct
3 Correct 71 ms 10700 KB Output is correct
4 Correct 68 ms 10164 KB Output is correct
5 Correct 69 ms 11324 KB Output is correct
6 Correct 64 ms 10316 KB Output is correct
7 Correct 65 ms 10296 KB Output is correct
8 Correct 72 ms 10992 KB Output is correct
9 Correct 85 ms 11332 KB Output is correct
10 Correct 70 ms 10060 KB Output is correct
11 Correct 58 ms 10296 KB Output is correct
12 Correct 60 ms 11036 KB Output is correct
13 Correct 60 ms 11216 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 70 ms 9556 KB Output is correct
23 Correct 91 ms 10140 KB Output is correct
24 Correct 71 ms 10700 KB Output is correct
25 Correct 68 ms 10164 KB Output is correct
26 Correct 69 ms 11324 KB Output is correct
27 Correct 64 ms 10316 KB Output is correct
28 Correct 65 ms 10296 KB Output is correct
29 Correct 72 ms 10992 KB Output is correct
30 Correct 85 ms 11332 KB Output is correct
31 Correct 70 ms 10060 KB Output is correct
32 Correct 58 ms 10296 KB Output is correct
33 Correct 60 ms 11036 KB Output is correct
34 Correct 60 ms 11216 KB Output is correct
35 Correct 69 ms 9552 KB Output is correct
36 Correct 71 ms 11004 KB Output is correct
37 Correct 87 ms 11812 KB Output is correct
38 Correct 72 ms 11696 KB Output is correct
39 Correct 73 ms 11608 KB Output is correct
40 Correct 92 ms 11604 KB Output is correct
41 Correct 72 ms 11464 KB Output is correct
42 Correct 72 ms 11644 KB Output is correct
43 Correct 71 ms 10832 KB Output is correct
44 Correct 73 ms 11272 KB Output is correct
45 Correct 71 ms 11344 KB Output is correct
46 Correct 72 ms 12436 KB Output is correct
47 Correct 62 ms 10952 KB Output is correct
48 Correct 62 ms 11008 KB Output is correct
49 Correct 62 ms 10064 KB Output is correct
50 Correct 60 ms 10876 KB Output is correct
51 Correct 62 ms 11092 KB Output is correct
52 Correct 76 ms 10960 KB Output is correct