oj.uz

Submission #733099

# Submission time Handle Problem Language Result Execution time Memory
733099 2023-04-30T05:33:19 Z ac2hu Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 361 ms 15576 KB 
#include <bits/stdc++.h>
#ifdef DEBUG
#include "../templates/debug.h"
#else 
#define deb(x...)
#endif
using namespace std;
#define int long long 
const int N = 2e5 + 10;
int n, q, S, T, t[4*N], a[N];
void build(int v, int tl, int tr){
    if(tl == tr)t[v] = a[tl];
    else{
        int tm = (tl + tr)/2;
        build(v*2, tl, tm);
        build(v*2 + 1, tm + 1, tr);
    }
}
void update(int l, int r, int x, int v, int tl, int tr){
    if(l > r)return;
    else if(l == tl && r == tr)t[v] += x;
    else{
        int tm = (tl + tr)/2;
        update(l, min(tm, r), x, v*2, tl, tm);
        update(max(l, tm + 1), r, x, v*2+1,tm+1,tr);
    }
}
int query(int x, int v, int tl, int tr){
    if(tl == tr)return t[v];
    else{
        int tm = (tl + tr)/2;
        if(x <= tm)return t[v] + query(x, v*2,tl,tm);
        else return t[v] + query(x,v*2+1,tm+1,tr);  
    }
}
signed main() {
    iostream::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    cin >> n >> q >> S >> T;
    for(int i = 0;i<=n;i++)cin >> a[i]; 
    int calc = 0;
    auto dd = [&](int a, int b, int sign){
        if(b > a)calc -= sign*(b - a)*S;
        else calc += sign*(a - b)*T; 
    };
    for(int i = 0;i<n;i++){
        dd(a[i], a[i + 1], 1);
    } 
    build(1, 0, n);
    while(q--){
        int l, r;cin >> l >> r; 
        int x;cin >> x;
        int f1 = query(l - 1, 1, 0, n), f2 = query(l, 1, 0, n);
        int s1 = query(r, 1, 0, n), s2 = query(min(r + 1, n), 1, 0, n);
        dd(f1, f2, -1);dd(s1, s2, -1);
        update(l, r, x, 1, 0, n);
        f1 = query(l - 1, 1, 0, n), f2 = query(l, 1, 0, n);
        s1 = query(r, 1, 0, n), s2 = query(min(r + 1, n), 1, 0, n);
        dd(f1, f2, 1);dd(s1, s2, 1);
        cout << calc << "\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 464 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 12716 KB Output is correct
2 Correct 350 ms 13392 KB Output is correct
3 Correct 314 ms 14036 KB Output is correct
4 Correct 312 ms 13416 KB Output is correct
5 Correct 337 ms 14492 KB Output is correct
6 Correct 149 ms 12520 KB Output is correct
7 Correct 158 ms 12676 KB Output is correct
8 Correct 305 ms 14276 KB Output is correct
9 Correct 306 ms 14716 KB Output is correct
10 Correct 298 ms 13396 KB Output is correct
11 Correct 167 ms 12452 KB Output is correct
12 Correct 148 ms 13240 KB Output is correct
13 Correct 175 ms 13348 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 444 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 464 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 329 ms 12716 KB Output is correct
23 Correct 350 ms 13392 KB Output is correct
24 Correct 314 ms 14036 KB Output is correct
25 Correct 312 ms 13416 KB Output is correct
26 Correct 337 ms 14492 KB Output is correct
27 Correct 149 ms 12520 KB Output is correct
28 Correct 158 ms 12676 KB Output is correct
29 Correct 305 ms 14276 KB Output is correct
30 Correct 306 ms 14716 KB Output is correct
31 Correct 298 ms 13396 KB Output is correct
32 Correct 167 ms 12452 KB Output is correct
33 Correct 148 ms 13240 KB Output is correct
34 Correct 175 ms 13348 KB Output is correct
35 Correct 329 ms 12940 KB Output is correct
36 Correct 336 ms 14396 KB Output is correct
37 Correct 361 ms 15280 KB Output is correct
38 Correct 341 ms 15112 KB Output is correct
39 Correct 326 ms 14920 KB Output is correct
40 Correct 324 ms 15076 KB Output is correct
41 Correct 361 ms 14800 KB Output is correct
42 Correct 342 ms 14908 KB Output is correct
43 Correct 320 ms 14080 KB Output is correct
44 Correct 327 ms 14540 KB Output is correct
45 Correct 338 ms 14628 KB Output is correct
46 Correct 340 ms 15576 KB Output is correct
47 Correct 150 ms 13156 KB Output is correct
48 Correct 144 ms 13116 KB Output is correct
49 Correct 314 ms 13260 KB Output is correct
50 Correct 166 ms 13032 KB Output is correct
51 Correct 172 ms 13376 KB Output is correct
52 Correct 197 ms 13132 KB Output is correct