oj.uz

Submission #998521

# Submission time Handle Problem Language Result Execution time Memory
998521 2024-06-14T07:02:35 Z spensa Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 92 ms 14672 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int,int>
#define FOR(i, a, b) for(int i=(signed)(a); i<=(signed)(b); i++)
#define F0R(i, a) for(int i=(0); i<(signed)(a); i++)

const int MXN = 2e5 + 10;
ll arr[MXN] = {0};
ll updL[MXN] = {0};
ll updR[MXN] = {0};

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

    ll N, Q, S, T;
    cin>>N>>Q>>S>>T;

    ll ans = 0;
    cin>>arr[0]; //always zero
    FOR(i, 1, N){
        cin>>arr[i];
        if(arr[i-1]<arr[i]){
            ans -= S * abs(arr[i]-arr[i-1]);
        }
        else{
            ans += T * abs(arr[i]-arr[i-1]);
        }
    }

    // FOR(i, 1, N) cout<<arr[i]<<" ";
    // cout<<"\n";

    // cout<<"ans="<<ans<<"!";
    ll L, R, X;
    while(Q--){
        cin>>L>>R>>X;
        // upd[L]+=X;
        if(((arr[L-1]+updR[L-1])<(arr[L]+updL[L])) &&
            ((arr[L-1]+updR[L-1])>=(arr[L]+updL[L]+X)))
        {
            ans += (S * abs((arr[L-1]+updR[L-1])-(arr[L]+updL[L])));
            ans += (T * abs((arr[L-1]+updR[L-1])-(arr[L]+updL[L]+X)));
        }
        else if(((arr[L-1]+updR[L-1])>=(arr[L]+updL[L])) &&
            ((arr[L-1]+updR[L-1])<(arr[L]+updL[L]+X)))
        {
            ans-= (T * abs((arr[L-1]+updR[L-1])-(arr[L]+updL[L])));
            ans-= (S * abs((arr[L-1]+updR[L-1])-(arr[L]+updL[L]+X)));
        }
        else{
            if((arr[L-1]+updR[L-1])<(arr[L]+updL[L]+X)) ans -= (S*X);
            else ans -= (T*X);
        }

        if(R==N){
            updL[L]+=X;
            // if(L!=R) 
            updR[R]+=X;
            cout<<ans<<"\n";
            continue;
        }

        if(((arr[R]+updR[R])<(arr[R+1]+updL[R+1])) &&
            ((arr[R]+updR[R]+X)>=(arr[R+1]+updL[R+1])))
        {
            ans+= (S * abs((arr[R]+updR[R])-(arr[R+1]+updL[R+1])));
            ans+= (T * abs((arr[R]+updR[R]+X)-(arr[R+1]+updL[R+1])));
        }
        else if(((arr[R]+updR[R])>=(arr[R+1]+updL[R+1])) &&
            ((arr[R]+updR[R]+X)<(arr[R+1]+updL[R+1])))
        {
            ans-= (T * abs((arr[R]+updR[R])-(arr[R+1]+updL[R+1])));
            ans-= (S * abs((arr[R]+updR[R]+X)-(arr[R+1]+updL[R+1])));
        }
        else{
            if((arr[R]+updR[R]+X)<(arr[R+1]+updL[R+1])) ans += (S*X);
            else ans += (T*X);
            
        }

        updL[L]+=X;
        // if(L!=R) 
        updR[R]+=X;
        cout<<ans<<"\n";
    }

}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 480 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 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 67 ms 11860 KB Output is correct
2 Correct 68 ms 12500 KB Output is correct
3 Correct 72 ms 12992 KB Output is correct
4 Correct 61 ms 12368 KB Output is correct
5 Correct 67 ms 13576 KB Output is correct
6 Correct 55 ms 9600 KB Output is correct
7 Correct 57 ms 9576 KB Output is correct
8 Correct 69 ms 13540 KB Output is correct
9 Correct 75 ms 13776 KB Output is correct
10 Correct 67 ms 12372 KB Output is correct
11 Correct 54 ms 10320 KB Output is correct
12 Correct 54 ms 10244 KB Output is correct
13 Correct 53 ms 11344 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 480 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 67 ms 11860 KB Output is correct
23 Correct 68 ms 12500 KB Output is correct
24 Correct 72 ms 12992 KB Output is correct
25 Correct 61 ms 12368 KB Output is correct
26 Correct 67 ms 13576 KB Output is correct
27 Correct 55 ms 9600 KB Output is correct
28 Correct 57 ms 9576 KB Output is correct
29 Correct 69 ms 13540 KB Output is correct
30 Correct 75 ms 13776 KB Output is correct
31 Correct 67 ms 12372 KB Output is correct
32 Correct 54 ms 10320 KB Output is correct
33 Correct 54 ms 10244 KB Output is correct
34 Correct 53 ms 11344 KB Output is correct
35 Correct 79 ms 12120 KB Output is correct
36 Correct 67 ms 13392 KB Output is correct
37 Correct 71 ms 14160 KB Output is correct
38 Correct 73 ms 13908 KB Output is correct
39 Correct 70 ms 14160 KB Output is correct
40 Correct 87 ms 14156 KB Output is correct
41 Correct 73 ms 13824 KB Output is correct
42 Correct 73 ms 13904 KB Output is correct
43 Correct 92 ms 13136 KB Output is correct
44 Correct 68 ms 13676 KB Output is correct
45 Correct 65 ms 13652 KB Output is correct
46 Correct 68 ms 14672 KB Output is correct
47 Correct 61 ms 10952 KB Output is correct
48 Correct 56 ms 11096 KB Output is correct
49 Correct 57 ms 12368 KB Output is correct
50 Correct 52 ms 10948 KB Output is correct
51 Correct 55 ms 11208 KB Output is correct
52 Correct 52 ms 11092 KB Output is correct