oj.uz

Submission #463297

# Submission time Handle Problem Language Result Execution time Memory
463297 2021-08-11T03:50:45 Z JasperL Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 945 ms 14580 KB 
// to speed up code, use fenwick!

#include <iostream>
#include <vector>
using namespace std;
#define maxn 200005
typedef long long ll;

int n,q; ll s,t;

ll gap(ll a, ll b) {
    if (a < b) return (a-b) * s;
    else return (a-b) * t;
}

ll a[maxn];
ll d[maxn]; // difference array, d[1] + d[2] + ... + d[i] == a[i]
ll z[maxn]; // fenwick for temperature

void inc(int i, ll x) {
    for (; i <= n; i += i&(-i)) d[i] += x;
}
ll get(int i) {
    ll ret = 0;
    for (; i; i -= i&(-i)) ret += d[i];
    return ret;
}
void aug(int i, ll x) {
    for (; i <= n; i += i&(-i)) z[i] += x;
}
ll temp(int i) {
    ll ret = 0;
    for (; i; i -= i&(-i)) ret += z[i];
    return ret;
}

int main() {
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) inc(i,a[i]-a[i-1]);
    for (int i = 0; i < n; i++) aug(i+1,gap(get(i),get(i+1)));
    for (int i = 0; i < q; i++) {
        int l, r; ll x; cin >> l >> r >> x;
        ll L = get(l-1), R = get(l);
        ll u = gap(L,R), v = gap(L,R+x);
        aug(l,v-u);
        if (r != n) {
            L = get(r), R = get(r+1);
            u = gap(L,R), v = gap(L+x,R);
            aug(r+1,v-u);
        }
        inc(l,x); 
        if (r != n) inc(r+1,-x);
        cout << temp(n) << endl;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 372 KB Output is correct
2 Correct 9 ms 376 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 8 ms 380 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 8 ms 332 KB Output is correct
10 Correct 9 ms 332 KB Output is correct
11 Correct 10 ms 380 KB Output is correct
12 Correct 8 ms 332 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 7 ms 332 KB Output is correct
15 Correct 7 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 7 ms 332 KB Output is correct
18 Correct 8 ms 332 KB Output is correct
19 Correct 1 ms 224 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 886 ms 7432 KB Output is correct
2 Correct 945 ms 12420 KB Output is correct
3 Correct 864 ms 13024 KB Output is correct
4 Correct 860 ms 12408 KB Output is correct
5 Correct 879 ms 13488 KB Output is correct
6 Correct 754 ms 12556 KB Output is correct
7 Correct 700 ms 12492 KB Output is correct
8 Correct 814 ms 13340 KB Output is correct
9 Correct 881 ms 13664 KB Output is correct
10 Correct 916 ms 12360 KB Output is correct
11 Correct 788 ms 12408 KB Output is correct
12 Correct 772 ms 13180 KB Output is correct
13 Correct 734 ms 13344 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 372 KB Output is correct
2 Correct 9 ms 376 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 8 ms 380 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 8 ms 332 KB Output is correct
10 Correct 9 ms 332 KB Output is correct
11 Correct 10 ms 380 KB Output is correct
12 Correct 8 ms 332 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 7 ms 332 KB Output is correct
15 Correct 7 ms 332 KB Output is correct
16 Correct 7 ms 332 KB Output is correct
17 Correct 7 ms 332 KB Output is correct
18 Correct 8 ms 332 KB Output is correct
19 Correct 1 ms 224 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 886 ms 7432 KB Output is correct
23 Correct 945 ms 12420 KB Output is correct
24 Correct 864 ms 13024 KB Output is correct
25 Correct 860 ms 12408 KB Output is correct
26 Correct 879 ms 13488 KB Output is correct
27 Correct 754 ms 12556 KB Output is correct
28 Correct 700 ms 12492 KB Output is correct
29 Correct 814 ms 13340 KB Output is correct
30 Correct 881 ms 13664 KB Output is correct
31 Correct 916 ms 12360 KB Output is correct
32 Correct 788 ms 12408 KB Output is correct
33 Correct 772 ms 13180 KB Output is correct
34 Correct 734 ms 13344 KB Output is correct
35 Correct 893 ms 11856 KB Output is correct
36 Correct 937 ms 13348 KB Output is correct
37 Correct 944 ms 14136 KB Output is correct
38 Correct 841 ms 13932 KB Output is correct
39 Correct 837 ms 13968 KB Output is correct
40 Correct 787 ms 13968 KB Output is correct
41 Correct 823 ms 13736 KB Output is correct
42 Correct 862 ms 13892 KB Output is correct
43 Correct 824 ms 13192 KB Output is correct
44 Correct 757 ms 13540 KB Output is correct
45 Correct 767 ms 13588 KB Output is correct
46 Correct 899 ms 14580 KB Output is correct
47 Correct 773 ms 13216 KB Output is correct
48 Correct 728 ms 13252 KB Output is correct
49 Correct 771 ms 12200 KB Output is correct
50 Correct 740 ms 13000 KB Output is correct
51 Correct 670 ms 13340 KB Output is correct
52 Correct 773 ms 13160 KB Output is correct