oj.uz

Submission #998309

# Submission time Handle Problem Language Result Execution time Memory
998309 2024-06-13T15:24:00 Z Otalp Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 496 ms 16884 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long

ll a[200100];
ll t[1200100];
int n, q, S, T;

void build(int v, int l, int r){
    if(l == r){
        if(a[l] < 0) t[v] = -a[l] * T;
        else t[v] = -a[l] * S;
        return;
    }
    int mid=(l+r)/2;
    build(v+v, l, mid);
    build(v+v+1, mid+1, r);
    t[v] = t[v + v] + t[v+v+1]; 
}
void upd(int v, int l, int r, int pos, ll x){
    if(l == r){
        a[l] += x;
        if(a[l] < 0) t[v] = -a[l] * T;
        else t[v] = -a[l] * S;
        return;
    }
    int mid = (l + r)/2;
    if(mid >= pos) upd(v+v, l, mid, pos, x);
    else upd(v+v+1, mid+1, r, pos, x);
    t[v] = t[v+v] + t[v+v+1];
}



int main(){
    cin>>n>>q>>S>>T;
    for(int i=0; i<=n; i++){
        cin>>a[i];
    }
    for(int i=n; i>=1; i--) a[i] = a[i] - a[i - 1];
    build(1, 1, n);
    //cout<<t[1]<<'\n';
    for(int i=1; i<=q; i++){
        int l, r, x;
        cin>>l>>r>>x;
        upd(1, 1, n, l, x);
        if(r + 1 <= n) upd(1, 1, n, r + 1, -x);
        cout<<t[1]<<'\n';
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 12460 KB Output is correct
2 Correct 420 ms 14652 KB Output is correct
3 Correct 464 ms 15380 KB Output is correct
4 Correct 410 ms 14624 KB Output is correct
5 Correct 438 ms 15764 KB Output is correct
6 Correct 369 ms 14836 KB Output is correct
7 Correct 415 ms 14872 KB Output is correct
8 Correct 427 ms 15644 KB Output is correct
9 Correct 401 ms 15956 KB Output is correct
10 Correct 448 ms 14672 KB Output is correct
11 Correct 376 ms 14676 KB Output is correct
12 Correct 364 ms 15444 KB Output is correct
13 Correct 386 ms 15700 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2392 KB Output is correct
2 Correct 5 ms 2392 KB Output is correct
3 Correct 4 ms 2536 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 4 ms 2396 KB Output is correct
6 Correct 4 ms 2536 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 4 ms 2548 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 6 ms 2396 KB Output is correct
11 Correct 5 ms 2396 KB Output is correct
12 Correct 4 ms 2396 KB Output is correct
13 Correct 4 ms 2392 KB Output is correct
14 Correct 4 ms 2548 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 4 ms 2396 KB Output is correct
17 Correct 4 ms 2396 KB Output is correct
18 Correct 4 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 427 ms 12460 KB Output is correct
23 Correct 420 ms 14652 KB Output is correct
24 Correct 464 ms 15380 KB Output is correct
25 Correct 410 ms 14624 KB Output is correct
26 Correct 438 ms 15764 KB Output is correct
27 Correct 369 ms 14836 KB Output is correct
28 Correct 415 ms 14872 KB Output is correct
29 Correct 427 ms 15644 KB Output is correct
30 Correct 401 ms 15956 KB Output is correct
31 Correct 448 ms 14672 KB Output is correct
32 Correct 376 ms 14676 KB Output is correct
33 Correct 364 ms 15444 KB Output is correct
34 Correct 386 ms 15700 KB Output is correct
35 Correct 429 ms 14232 KB Output is correct
36 Correct 458 ms 15652 KB Output is correct
37 Correct 461 ms 16464 KB Output is correct
38 Correct 459 ms 16064 KB Output is correct
39 Correct 429 ms 16208 KB Output is correct
40 Correct 434 ms 16208 KB Output is correct
41 Correct 435 ms 15952 KB Output is correct
42 Correct 450 ms 15996 KB Output is correct
43 Correct 470 ms 15400 KB Output is correct
44 Correct 496 ms 15696 KB Output is correct
45 Correct 428 ms 15696 KB Output is correct
46 Correct 453 ms 16884 KB Output is correct
47 Correct 407 ms 15396 KB Output is correct
48 Correct 389 ms 15500 KB Output is correct
49 Correct 410 ms 14372 KB Output is correct
50 Correct 376 ms 15132 KB Output is correct
51 Correct 371 ms 15700 KB Output is correct
52 Correct 449 ms 15276 KB Output is correct