oj.uz

답안 #773282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773282 2023-07-04T18:53:23 Z kirakaminski968 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 103 ms 13144 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int N,Q; ll S,T; cin >> N >> Q >> S >> T;
    vector<ll> arr(N+1);
    for(int i = 0;i<=N;++i) cin >> arr[i];
    vector<ll> diff(N);
    for(int i = 0;i<N;++i) diff[i] = arr[i]-arr[i+1];
    ll ans = 0;
    for(int i = 0;i<N;++i){
        if(diff[i] < 0) ans += S*diff[i];
        else ans += T*diff[i];
    }
    //cout << ans << "\n";
    while(Q--){
        int l,r; ll val; cin >> l >> r >> val;
        ll x;
        if(diff[l-1] < 0) x = S*diff[l-1];
        else x = T*diff[l-1];
        ans -= x;
        diff[l-1] -= val;
        if(diff[l-1] < 0) x = S*diff[l-1];
        else x = T*diff[l-1];
        ans += x;
        if(r < N){
            if(diff[r] < 0) x = S*diff[r];
            else x = T*diff[r];
            ans -= x;
            diff[r] += val;
            if(diff[r] < 0) x = S*diff[r];
            else x = T*diff[r];
            ans += x;
        }
        cout << ans << "\n";
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 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 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 428 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 336 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 1 ms 260 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 10196 KB Output is correct
2 Correct 88 ms 10860 KB Output is correct
3 Correct 82 ms 11480 KB Output is correct
4 Correct 85 ms 10848 KB Output is correct
5 Correct 86 ms 12056 KB Output is correct
6 Correct 71 ms 11084 KB Output is correct
7 Correct 71 ms 10956 KB Output is correct
8 Correct 103 ms 11844 KB Output is correct
9 Correct 87 ms 12096 KB Output is correct
10 Correct 78 ms 10836 KB Output is correct
11 Correct 65 ms 10960 KB Output is correct
12 Correct 70 ms 11648 KB Output is correct
13 Correct 70 ms 11848 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 340 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 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 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 428 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 336 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 1 ms 260 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 81 ms 10196 KB Output is correct
23 Correct 88 ms 10860 KB Output is correct
24 Correct 82 ms 11480 KB Output is correct
25 Correct 85 ms 10848 KB Output is correct
26 Correct 86 ms 12056 KB Output is correct
27 Correct 71 ms 11084 KB Output is correct
28 Correct 71 ms 10956 KB Output is correct
29 Correct 103 ms 11844 KB Output is correct
30 Correct 87 ms 12096 KB Output is correct
31 Correct 78 ms 10836 KB Output is correct
32 Correct 65 ms 10960 KB Output is correct
33 Correct 70 ms 11648 KB Output is correct
34 Correct 70 ms 11848 KB Output is correct
35 Correct 78 ms 10444 KB Output is correct
36 Correct 82 ms 11860 KB Output is correct
37 Correct 82 ms 12620 KB Output is correct
38 Correct 82 ms 12364 KB Output is correct
39 Correct 81 ms 12452 KB Output is correct
40 Correct 81 ms 12404 KB Output is correct
41 Correct 82 ms 12244 KB Output is correct
42 Correct 82 ms 12344 KB Output is correct
43 Correct 79 ms 11664 KB Output is correct
44 Correct 84 ms 11976 KB Output is correct
45 Correct 76 ms 12104 KB Output is correct
46 Correct 78 ms 13144 KB Output is correct
47 Correct 72 ms 11700 KB Output is correct
48 Correct 70 ms 11608 KB Output is correct
49 Correct 70 ms 10612 KB Output is correct
50 Correct 66 ms 11460 KB Output is correct
51 Correct 71 ms 11860 KB Output is correct
52 Correct 83 ms 11600 KB Output is correct