oj.uz

Submission #951146

# Submission time Handle Problem Language Result Execution time Memory
951146 2024-03-21T08:47:49 Z tnknguyen_ Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 135 ms 19540 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n' 

const int sz = 2e5 + 5;
vector<int> qr[sz];
long long a[sz], d[sz];
int n, q, s, t;

// ------------ FUNCTIONS -----------
struct BIT{
    vector<int> f;
    int n = 2e5 + 5;

    BIT(){
        f.assign(n, 0);
    }

    void update(int i, int val){
        while(i < n){
            f[i] += val;
            i += (i & -i);
        }
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans += f[i];
            i -= (i & -i);
        }
        return ans;
    }
};

int cost(int x, int y){
    return (y > x ? -s*(y - x) : t*(x - y));
}

// ------------ SUBTASKS ------------
namespace SUB1{
    bool ok(){
        return (n <= 2000 && q <= 2000);
    }

    void solve(){
        for(int i=1; i<=q; ++i){
            int l = qr[i][0], r = qr[i][1], x = qr[i][2];
            int ans = 0;
            for(int j=1; j<=n; ++j){
                if(j >= l && j <= r){
                    a[j] += x;
                }
                if(a[j-1] < a[j]){
                    ans -= (a[j] - a[j-1])*s;
                }
                else{
                    ans += (a[j-1] - a[j])*t;
                }
            }
            cout<<ans<<endl;
        }

        //----------------------
        exit(0);
    }
}

namespace SUB23{
    void solve(){
        BIT bit;
        int ans = 0;
        for(int i=1; i<=n; ++i){
            bit.update(i, a[i]);
            bit.update(i+1, -a[i]);
            ans += cost(a[i-1], a[i]);
        }

        for(int i=1; i<=q; ++i){
            int l = qr[i][0], r = qr[i][1], x = qr[i][2];

            ans -= cost(bit.get(l-1), bit.get(l));
            bit.update(l, x);
            ans += cost(bit.get(l-1), bit.get(l));

            if(r + 1 <= n){
                ans -= cost(bit.get(r), bit.get(r+1));
                bit.update(r+1, -x);
                ans += cost(bit.get(r), bit.get(r+1));
            }
            cout<<ans<<endl;
        }

        //--------------------
        exit(0);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    //freopen("main.inp","r",stdin);
    //freopen("main.out","w",stdout);

    cin>>n>>q>>s>>t;
    for(int i=0; i<=n; ++i){
        cin>>a[i];
    }
    
    for(int i=1; i<=q; ++i){
        int l, r, x;
        cin>>l>>r>>x;
        qr[i] = {l, r, x};
    }

    if(SUB1::ok()){
        SUB1::solve();
        return 0;
    }
    SUB23::solve();

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8024 KB Output is correct
2 Correct 11 ms 8192 KB Output is correct
3 Correct 11 ms 8028 KB Output is correct
4 Correct 11 ms 8024 KB Output is correct
5 Correct 11 ms 8024 KB Output is correct
6 Correct 11 ms 8028 KB Output is correct
7 Correct 11 ms 8028 KB Output is correct
8 Correct 11 ms 8028 KB Output is correct
9 Correct 11 ms 8028 KB Output is correct
10 Correct 11 ms 8028 KB Output is correct
11 Correct 10 ms 8028 KB Output is correct
12 Correct 10 ms 8024 KB Output is correct
13 Correct 7 ms 8028 KB Output is correct
14 Correct 8 ms 8028 KB Output is correct
15 Correct 10 ms 8028 KB Output is correct
16 Correct 8 ms 8280 KB Output is correct
17 Correct 9 ms 8172 KB Output is correct
18 Correct 8 ms 8196 KB Output is correct
19 Correct 2 ms 8028 KB Output is correct
20 Correct 2 ms 8028 KB Output is correct
21 Correct 2 ms 8028 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 17368 KB Output is correct
2 Correct 105 ms 18000 KB Output is correct
3 Correct 106 ms 18512 KB Output is correct
4 Correct 106 ms 17752 KB Output is correct
5 Correct 102 ms 18264 KB Output is correct
6 Correct 77 ms 18876 KB Output is correct
7 Correct 78 ms 18768 KB Output is correct
8 Correct 103 ms 18756 KB Output is correct
9 Correct 102 ms 19028 KB Output is correct
10 Correct 98 ms 17748 KB Output is correct
11 Correct 79 ms 18940 KB Output is correct
12 Correct 77 ms 19280 KB Output is correct
13 Correct 76 ms 19492 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8024 KB Output is correct
2 Correct 11 ms 8192 KB Output is correct
3 Correct 11 ms 8028 KB Output is correct
4 Correct 11 ms 8024 KB Output is correct
5 Correct 11 ms 8024 KB Output is correct
6 Correct 11 ms 8028 KB Output is correct
7 Correct 11 ms 8028 KB Output is correct
8 Correct 11 ms 8028 KB Output is correct
9 Correct 11 ms 8028 KB Output is correct
10 Correct 11 ms 8028 KB Output is correct
11 Correct 10 ms 8028 KB Output is correct
12 Correct 10 ms 8024 KB Output is correct
13 Correct 7 ms 8028 KB Output is correct
14 Correct 8 ms 8028 KB Output is correct
15 Correct 10 ms 8028 KB Output is correct
16 Correct 8 ms 8280 KB Output is correct
17 Correct 9 ms 8172 KB Output is correct
18 Correct 8 ms 8196 KB Output is correct
19 Correct 2 ms 8028 KB Output is correct
20 Correct 2 ms 8028 KB Output is correct
21 Correct 2 ms 8028 KB Output is correct
22 Correct 122 ms 17368 KB Output is correct
23 Correct 105 ms 18000 KB Output is correct
24 Correct 106 ms 18512 KB Output is correct
25 Correct 106 ms 17752 KB Output is correct
26 Correct 102 ms 18264 KB Output is correct
27 Correct 77 ms 18876 KB Output is correct
28 Correct 78 ms 18768 KB Output is correct
29 Correct 103 ms 18756 KB Output is correct
30 Correct 102 ms 19028 KB Output is correct
31 Correct 98 ms 17748 KB Output is correct
32 Correct 79 ms 18940 KB Output is correct
33 Correct 77 ms 19280 KB Output is correct
34 Correct 76 ms 19492 KB Output is correct
35 Correct 113 ms 17592 KB Output is correct
36 Correct 106 ms 18944 KB Output is correct
37 Correct 106 ms 19540 KB Output is correct
38 Correct 107 ms 19540 KB Output is correct
39 Correct 108 ms 19392 KB Output is correct
40 Correct 108 ms 19540 KB Output is correct
41 Correct 105 ms 19284 KB Output is correct
42 Correct 104 ms 19284 KB Output is correct
43 Correct 106 ms 18668 KB Output is correct
44 Correct 104 ms 19024 KB Output is correct
45 Correct 102 ms 18744 KB Output is correct
46 Correct 135 ms 19428 KB Output is correct
47 Correct 81 ms 19536 KB Output is correct
48 Correct 81 ms 19516 KB Output is correct
49 Correct 98 ms 18580 KB Output is correct
50 Correct 80 ms 19520 KB Output is correct
51 Correct 77 ms 19536 KB Output is correct
52 Correct 95 ms 19452 KB Output is correct