oj.uz

Submission #137279

# Submission time Handle Problem Language Result Execution time Memory
137279 2019-07-27T11:41:07 Z MladenP Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 238 ms 13176 KB 
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 200010
int N, Q;
lld S, T;
lld A[MAXN], bit[MAXN];
void update(int idx, lld val) {
    while(idx < MAXN) {
        bit[idx] += val;
        idx += idx&-idx;
    }
}
lld q(int idx) {
    lld rez = A[idx];
    while(idx) {
        rez += bit[idx];
        idx -= idx&-idx;
    }
    return rez;
}
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
    cin >> N >> Q >> S >> T;
    lld score = 0;
    cin >> A[0];
    for(int i = 1; i <= N; i++) {
        cin >> A[i];
        if(A[i-1] < A[i]) score -= S*(A[i]-A[i-1]);
        else score -= T*(A[i]-A[i-1]);
    }
    while(Q--) {
        int L, R; lld val; cin >> L >> R >> val;
        if(q(L-1) < q(L)) score -= S*(q(L-1)-q(L));
        else score -= T*(q(L-1)-q(L));

        if(R != N) {
            if(q(R) < q(R+1)) score -= S*(q(R)-q(R+1));
            else score -= T*(q(R)-q(R+1));
        }
        update(L, +val);
        update(R+1, -val);
        if(q(L-1) < q(L)) score -= S*(q(L)-q(L-1));
        else score -= T*(q(L)-q(L-1));

        if(R != N) {
            if(q(R) < q(R+1)) score += S*(q(R)-q(R+1));
            else score += T*(q(R)-q(R+1));
        }

        cout << score << endl;
    }

}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 10232 KB Output is correct
2 Correct 227 ms 11000 KB Output is correct
3 Correct 234 ms 11508 KB Output is correct
4 Correct 197 ms 10948 KB Output is correct
5 Correct 215 ms 12024 KB Output is correct
6 Correct 131 ms 9592 KB Output is correct
7 Correct 134 ms 9592 KB Output is correct
8 Correct 195 ms 11900 KB Output is correct
9 Correct 196 ms 12252 KB Output is correct
10 Correct 197 ms 11000 KB Output is correct
11 Correct 141 ms 9548 KB Output is correct
12 Correct 142 ms 10308 KB Output is correct
13 Correct 126 ms 10360 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 4 ms 508 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 208 ms 10232 KB Output is correct
23 Correct 227 ms 11000 KB Output is correct
24 Correct 234 ms 11508 KB Output is correct
25 Correct 197 ms 10948 KB Output is correct
26 Correct 215 ms 12024 KB Output is correct
27 Correct 131 ms 9592 KB Output is correct
28 Correct 134 ms 9592 KB Output is correct
29 Correct 195 ms 11900 KB Output is correct
30 Correct 196 ms 12252 KB Output is correct
31 Correct 197 ms 11000 KB Output is correct
32 Correct 141 ms 9548 KB Output is correct
33 Correct 142 ms 10308 KB Output is correct
34 Correct 126 ms 10360 KB Output is correct
35 Correct 215 ms 10496 KB Output is correct
36 Correct 222 ms 12008 KB Output is correct
37 Correct 232 ms 12664 KB Output is correct
38 Correct 238 ms 12480 KB Output is correct
39 Correct 216 ms 12408 KB Output is correct
40 Correct 214 ms 12484 KB Output is correct
41 Correct 228 ms 12280 KB Output is correct
42 Correct 218 ms 12536 KB Output is correct
43 Correct 211 ms 11724 KB Output is correct
44 Correct 213 ms 12068 KB Output is correct
45 Correct 201 ms 12156 KB Output is correct
46 Correct 216 ms 13176 KB Output is correct
47 Correct 130 ms 10232 KB Output is correct
48 Correct 146 ms 10236 KB Output is correct
49 Correct 191 ms 10744 KB Output is correct
50 Correct 137 ms 10104 KB Output is correct
51 Correct 129 ms 10384 KB Output is correct
52 Correct 139 ms 10232 KB Output is correct