oj.uz

Submission #71868

# Submission time Handle Problem Language Result Execution time Memory
71868 2018-08-25T17:39:29 Z win11905 Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 363 ms 169608 KB 
#include <bits/stdc++.h>
using namespace std;

#define long long long 

const int N = 1<<18;

int n, q, s, t;
long T[N], val[N], sum;

void update(int x, int v) {
    if(x == 0) return;
    for(; x <= n; x += x & -x) T[x] += v;
}

long query(int x) {
    long v = 0;
    for(; x > 0; x -= x & -x) v += T[x];
    return v;
}

long f(long a, long b) {
    a = query(a), b = query(b);
    if(a < b) return (a - b) * s;
    return (a - b) * t;
}

int main() {
    scanf("%d %d %d %d", &n, &q, &s, &t);
    for(int i = 0, v; i <= n; ++i) scanf("%d", &v), update(i, v), update(i+1, -v);
    for(int i = 0; i < n; ++i) val[i] = f(i, i+1), sum += val[i];
    for(int i = 0, a, b, c; i < q; ++i) {
        scanf("%d %d %d", &a, &b, &c);
        sum -= f(a-1, a) + (b == n ? 0 : f(b, b+1));
        update(a, c), update(b+1, -c);
        sum += f(a-1, a) + (b == n ? 0 : f(b, b+1));
        printf("%lld\n", sum);
    }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &n, &q, &s, &t);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:30:65: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0, v; i <= n; ++i) scanf("%d", &v), update(i, v), update(i+1, -v);
                                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 7 ms 556 KB Output is correct
3 Correct 5 ms 728 KB Output is correct
4 Correct 5 ms 840 KB Output is correct
5 Correct 7 ms 956 KB Output is correct
6 Correct 6 ms 1056 KB Output is correct
7 Correct 6 ms 1056 KB Output is correct
8 Correct 5 ms 1084 KB Output is correct
9 Correct 5 ms 1140 KB Output is correct
10 Correct 4 ms 1316 KB Output is correct
11 Correct 5 ms 1316 KB Output is correct
12 Correct 4 ms 1320 KB Output is correct
13 Correct 5 ms 1376 KB Output is correct
14 Correct 5 ms 1428 KB Output is correct
15 Correct 4 ms 1468 KB Output is correct
16 Correct 6 ms 1508 KB Output is correct
17 Correct 5 ms 1556 KB Output is correct
18 Correct 4 ms 1616 KB Output is correct
19 Correct 2 ms 1652 KB Output is correct
20 Correct 3 ms 1656 KB Output is correct
21 Correct 2 ms 1656 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 355 ms 11584 KB Output is correct
2 Correct 296 ms 17580 KB Output is correct
3 Correct 278 ms 23584 KB Output is correct
4 Correct 250 ms 28404 KB Output is correct
5 Correct 267 ms 35176 KB Output is correct
6 Correct 165 ms 40272 KB Output is correct
7 Correct 162 ms 44880 KB Output is correct
8 Correct 245 ms 50428 KB Output is correct
9 Correct 274 ms 56192 KB Output is correct
10 Correct 233 ms 60492 KB Output is correct
11 Correct 169 ms 66104 KB Output is correct
12 Correct 196 ms 71244 KB Output is correct
13 Correct 165 ms 76200 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 7 ms 556 KB Output is correct
3 Correct 5 ms 728 KB Output is correct
4 Correct 5 ms 840 KB Output is correct
5 Correct 7 ms 956 KB Output is correct
6 Correct 6 ms 1056 KB Output is correct
7 Correct 6 ms 1056 KB Output is correct
8 Correct 5 ms 1084 KB Output is correct
9 Correct 5 ms 1140 KB Output is correct
10 Correct 4 ms 1316 KB Output is correct
11 Correct 5 ms 1316 KB Output is correct
12 Correct 4 ms 1320 KB Output is correct
13 Correct 5 ms 1376 KB Output is correct
14 Correct 5 ms 1428 KB Output is correct
15 Correct 4 ms 1468 KB Output is correct
16 Correct 6 ms 1508 KB Output is correct
17 Correct 5 ms 1556 KB Output is correct
18 Correct 4 ms 1616 KB Output is correct
19 Correct 2 ms 1652 KB Output is correct
20 Correct 3 ms 1656 KB Output is correct
21 Correct 2 ms 1656 KB Output is correct
22 Correct 355 ms 11584 KB Output is correct
23 Correct 296 ms 17580 KB Output is correct
24 Correct 278 ms 23584 KB Output is correct
25 Correct 250 ms 28404 KB Output is correct
26 Correct 267 ms 35176 KB Output is correct
27 Correct 165 ms 40272 KB Output is correct
28 Correct 162 ms 44880 KB Output is correct
29 Correct 245 ms 50428 KB Output is correct
30 Correct 274 ms 56192 KB Output is correct
31 Correct 233 ms 60492 KB Output is correct
32 Correct 169 ms 66104 KB Output is correct
33 Correct 196 ms 71244 KB Output is correct
34 Correct 165 ms 76200 KB Output is correct
35 Correct 237 ms 79460 KB Output is correct
36 Correct 279 ms 86428 KB Output is correct
37 Correct 314 ms 92480 KB Output is correct
38 Correct 234 ms 97772 KB Output is correct
39 Correct 263 ms 103108 KB Output is correct
40 Correct 299 ms 108580 KB Output is correct
41 Correct 295 ms 113908 KB Output is correct
42 Correct 249 ms 119300 KB Output is correct
43 Correct 296 ms 124096 KB Output is correct
44 Correct 363 ms 129828 KB Output is correct
45 Correct 253 ms 135348 KB Output is correct
46 Correct 236 ms 142024 KB Output is correct
47 Correct 252 ms 146592 KB Output is correct
48 Correct 190 ms 151284 KB Output is correct
49 Correct 216 ms 154728 KB Output is correct
50 Correct 167 ms 159984 KB Output is correct
51 Correct 196 ms 165028 KB Output is correct
52 Correct 172 ms 169608 KB Output is correct