oj.uz

Submission #885493

# Submission time Handle Problem Language Result Execution time Memory
885493 2023-12-09T20:42:51 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 93 ms 15672 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 500005
#define oo 1e18
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
 
ll t,n,a[MAX],s,q,k,p,f;
int main(){
    fast_in
    cin>>n>>q>>s>>t;vpll v;ll r=0;
    for(int i=0;i<=n;i++){
        cin>>a[i];
        if(i!=0){
            v.push_back({a[i-1],a[i]});
            if(a[i]-a[i-1]>0)r+=(a[i]-a[i-1])*-s;
            else             r+=(a[i]-a[i-1])*-t;
        }
    }
    for(int i=0;i<q;i++){
        cin>>p>>f>>k;
        if(p>0){
            if(v[p-1].S-v[p-1].F>0)r-=(v[p-1].S-v[p-1].F)*-s;
            else                   r-=(v[p-1].S-v[p-1].F)*-t;
            v[p-1].S+=k;
            if(v[p-1].S-v[p-1].F>0)r+=(v[p-1].S-v[p-1].F)*-s;
            else                   r+=(v[p-1].S-v[p-1].F)*-t;
        }
        if(f<n){
            if(v[f].S-v[f].F>0)r-=(v[f].S-v[f].F)*-s;
            else               r-=(v[f].S-v[f].F)*-t;
            v[f].F+=k;
            if(v[f].S-v[f].F>0)r+=(v[f].S-v[f].F)*-s;
            else               r+=(v[f].S-v[f].F)*-t;
        }
        cout<<r<<"\n";
    }

    
return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 552 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 564 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 536 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 78 ms 7892 KB Output is correct
2 Correct 73 ms 7860 KB Output is correct
3 Correct 75 ms 8756 KB Output is correct
4 Correct 72 ms 8660 KB Output is correct
5 Correct 74 ms 8384 KB Output is correct
6 Correct 65 ms 9832 KB Output is correct
7 Correct 65 ms 13756 KB Output is correct
8 Correct 77 ms 14280 KB Output is correct
9 Correct 85 ms 14528 KB Output is correct
10 Correct 75 ms 13736 KB Output is correct
11 Correct 65 ms 13760 KB Output is correct
12 Correct 79 ms 14524 KB Output is correct
13 Correct 63 ms 15256 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 400 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 552 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 564 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 536 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 78 ms 7892 KB Output is correct
23 Correct 73 ms 7860 KB Output is correct
24 Correct 75 ms 8756 KB Output is correct
25 Correct 72 ms 8660 KB Output is correct
26 Correct 74 ms 8384 KB Output is correct
27 Correct 65 ms 9832 KB Output is correct
28 Correct 65 ms 13756 KB Output is correct
29 Correct 77 ms 14280 KB Output is correct
30 Correct 85 ms 14528 KB Output is correct
31 Correct 75 ms 13736 KB Output is correct
32 Correct 65 ms 13760 KB Output is correct
33 Correct 79 ms 14524 KB Output is correct
34 Correct 63 ms 15256 KB Output is correct
35 Correct 73 ms 13856 KB Output is correct
36 Correct 81 ms 14784 KB Output is correct
37 Correct 78 ms 15076 KB Output is correct
38 Correct 83 ms 14988 KB Output is correct
39 Correct 87 ms 15288 KB Output is correct
40 Correct 76 ms 14880 KB Output is correct
41 Correct 77 ms 14780 KB Output is correct
42 Correct 80 ms 14780 KB Output is correct
43 Correct 86 ms 14460 KB Output is correct
44 Correct 76 ms 14524 KB Output is correct
45 Correct 93 ms 14708 KB Output is correct
46 Correct 77 ms 15672 KB Output is correct
47 Correct 73 ms 14780 KB Output is correct
48 Correct 81 ms 14760 KB Output is correct
49 Correct 71 ms 13500 KB Output is correct
50 Correct 64 ms 14076 KB Output is correct
51 Correct 78 ms 14268 KB Output is correct
52 Correct 63 ms 14080 KB Output is correct