oj.uz

답안 #209251

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209251 2020-03-13T13:50:09 Z my99n Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 166 ms 7544 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

// would this be overflow even for long long ? ? ?

ll a[200100], del[200100], neg, pos;
void handle (int l, int x) {
    if (del[l] < 0) neg -= del[l];
    if (del[l] > 0) pos -= del[l];
    del[l] = del[l]+x;
    if (del[l] < 0) neg += del[l];
    if (del[l] > 0) pos += del[l];
}

int main(){
    int n, q; ll s, t; scanf("%d %d %lld %lld", &n, &q, &s, &t);
    for (int i = 0; i <= n; i++) scanf("%lld", &a[i]);
    for (int i = 1; i <= n; i++) {
        del[i] = a[i]-a[i-1];
        if (del[i] < 0) neg += del[i];
        if (del[i] > 0) pos += del[i];
    }
    while(q--) {
        int l, r, x; scanf("%d %d %d", &l, &r, &x);
        handle(l, x);
        if (r != n) handle(r+1, -x);
        printf("%lld\n", -pos*s-neg*t);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:17:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int n, q; ll s, t; scanf("%d %d %lld %lld", &n, &q, &s, &t);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:18:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 0; i <= n; i++) scanf("%lld", &a[i]);
                                  ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:25:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int l, r, x; scanf("%d %d %d", &l, &r, &x);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 5112 KB Output is correct
2 Correct 159 ms 5836 KB Output is correct
3 Correct 160 ms 6392 KB Output is correct
4 Correct 152 ms 5496 KB Output is correct
5 Correct 149 ms 6264 KB Output is correct
6 Correct 136 ms 6648 KB Output is correct
7 Correct 140 ms 6648 KB Output is correct
8 Correct 157 ms 6648 KB Output is correct
9 Correct 160 ms 7032 KB Output is correct
10 Correct 151 ms 5624 KB Output is correct
11 Correct 123 ms 6776 KB Output is correct
12 Correct 131 ms 7032 KB Output is correct
13 Correct 131 ms 7544 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 380 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 156 ms 5112 KB Output is correct
23 Correct 159 ms 5836 KB Output is correct
24 Correct 160 ms 6392 KB Output is correct
25 Correct 152 ms 5496 KB Output is correct
26 Correct 149 ms 6264 KB Output is correct
27 Correct 136 ms 6648 KB Output is correct
28 Correct 140 ms 6648 KB Output is correct
29 Correct 157 ms 6648 KB Output is correct
30 Correct 160 ms 7032 KB Output is correct
31 Correct 151 ms 5624 KB Output is correct
32 Correct 123 ms 6776 KB Output is correct
33 Correct 131 ms 7032 KB Output is correct
34 Correct 131 ms 7544 KB Output is correct
35 Correct 155 ms 5240 KB Output is correct
36 Correct 162 ms 6648 KB Output is correct
37 Correct 164 ms 7544 KB Output is correct
38 Correct 163 ms 7288 KB Output is correct
39 Correct 161 ms 7416 KB Output is correct
40 Correct 166 ms 7320 KB Output is correct
41 Correct 162 ms 7160 KB Output is correct
42 Correct 163 ms 7288 KB Output is correct
43 Correct 160 ms 6548 KB Output is correct
44 Correct 163 ms 7032 KB Output is correct
45 Correct 144 ms 6648 KB Output is correct
46 Correct 151 ms 7416 KB Output is correct
47 Correct 137 ms 7288 KB Output is correct
48 Correct 138 ms 7544 KB Output is correct
49 Correct 154 ms 6648 KB Output is correct
50 Correct 120 ms 7416 KB Output is correct
51 Correct 132 ms 7288 KB Output is correct
52 Correct 130 ms 7288 KB Output is correct