oj.uz

Submission #46635

# Submission time Handle Problem Language Result Execution time Memory
46635 2018-04-22T12:20:26 Z kuzmichev_dima Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 915 ms 9316 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>

using namespace std;

#define INF 1e+9
#define mp make_pair
#define pb push_back
#define fi first
#define fs first
#define se second
#define i64 long long
#define li long long
#define lint long long
#define pii pair<int, int>
#define vi vector<int>

#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define fore(i, b, e) for (int i = (int)b; i <= (int)e; i++)

const int maxn = 2e5+5;

i64 tree[maxn * 4];
int start[maxn];
i64 S, T;
int n;

i64 get(int i, int L, int R, int pos) {
    if (L + 1 == R)
        return tree[i];
    int M = (L + R) / 2;
    return (pos < M ? get(i * 2, L, M, pos) : get(i * 2 + 1, M, R, pos)) + tree[i];
}

i64 get(int pos) {
    return get(1, 0, n + 1, pos);
}

void upd(int i, int L, int R, int A, int B, int diff) {
    if (L >= B || A >= R)
        return;
    if (L >= A && R <= B) {
        tree[i] += diff;
        return;
    }
    int M = (L + R) / 2;
    upd(i * 2, L, M, A, B, diff);
    upd(i * 2 + 1, M, R, A, B, diff);
}

void build(int i, int L, int R) {
    if (L + 1 == R) {
        tree[i] = start[L];
        return;
    }
    int M = (L + R) / 2;
    build(i * 2, L, M);
    build(i * 2 + 1, M, R);
}

i64 calc(i64 fi, i64 se) {
    return se > fi ? (se - fi) * -S : (fi - se) * T; 
}

int main() {
#ifdef LOCAL
    freopen("inp", "r", stdin);
    //freopen("outp", "w", stdout);
#else
    // freopen(TASKNAME ".in", "r", stdin);
    // freopen(TASKNAME ".out", "w", stdout);
#endif
    int Q;
    cin >> n >> Q >> S >> T;
    forn(i, n + 1) {
        scanf("%d", &start[i]);
    }
    build(1, 0, n + 1);
    i64 ans = 0;
    forn(i, n)
        ans += calc(start[i], start[i + 1]); 
    forn(q, Q) {
        int L, R, diff;
        scanf("%d%d%d", &L, &R, &diff);
        ans -= calc(get(L - 1), get(L));
        if (R != n)
            ans -= calc(get(R), get(R + 1));
        upd(1, 0, n + 1, L, R + 1, diff);
        ans += calc(get(L - 1), get(L));
        if (R != n)
            ans += calc(get(R), get(R + 1));
        cout << ans << endl;
    }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:86:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &start[i]);
         ~~~~~^~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &L, &R, &diff);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 812 ms 7032 KB Output is correct
2 Correct 819 ms 7596 KB Output is correct
3 Correct 840 ms 8160 KB Output is correct
4 Correct 767 ms 8160 KB Output is correct
5 Correct 789 ms 8160 KB Output is correct
6 Correct 500 ms 8160 KB Output is correct
7 Correct 514 ms 8160 KB Output is correct
8 Correct 706 ms 8548 KB Output is correct
9 Correct 735 ms 8748 KB Output is correct
10 Correct 717 ms 8748 KB Output is correct
11 Correct 552 ms 8748 KB Output is correct
12 Correct 483 ms 8748 KB Output is correct
13 Correct 500 ms 8748 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 8 ms 488 KB Output is correct
3 Correct 9 ms 488 KB Output is correct
4 Correct 9 ms 488 KB Output is correct
5 Correct 8 ms 488 KB Output is correct
6 Correct 8 ms 628 KB Output is correct
7 Correct 8 ms 692 KB Output is correct
8 Correct 8 ms 692 KB Output is correct
9 Correct 8 ms 692 KB Output is correct
10 Correct 8 ms 692 KB Output is correct
11 Correct 8 ms 692 KB Output is correct
12 Correct 8 ms 692 KB Output is correct
13 Correct 6 ms 692 KB Output is correct
14 Correct 9 ms 692 KB Output is correct
15 Correct 8 ms 692 KB Output is correct
16 Correct 7 ms 692 KB Output is correct
17 Correct 6 ms 692 KB Output is correct
18 Correct 7 ms 692 KB Output is correct
19 Correct 2 ms 692 KB Output is correct
20 Correct 2 ms 788 KB Output is correct
21 Correct 2 ms 788 KB Output is correct
22 Correct 812 ms 7032 KB Output is correct
23 Correct 819 ms 7596 KB Output is correct
24 Correct 840 ms 8160 KB Output is correct
25 Correct 767 ms 8160 KB Output is correct
26 Correct 789 ms 8160 KB Output is correct
27 Correct 500 ms 8160 KB Output is correct
28 Correct 514 ms 8160 KB Output is correct
29 Correct 706 ms 8548 KB Output is correct
30 Correct 735 ms 8748 KB Output is correct
31 Correct 717 ms 8748 KB Output is correct
32 Correct 552 ms 8748 KB Output is correct
33 Correct 483 ms 8748 KB Output is correct
34 Correct 500 ms 8748 KB Output is correct
35 Correct 795 ms 8748 KB Output is correct
36 Correct 800 ms 8748 KB Output is correct
37 Correct 789 ms 9316 KB Output is correct
38 Correct 815 ms 9316 KB Output is correct
39 Correct 844 ms 9316 KB Output is correct
40 Correct 845 ms 9316 KB Output is correct
41 Correct 802 ms 9316 KB Output is correct
42 Correct 784 ms 9316 KB Output is correct
43 Correct 915 ms 9316 KB Output is correct
44 Correct 781 ms 9316 KB Output is correct
45 Correct 853 ms 9316 KB Output is correct
46 Correct 790 ms 9316 KB Output is correct
47 Correct 534 ms 9316 KB Output is correct
48 Correct 555 ms 9316 KB Output is correct
49 Correct 815 ms 9316 KB Output is correct
50 Correct 568 ms 9316 KB Output is correct
51 Correct 557 ms 9316 KB Output is correct
52 Correct 619 ms 9316 KB Output is correct