oj.uz

Submission #998339

# Submission time Handle Problem Language Result Execution time Memory
998339 2024-06-13T16:01:45 Z dimashhh Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 353 ms 32848 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int  N = 3e5 + 30, MOD = 1e9 + 7;
#define int ll 
int n,a[N],q,s,f;
ll all = 0,add[N * 4];
struct node{
    ll sum = 0,l = 0,r = 0;
    bool empty = false;
}t[N * 4];
node merge(node a,node b){
    if(a.empty) return b;
    if(b.empty) return a;
    a.sum += b.sum;
    if(a.r < b.l){
        a.sum -= (b.l - a.r) * s;
    }else{
        a.sum += (a.r - b.l) * f;
    }
    a.r = b.r;
    return a;
}
void build(int v = 1,int tl = 1,int tr = n){
    if(tl == tr){
        t[v].l = t[v].r = a[tl];
        t[v].sum = 0;
    }else{
        int tm = (tl + tr) >> 1;
        build(v + v,tl,tm);
        build(v + v + 1,tm + 1,tr);
        t[v] = merge(t[v + v],t[v + v + 1]);
    }
}
void inc(int v,int val){
    t[v].l += val;
    t[v].r += val;
    add[v] += val;
}
void push(int v){
    if(add[v]){
        inc(v + v,add[v]);
        inc(v + v + 1,add[v]);
        add[v] = 0;
    }
}
void upd(int l,int r,int val,int v = 1,int tl = 1,int tr = n){
    if(l > r || tl > r || l > tr) return;
    if(tl >= l && tr <= r){
        inc(v,val);
    }else{
        push(v);
        int tm = (tl + tr) >> 1;
        upd(l,r,val,v+v,tl,tm);
        upd(l,r,val,v+v+1,tm+1,tr);
        t[v] = merge(t[v + v],t[v + v + 1]);
    }
}
void test(){
    cin >> n >> q >> s >> f;
    n++;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }
    build();
    // cout << t[1].sum << '\n';   
    while(q--){
        int l,r,x;
        cin >> l >> r >> x;
        l++;r++;
        // cout << l << ' ' << r << ' ' << x << '\n';
        upd(l,r,x);
        cout << t[1].sum << '\n';
    }
}
signed main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 27220 KB Output is correct
2 Correct 319 ms 26336 KB Output is correct
3 Correct 296 ms 28408 KB Output is correct
4 Correct 306 ms 26316 KB Output is correct
5 Correct 288 ms 28496 KB Output is correct
6 Correct 170 ms 23220 KB Output is correct
7 Correct 158 ms 23116 KB Output is correct
8 Correct 237 ms 27220 KB Output is correct
9 Correct 262 ms 29008 KB Output is correct
10 Correct 233 ms 27736 KB Output is correct
11 Correct 204 ms 23380 KB Output is correct
12 Correct 154 ms 23632 KB Output is correct
13 Correct 148 ms 23892 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 3 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 280 ms 27220 KB Output is correct
23 Correct 319 ms 26336 KB Output is correct
24 Correct 296 ms 28408 KB Output is correct
25 Correct 306 ms 26316 KB Output is correct
26 Correct 288 ms 28496 KB Output is correct
27 Correct 170 ms 23220 KB Output is correct
28 Correct 158 ms 23116 KB Output is correct
29 Correct 237 ms 27220 KB Output is correct
30 Correct 262 ms 29008 KB Output is correct
31 Correct 233 ms 27736 KB Output is correct
32 Correct 204 ms 23380 KB Output is correct
33 Correct 154 ms 23632 KB Output is correct
34 Correct 148 ms 23892 KB Output is correct
35 Correct 284 ms 25852 KB Output is correct
36 Correct 301 ms 27220 KB Output is correct
37 Correct 299 ms 29736 KB Output is correct
38 Correct 295 ms 27948 KB Output is correct
39 Correct 288 ms 28108 KB Output is correct
40 Correct 288 ms 29524 KB Output is correct
41 Correct 291 ms 27972 KB Output is correct
42 Correct 291 ms 27812 KB Output is correct
43 Correct 293 ms 28752 KB Output is correct
44 Correct 304 ms 27416 KB Output is correct
45 Correct 353 ms 27192 KB Output is correct
46 Correct 303 ms 29432 KB Output is correct
47 Correct 161 ms 27728 KB Output is correct
48 Correct 164 ms 27764 KB Output is correct
49 Correct 293 ms 32848 KB Output is correct
50 Correct 209 ms 27688 KB Output is correct
51 Correct 161 ms 27728 KB Output is correct
52 Correct 256 ms 27472 KB Output is correct