oj.uz

Submission #114105

# Submission time Handle Problem Language Result Execution time Memory
114105 2019-05-30T11:08:09 Z alexpetrescu Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 488 ms 14924 KB 
#include <cstdio>

//FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define fin stdin
#define fout stdout

#define ll long long

#define MAXN 200009
#define MAXP 530000

int n, s, t, left, right, val, v[MAXN];
ll aint[MAXP];

void update(int p, int st, int dr) {
    if (left <= st && dr <= right)
        aint[p] += val;
    else {
        int m = (st + dr) / 2;
        if (left <= m) update(2 * p, st, m);
        if (m < right) update(2 * p + 1, m + 1, dr);
    }
}

inline ll query(int poz) {
    if (poz > n)
        poz = n;
    int p = 1, st = 0, dr = n;
    ll ans = v[poz];
    while (st < dr) {
        ans += aint[p];
        int m = (st + dr) / 2;
        if (poz <= m)
            dr = m, p = 2 * p;
        else
            st = m + 1, p = 2 * p + 1;
    }
    return ans + aint[p];
}

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

inline ll calc(int l, int r) {
    return cost(query(l - 1), query(l)) + cost(query(r), query(r + 1));
}

int main() {
    int q;
    fscanf(fin, "%d%d%d%d", &n, &q, &s, &t);

    ll ans = 0;
    for (int i = 0; i <= n; i++) {
        fscanf(fin, "%d", &v[i]);
        ans += cost(v[i - 1], v[i]);
    }

    for (int i = 1; i <= q; i++) {
        fscanf(fin, "%d%d%d", &left, &right, &val);

        ans -= calc(left, right);
        update(1, 0, n);
        ans += calc(left, right);

        fprintf(fout, "%lld\n", ans);
    }

    fclose(fin);
    fclose(fout);
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:54:11: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf(fin, "%d%d%d%d", &n, &q, &s, &t);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:58:15: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf(fin, "%d", &v[i]);
         ~~~~~~^~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:63:15: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf(fin, "%d%d%d", &left, &right, &val);
         ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 12180 KB Output is correct
2 Correct 411 ms 12640 KB Output is correct
3 Correct 419 ms 13216 KB Output is correct
4 Correct 403 ms 12664 KB Output is correct
5 Correct 402 ms 13780 KB Output is correct
6 Correct 176 ms 8640 KB Output is correct
7 Correct 178 ms 8696 KB Output is correct
8 Correct 367 ms 13476 KB Output is correct
9 Correct 361 ms 13944 KB Output is correct
10 Correct 356 ms 12556 KB Output is correct
11 Correct 168 ms 8568 KB Output is correct
12 Correct 180 ms 9464 KB Output is correct
13 Correct 187 ms 9676 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 4 ms 388 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 439 ms 12180 KB Output is correct
23 Correct 411 ms 12640 KB Output is correct
24 Correct 419 ms 13216 KB Output is correct
25 Correct 403 ms 12664 KB Output is correct
26 Correct 402 ms 13780 KB Output is correct
27 Correct 176 ms 8640 KB Output is correct
28 Correct 178 ms 8696 KB Output is correct
29 Correct 367 ms 13476 KB Output is correct
30 Correct 361 ms 13944 KB Output is correct
31 Correct 356 ms 12556 KB Output is correct
32 Correct 168 ms 8568 KB Output is correct
33 Correct 180 ms 9464 KB Output is correct
34 Correct 187 ms 9676 KB Output is correct
35 Correct 454 ms 12280 KB Output is correct
36 Correct 488 ms 13688 KB Output is correct
37 Correct 441 ms 14456 KB Output is correct
38 Correct 428 ms 14168 KB Output is correct
39 Correct 428 ms 14200 KB Output is correct
40 Correct 428 ms 14172 KB Output is correct
41 Correct 422 ms 14092 KB Output is correct
42 Correct 425 ms 14108 KB Output is correct
43 Correct 421 ms 13432 KB Output is correct
44 Correct 416 ms 13944 KB Output is correct
45 Correct 408 ms 13944 KB Output is correct
46 Correct 418 ms 14924 KB Output is correct
47 Correct 181 ms 9336 KB Output is correct
48 Correct 185 ms 9336 KB Output is correct
49 Correct 400 ms 12580 KB Output is correct
50 Correct 170 ms 9180 KB Output is correct
51 Correct 182 ms 9552 KB Output is correct
52 Correct 188 ms 9364 KB Output is correct