oj.uz

Submission #329842

# Submission time Handle Problem Language Result Execution time Memory
329842 2020-11-22T20:51:02 Z Sho10 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 146 ms 13164 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a[200005],d[200005],q,s,t;
int32_t main(){
CODE_START;
cin>>n>>q>>s>>t;
for(ll i=0;i<=n;i++)
{
cin>>a[i];
if(i){
d[i]=a[i]-a[i-1];
}
}
ll ans=0;
for(ll i=1;i<=n;i++)
{
    if(d[i]>0){
        ans-=s*d[i];
    }else {
    ans-=t*d[i];
    }
}
while(q--){
    ll l,r,x;
    cin>>l>>r>>x;
    if(d[l]>0){
        ans+=d[l]*s;
    }else {
    ans+=d[l]*t;
    }
    d[l]+=x;
    if(d[l]>0){
        ans-=d[l]*s;
    }else {
    ans-=d[l]*t;
    }
    if(r<n){
        if(d[r+1]>0){
            ans+=d[r+1]*s;
        }else {
        ans+=d[r+1]*t;
    }
    d[r+1]-=x;
    if(d[r+1]>0){
        ans-=d[r+1]*s;
    }else ans-=d[r+1]*t;
}
cout<<ans<<endl;
}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 6 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 121 ms 10348 KB Output is correct
2 Correct 119 ms 10988 KB Output is correct
3 Correct 130 ms 11652 KB Output is correct
4 Correct 122 ms 10988 KB Output is correct
5 Correct 122 ms 12140 KB Output is correct
6 Correct 108 ms 11244 KB Output is correct
7 Correct 103 ms 11116 KB Output is correct
8 Correct 123 ms 11884 KB Output is correct
9 Correct 124 ms 12268 KB Output is correct
10 Correct 123 ms 11116 KB Output is correct
11 Correct 97 ms 11116 KB Output is correct
12 Correct 100 ms 11936 KB Output is correct
13 Correct 99 ms 12012 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 6 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 121 ms 10348 KB Output is correct
23 Correct 119 ms 10988 KB Output is correct
24 Correct 130 ms 11652 KB Output is correct
25 Correct 122 ms 10988 KB Output is correct
26 Correct 122 ms 12140 KB Output is correct
27 Correct 108 ms 11244 KB Output is correct
28 Correct 103 ms 11116 KB Output is correct
29 Correct 123 ms 11884 KB Output is correct
30 Correct 124 ms 12268 KB Output is correct
31 Correct 123 ms 11116 KB Output is correct
32 Correct 97 ms 11116 KB Output is correct
33 Correct 100 ms 11936 KB Output is correct
34 Correct 99 ms 12012 KB Output is correct
35 Correct 137 ms 10604 KB Output is correct
36 Correct 121 ms 11884 KB Output is correct
37 Correct 128 ms 12780 KB Output is correct
38 Correct 126 ms 12524 KB Output is correct
39 Correct 124 ms 12524 KB Output is correct
40 Correct 132 ms 12652 KB Output is correct
41 Correct 126 ms 12396 KB Output is correct
42 Correct 123 ms 12396 KB Output is correct
43 Correct 131 ms 11756 KB Output is correct
44 Correct 128 ms 12268 KB Output is correct
45 Correct 125 ms 12268 KB Output is correct
46 Correct 146 ms 13164 KB Output is correct
47 Correct 103 ms 11756 KB Output is correct
48 Correct 106 ms 11756 KB Output is correct
49 Correct 112 ms 10988 KB Output is correct
50 Correct 119 ms 11628 KB Output is correct
51 Correct 100 ms 12012 KB Output is correct
52 Correct 100 ms 11756 KB Output is correct