oj.uz

답안 #784513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784513 2023-07-16T07:39:40 Z christinelynn Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 98 ms 13132 KB 
# include <bits/stdc++.h>
# define int long long
# define vi vector<int>
# define pb push_back
# define pii pair<int, int>
# define fi first
# define se second
# define endl '\n'
# define jess ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

int n, q, s, t, a[200005], dif[200005];

void solve() {
    cin >> n >> q >> s >> t;
    int pos=0, neg=0;
    for(int i=0; i<=n; i++) {
        cin >> a[i];
        if(i>=1) {
            dif[i]=a[i]-a[i-1];
            if(dif[i]<=0) neg+=dif[i];
            if(dif[i]>0) pos+=dif[i];
        }
    }
    for(int i=1; i<=q; i++) { 
        // cout << "idx " << i << endl;
        // cout << "bef " << pos << " " << neg << endl;
        int l, r, x;
        cin >> l >> r >> x;
        if(dif[l]+x>0) {
            if(dif[l]<=0) {
                neg-=dif[l];
            } else {
                pos-=dif[l];
            }
            dif[l]+=x;
            pos+=dif[l];
        } else {
            if(dif[l]<=0) neg-=dif[l];
            else pos-=dif[l];
            dif[l]+=x;
            neg+=dif[l];
        }
        r++;
        if((dif[r]-x>0) && (r<=n)) {
            if(dif[r]<=0) {
                neg-=dif[r];
            } else {
                pos-=dif[r];
            }
            dif[r]-=x;
            pos+=dif[r];
        } else if (r<=n){
            if(dif[r]<=0) neg-=dif[r];
            else pos-=dif[r];
            dif[r]-=x;
            neg+=dif[r];
        }
        // cout << "aft " << pos << " " << neg << endl;
        cout << (-1)*neg*t - pos*s << endl;
    }
}
 
signed main() {
    jess;
    solve();
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 400 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 336 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 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 1 ms 396 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 10264 KB Output is correct
2 Correct 92 ms 10812 KB Output is correct
3 Correct 77 ms 11460 KB Output is correct
4 Correct 91 ms 10772 KB Output is correct
5 Correct 84 ms 11960 KB Output is correct
6 Correct 64 ms 11004 KB Output is correct
7 Correct 69 ms 10944 KB Output is correct
8 Correct 77 ms 11808 KB Output is correct
9 Correct 77 ms 12108 KB Output is correct
10 Correct 80 ms 10808 KB Output is correct
11 Correct 60 ms 10888 KB Output is correct
12 Correct 75 ms 11672 KB Output is correct
13 Correct 63 ms 11852 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 400 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 336 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 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 1 ms 396 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 328 KB Output is correct
22 Correct 88 ms 10264 KB Output is correct
23 Correct 92 ms 10812 KB Output is correct
24 Correct 77 ms 11460 KB Output is correct
25 Correct 91 ms 10772 KB Output is correct
26 Correct 84 ms 11960 KB Output is correct
27 Correct 64 ms 11004 KB Output is correct
28 Correct 69 ms 10944 KB Output is correct
29 Correct 77 ms 11808 KB Output is correct
30 Correct 77 ms 12108 KB Output is correct
31 Correct 80 ms 10808 KB Output is correct
32 Correct 60 ms 10888 KB Output is correct
33 Correct 75 ms 11672 KB Output is correct
34 Correct 63 ms 11852 KB Output is correct
35 Correct 72 ms 10316 KB Output is correct
36 Correct 75 ms 11848 KB Output is correct
37 Correct 83 ms 12636 KB Output is correct
38 Correct 76 ms 12364 KB Output is correct
39 Correct 78 ms 12408 KB Output is correct
40 Correct 82 ms 12456 KB Output is correct
41 Correct 98 ms 12252 KB Output is correct
42 Correct 76 ms 12360 KB Output is correct
43 Correct 73 ms 11552 KB Output is correct
44 Correct 98 ms 12060 KB Output is correct
45 Correct 75 ms 12016 KB Output is correct
46 Correct 75 ms 13132 KB Output is correct
47 Correct 83 ms 11676 KB Output is correct
48 Correct 80 ms 11648 KB Output is correct
49 Correct 66 ms 10700 KB Output is correct
50 Correct 69 ms 11452 KB Output is correct
51 Correct 67 ms 11876 KB Output is correct
52 Correct 63 ms 11656 KB Output is correct