oj.uz

Submission #998337

# Submission time Handle Problem Language Result Execution time Memory
998337 2024-06-13T16:00:57 Z dimashhh Foehn Phenomena (JOI17_foehn_phenomena) C++17
40 / 100
 351 ms 32452 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int  N = 3e5 + 30, MOD = 1e9 + 7;

int n,a[N],q,s,f,val[N];
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';
    }
}
int 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 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 472 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 600 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 306 ms 29328 KB Output is correct
2 Correct 302 ms 28516 KB Output is correct
3 Correct 315 ms 30712 KB Output is correct
4 Correct 311 ms 28116 KB Output is correct
5 Correct 298 ms 30804 KB Output is correct
6 Correct 160 ms 24504 KB Output is correct
7 Correct 165 ms 24656 KB Output is correct
8 Correct 253 ms 29268 KB Output is correct
9 Correct 248 ms 31312 KB Output is correct
10 Correct 231 ms 30032 KB Output is correct
11 Correct 206 ms 24656 KB Output is correct
12 Correct 161 ms 24912 KB Output is correct
13 Correct 157 ms 25428 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 472 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 3 ms 600 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 306 ms 29328 KB Output is correct
23 Correct 302 ms 28516 KB Output is correct
24 Correct 315 ms 30712 KB Output is correct
25 Correct 311 ms 28116 KB Output is correct
26 Correct 298 ms 30804 KB Output is correct
27 Correct 160 ms 24504 KB Output is correct
28 Correct 165 ms 24656 KB Output is correct
29 Correct 253 ms 29268 KB Output is correct
30 Correct 248 ms 31312 KB Output is correct
31 Correct 231 ms 30032 KB Output is correct
32 Correct 206 ms 24656 KB Output is correct
33 Correct 161 ms 24912 KB Output is correct
34 Correct 157 ms 25428 KB Output is correct
35 Correct 326 ms 28036 KB Output is correct
36 Correct 298 ms 29516 KB Output is correct
37 Correct 300 ms 31828 KB Output is correct
38 Correct 296 ms 30032 KB Output is correct
39 Correct 295 ms 30032 KB Output is correct
40 Correct 351 ms 31704 KB Output is correct
41 Correct 292 ms 29776 KB Output is correct
42 Correct 343 ms 30032 KB Output is correct
43 Correct 315 ms 30804 KB Output is correct
44 Correct 312 ms 29660 KB Output is correct
45 Correct 340 ms 29396 KB Output is correct
46 Incorrect 330 ms 32452 KB Output isn't correct
47 Halted 0 ms 0 KB -