oj.uz

답안 #638696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638696 2022-09-07T01:56:27 Z bonk Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 113 ms 13156 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll n, q, s, t; cin >> n >> q >> s >> t;
    vector<ll>a(n + 1), diff(n + 1);
    ll up = 0, down = 0;

    for(int i = 0; i <= n; i++){
        cin >> a[i];
        if(i) diff[i] = a[i] - a[i - 1];
        if(diff[i] < 0) down += abs(diff[i]);
        else up += diff[i];
    }

    while(q--){
        ll l, r, x; cin >> l >> r >> x;
        if(x > 0){
            if(diff[l] < 0){
                ll tmp = min(abs(diff[l]), x);
                down -= tmp;
                if(x > tmp) up += (x - tmp);
            } else{
                up += x;
            }

            diff[l] += x;

            if(r < n){
                if(diff[r + 1] > 0){
                    ll tmp = min(diff[r + 1], x);
                    up -= tmp;
                    if(x > tmp) down += (x - tmp);
                } else{
                    down += x;
                }

                diff[r + 1] -= x;
            }
        } else{
            if(diff[l] > 0){
                ll tmp = min(diff[l], abs(x));
                up -= tmp;
                if(abs(x) > tmp) down += (abs(x) - tmp);
            } else{
                down += abs(x);
            }

            diff[l] += x;

            if(r < n){
                if(diff[r + 1] < 0){
                    ll tmp = min(abs(diff[r + 1]), abs(x));
                    down -= tmp;
                    if(abs(x) > tmp) up += (abs(x) - tmp);
                } else{
                    up += abs(x);
                }

                diff[r + 1] -= x;
            }
        }

        cout << (down*t - up*s) << '\n';
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 1 ms 392 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 392 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 10228 KB Output is correct
2 Correct 101 ms 10856 KB Output is correct
3 Correct 94 ms 11488 KB Output is correct
4 Correct 89 ms 10872 KB Output is correct
5 Correct 89 ms 11936 KB Output is correct
6 Correct 76 ms 11064 KB Output is correct
7 Correct 76 ms 10956 KB Output is correct
8 Correct 88 ms 11784 KB Output is correct
9 Correct 93 ms 12096 KB Output is correct
10 Correct 87 ms 10832 KB Output is correct
11 Correct 73 ms 10868 KB Output is correct
12 Correct 75 ms 11628 KB Output is correct
13 Correct 78 ms 11840 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 1 ms 392 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 392 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 91 ms 10228 KB Output is correct
23 Correct 101 ms 10856 KB Output is correct
24 Correct 94 ms 11488 KB Output is correct
25 Correct 89 ms 10872 KB Output is correct
26 Correct 89 ms 11936 KB Output is correct
27 Correct 76 ms 11064 KB Output is correct
28 Correct 76 ms 10956 KB Output is correct
29 Correct 88 ms 11784 KB Output is correct
30 Correct 93 ms 12096 KB Output is correct
31 Correct 87 ms 10832 KB Output is correct
32 Correct 73 ms 10868 KB Output is correct
33 Correct 75 ms 11628 KB Output is correct
34 Correct 78 ms 11840 KB Output is correct
35 Correct 90 ms 10492 KB Output is correct
36 Correct 99 ms 11852 KB Output is correct
37 Correct 98 ms 12600 KB Output is correct
38 Correct 113 ms 12452 KB Output is correct
39 Correct 93 ms 12364 KB Output is correct
40 Correct 101 ms 12364 KB Output is correct
41 Correct 90 ms 12272 KB Output is correct
42 Correct 97 ms 12364 KB Output is correct
43 Correct 98 ms 11632 KB Output is correct
44 Correct 92 ms 12028 KB Output is correct
45 Correct 95 ms 11980 KB Output is correct
46 Correct 92 ms 13156 KB Output is correct
47 Correct 81 ms 11748 KB Output is correct
48 Correct 84 ms 11636 KB Output is correct
49 Correct 81 ms 10828 KB Output is correct
50 Correct 79 ms 11424 KB Output is correct
51 Correct 81 ms 11888 KB Output is correct
52 Correct 77 ms 11596 KB Output is correct