oj.uz

답안 #537080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537080 2022-03-14T12:02:11 Z qwerasdfzxcl Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 169 ms 11468 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
ll d[200200];

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

    int prv;
    ll ans = 0;
    scanf("%d", &prv);
    for (int i=1;i<=n;i++){
        scanf("%lld", d+i);
        ll tmp = d[i];
        d[i] -= prv;
        prv = tmp;

        ans -= d[i] * (d[i]>0?s:t);
    }


    while(q--){
        int l, r, x;
        scanf("%d %d %d", &l, &r, &x);

        ans += d[l] * (d[l]>0?s:t);
        if (r<n) ans += d[r+1] * (d[r+1]>0?s:t);

        d[l] += x;
        if (r<n) d[r+1] -= x;

        ans -= d[l] * (d[l]>0?s:t);
        if (r<n) ans -= d[r+1] * (d[r+1]>0?s:t);

        printf("%lld\n", ans);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d %d %d", &n, &q, &s, &t);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d", &prv);
      |     ~~~~~^~~~~~~~~~~~
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", d+i);
      |         ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         scanf("%d %d %d", &l, &r, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 368 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 3292 KB Output is correct
2 Correct 118 ms 9344 KB Output is correct
3 Correct 124 ms 9844 KB Output is correct
4 Correct 108 ms 9280 KB Output is correct
5 Correct 127 ms 10428 KB Output is correct
6 Correct 102 ms 9432 KB Output is correct
7 Correct 108 ms 9344 KB Output is correct
8 Correct 142 ms 10192 KB Output is correct
9 Correct 135 ms 10560 KB Output is correct
10 Correct 120 ms 9228 KB Output is correct
11 Correct 99 ms 9296 KB Output is correct
12 Correct 103 ms 10104 KB Output is correct
13 Correct 108 ms 10276 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 368 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 126 ms 3292 KB Output is correct
23 Correct 118 ms 9344 KB Output is correct
24 Correct 124 ms 9844 KB Output is correct
25 Correct 108 ms 9280 KB Output is correct
26 Correct 127 ms 10428 KB Output is correct
27 Correct 102 ms 9432 KB Output is correct
28 Correct 108 ms 9344 KB Output is correct
29 Correct 142 ms 10192 KB Output is correct
30 Correct 135 ms 10560 KB Output is correct
31 Correct 120 ms 9228 KB Output is correct
32 Correct 99 ms 9296 KB Output is correct
33 Correct 103 ms 10104 KB Output is correct
34 Correct 108 ms 10276 KB Output is correct
35 Correct 140 ms 8824 KB Output is correct
36 Correct 150 ms 10224 KB Output is correct
37 Correct 123 ms 11016 KB Output is correct
38 Correct 129 ms 10760 KB Output is correct
39 Correct 131 ms 10848 KB Output is correct
40 Correct 112 ms 10800 KB Output is correct
41 Correct 169 ms 10620 KB Output is correct
42 Correct 111 ms 10700 KB Output is correct
43 Correct 146 ms 10032 KB Output is correct
44 Correct 122 ms 10472 KB Output is correct
45 Correct 152 ms 10464 KB Output is correct
46 Correct 116 ms 11468 KB Output is correct
47 Correct 107 ms 10088 KB Output is correct
48 Correct 111 ms 10024 KB Output is correct
49 Correct 112 ms 9092 KB Output is correct
50 Correct 138 ms 9932 KB Output is correct
51 Correct 105 ms 10236 KB Output is correct
52 Correct 98 ms 10060 KB Output is correct