oj.uz

답안 #842656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842656 2023-09-03T07:48:42 Z EntityPlantt Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 95 ms 11576 KB 
#include <cstdio>
#define int long long
const int mxn = 200005;
int n, q, s, t, h1, h2, delta[mxn], i, res, l, r, x;
signed main() {
    scanf("%lld%lld%lld%lld%lld", &n, &q, &s, &t, &h1);
    for (i = 0; i < n; i++) {
        scanf("%lld", &h2);
        delta[i] = h2 - h1;
        if (delta[i] > 0) res -= s * delta[i];
        else res -= t * delta[i];
        h1 = h2;
    }
    while (q--) {
        scanf("%lld%lld%lld", &l, &r, &x);
        l--;
        if (l >= 0) {
            if (delta[l] > 0) res += s * delta[l];
            else res += t * delta[l];
            delta[l] += x;
            if (delta[l] > 0) res -= s * delta[l];
            else res -= t * delta[l];
        }
        if (r < n) {
            if (delta[r] > 0) res += s * delta[r];
            else res += t * delta[r];
            delta[r] -= x;
            if (delta[r] > 0) res -= s * delta[r];
            else res -= t * delta[r];
        }
        printf("%lld\n", res);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |     scanf("%lld%lld%lld%lld%lld", &n, &q, &s, &t, &h1);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:8:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |         scanf("%lld", &h2);
      |         ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%lld%lld%lld", &l, &r, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 548 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 8652 KB Output is correct
2 Correct 83 ms 9400 KB Output is correct
3 Correct 85 ms 9812 KB Output is correct
4 Correct 88 ms 9300 KB Output is correct
5 Correct 80 ms 10580 KB Output is correct
6 Correct 79 ms 9376 KB Output is correct
7 Correct 77 ms 9492 KB Output is correct
8 Correct 86 ms 10324 KB Output is correct
9 Correct 93 ms 10720 KB Output is correct
10 Correct 84 ms 9256 KB Output is correct
11 Correct 77 ms 9384 KB Output is correct
12 Correct 76 ms 10068 KB Output is correct
13 Correct 79 ms 10324 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 548 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 83 ms 8652 KB Output is correct
23 Correct 83 ms 9400 KB Output is correct
24 Correct 85 ms 9812 KB Output is correct
25 Correct 88 ms 9300 KB Output is correct
26 Correct 80 ms 10580 KB Output is correct
27 Correct 79 ms 9376 KB Output is correct
28 Correct 77 ms 9492 KB Output is correct
29 Correct 86 ms 10324 KB Output is correct
30 Correct 93 ms 10720 KB Output is correct
31 Correct 84 ms 9256 KB Output is correct
32 Correct 77 ms 9384 KB Output is correct
33 Correct 76 ms 10068 KB Output is correct
34 Correct 79 ms 10324 KB Output is correct
35 Correct 85 ms 8788 KB Output is correct
36 Correct 85 ms 10272 KB Output is correct
37 Correct 86 ms 11092 KB Output is correct
38 Correct 90 ms 10836 KB Output is correct
39 Correct 86 ms 10988 KB Output is correct
40 Correct 92 ms 10824 KB Output is correct
41 Correct 86 ms 10696 KB Output is correct
42 Correct 85 ms 10760 KB Output is correct
43 Correct 95 ms 10000 KB Output is correct
44 Correct 87 ms 10580 KB Output is correct
45 Correct 85 ms 10556 KB Output is correct
46 Correct 89 ms 11576 KB Output is correct
47 Correct 77 ms 10068 KB Output is correct
48 Correct 84 ms 10068 KB Output is correct
49 Correct 79 ms 9044 KB Output is correct
50 Correct 74 ms 9812 KB Output is correct
51 Correct 76 ms 10324 KB Output is correct
52 Correct 76 ms 10068 KB Output is correct