oj.uz

답안 #781339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781339 2023-07-13T03:48:53 Z makanhulia Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 102 ms 13144 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second

ll a[200005], diff[200005];

int main() { 
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int n, q;
    cin >> n >> q;
    ll s, t;
    cin >> s >> t;
    s = -s, t = -t;
    ll ans = 0;
    for (int i = 0; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) {
        diff[i] = a[i] - a[i - 1];
        if (diff[i] > 0) ans += s * diff[i];
        else ans += t * diff[i];
    }
    while (q--) {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        if (r == n) {
            if (diff[l] > 0) ans -= s * diff[l];
            else ans -= t * diff[l];
            diff[l] += x;
            if (diff[l] > 0) ans += s * diff[l];
            else ans += t * diff[l];      
            cout << ans << "\n";
            continue;      
        }
        if (diff[l] > 0) ans -= s * diff[l];
        else ans -= t * diff[l];
        if (diff[r + 1] > 0) ans -= s * diff[r + 1];
        else ans -= t * diff[r + 1]; 
        diff[l] += x, diff[r + 1] -= x;
        if (diff[l] > 0) ans += s * diff[l];
        else ans += t * diff[l];
        if (diff[r + 1] > 0) ans += s * diff[r + 1];
        else ans += t * diff[r + 1];
        cout << ans << "\n"; 
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 8908 KB Output is correct
2 Correct 82 ms 10892 KB Output is correct
3 Correct 79 ms 11464 KB Output is correct
4 Correct 77 ms 10812 KB Output is correct
5 Correct 77 ms 12000 KB Output is correct
6 Correct 68 ms 11072 KB Output is correct
7 Correct 69 ms 10908 KB Output is correct
8 Correct 79 ms 11776 KB Output is correct
9 Correct 80 ms 12176 KB Output is correct
10 Correct 78 ms 10888 KB Output is correct
11 Correct 65 ms 10900 KB Output is correct
12 Correct 80 ms 11684 KB Output is correct
13 Correct 68 ms 11812 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 79 ms 8908 KB Output is correct
23 Correct 82 ms 10892 KB Output is correct
24 Correct 79 ms 11464 KB Output is correct
25 Correct 77 ms 10812 KB Output is correct
26 Correct 77 ms 12000 KB Output is correct
27 Correct 68 ms 11072 KB Output is correct
28 Correct 69 ms 10908 KB Output is correct
29 Correct 79 ms 11776 KB Output is correct
30 Correct 80 ms 12176 KB Output is correct
31 Correct 78 ms 10888 KB Output is correct
32 Correct 65 ms 10900 KB Output is correct
33 Correct 80 ms 11684 KB Output is correct
34 Correct 68 ms 11812 KB Output is correct
35 Correct 77 ms 10420 KB Output is correct
36 Correct 85 ms 11780 KB Output is correct
37 Correct 82 ms 12620 KB Output is correct
38 Correct 80 ms 12348 KB Output is correct
39 Correct 84 ms 12380 KB Output is correct
40 Correct 88 ms 12332 KB Output is correct
41 Correct 80 ms 12192 KB Output is correct
42 Correct 81 ms 12348 KB Output is correct
43 Correct 79 ms 11596 KB Output is correct
44 Correct 102 ms 11980 KB Output is correct
45 Correct 75 ms 12056 KB Output is correct
46 Correct 87 ms 13144 KB Output is correct
47 Correct 70 ms 11596 KB Output is correct
48 Correct 69 ms 11680 KB Output is correct
49 Correct 73 ms 10620 KB Output is correct
50 Correct 80 ms 11464 KB Output is correct
51 Correct 84 ms 11828 KB Output is correct
52 Correct 67 ms 11668 KB Output is correct