oj.uz

Submission #493166

# Submission time Handle Problem Language Result Execution time Memory
493166 2021-12-10T08:30:37 Z Biaz Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 128 ms 11076 KB 
#include <bits/stdc++.h>
#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=200005;
const int M=1000005;
const int MOD=1000000007;//998244353;
const int INF=1000000000000000000;//2147483647;
 
int n,q,S,T;
int a[N],b[N];
/*int calc1(int x,int y){
    if (x<0&&y>0)
        return abs(x)*T+y*S;
    else if (y<0)
        return abs(y-x)*T;
    else return (y-x)*S;
}
int calc2(int x,int y){
    if (y<0&&x>0)
        return abs(y)*T+x*S;
    else if (x<0)
        return abs(x-y)*T;
    else
}*/
inline void sol(){
    cin >>n>>q>>S>>T;
    for (int i=0;i<=n;i++)
        cin >>a[i];
    for (int i=1;i<=n;i++)
        b[i]=a[i]-a[i-1];
    int res=0;
    for (int i=1;i<=n;i++)
        if (a[i]>a[i-1])
            res+=(a[i]-a[i-1])*S;
        else res-=(a[i-1]-a[i])*T;
    for (int i=0,l,r,x;i<q;i++){
        cin >>l>>r>>x;
        if (b[l]<0) res-=b[l]*T;
        else res-=b[l]*S;
        if (r!=n){
            if (b[r+1]<0) res-=b[r+1]*T;
            else res-=b[r+1]*S;
        }
        b[l]+=x;
        if (b[l]<0) res+=b[l]*T;
        else res+=b[l]*S;
        b[r+1]-=x;
        if (r!=n){
            if (b[r+1]<0) res+=b[r+1]*T;
            else res+=b[r+1]*S;
        }
        //for (int j=1;j<=n;j++) cout <<b[j]<<' ';
        cout <<-res<<'\n';
    }
}
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 9108 KB Output is correct
2 Correct 109 ms 8644 KB Output is correct
3 Correct 97 ms 9156 KB Output is correct
4 Correct 109 ms 8696 KB Output is correct
5 Correct 112 ms 9924 KB Output is correct
6 Correct 88 ms 8772 KB Output is correct
7 Correct 81 ms 8748 KB Output is correct
8 Correct 98 ms 9516 KB Output is correct
9 Correct 94 ms 9848 KB Output is correct
10 Correct 98 ms 8644 KB Output is correct
11 Correct 81 ms 8780 KB Output is correct
12 Correct 89 ms 9560 KB Output is correct
13 Correct 80 ms 9736 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 408 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 99 ms 9108 KB Output is correct
23 Correct 109 ms 8644 KB Output is correct
24 Correct 97 ms 9156 KB Output is correct
25 Correct 109 ms 8696 KB Output is correct
26 Correct 112 ms 9924 KB Output is correct
27 Correct 88 ms 8772 KB Output is correct
28 Correct 81 ms 8748 KB Output is correct
29 Correct 98 ms 9516 KB Output is correct
30 Correct 94 ms 9848 KB Output is correct
31 Correct 98 ms 8644 KB Output is correct
32 Correct 81 ms 8780 KB Output is correct
33 Correct 89 ms 9560 KB Output is correct
34 Correct 80 ms 9736 KB Output is correct
35 Correct 93 ms 8140 KB Output is correct
36 Correct 96 ms 9672 KB Output is correct
37 Correct 103 ms 10408 KB Output is correct
38 Correct 95 ms 10256 KB Output is correct
39 Correct 104 ms 10180 KB Output is correct
40 Correct 101 ms 10276 KB Output is correct
41 Correct 96 ms 10080 KB Output is correct
42 Correct 128 ms 10200 KB Output is correct
43 Correct 107 ms 9416 KB Output is correct
44 Correct 99 ms 9896 KB Output is correct
45 Correct 108 ms 9936 KB Output is correct
46 Correct 106 ms 11076 KB Output is correct
47 Correct 82 ms 9440 KB Output is correct
48 Correct 88 ms 9424 KB Output is correct
49 Correct 91 ms 8520 KB Output is correct
50 Correct 84 ms 9284 KB Output is correct
51 Correct 91 ms 9652 KB Output is correct
52 Correct 79 ms 9508 KB Output is correct