oj.uz

답안 #887269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887269 2023-12-14T07:11:21 Z hafo Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 120 ms 14676 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, q, s, t, a[maxn], l, r, x, type[maxn];

struct BIT {
    ll bit[maxn];

    void update(int x, ll val) {
        for(; x <= n; x += x&-x) bit[x] += val;
    }
    
    ll get(int x) {
        ll ans = 0;
        for(; x; x -= x&-x) ans += bit[x];
        return ans;
    }

} bit[2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>q>>s>>t;
    for(int i = 0; i <= n; i++) cin>>a[i];
    for(int i = 1; i <= n; i++) {
        type[i] = (a[i - 1] - a[i] >= 0);
        bit[type[i]].update(i, a[i - 1] - a[i]);
    }

    while(q--) {
        cin>>l>>r>>x;
        ll val = bit[type[l]].get(l) - bit[type[l]].get(l - 1);
        bit[type[l]].update(l, -val);
        val -= x;
        type[l] = (val >= 0);
        bit[type[l]].update(l, val);

        if(r < n) {
            val = bit[type[r + 1]].get(r + 1) - bit[type[r + 1]].get(r);
            bit[type[r + 1]].update(r + 1, -val);
            val += x;
            type[r + 1] = (val >= 0);
            bit[type[r + 1]].update(r + 1, val);
        }

        cout<<bit[0].get(n) * s + bit[1].get(n) * t<<"\n"; 
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4440 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 2 ms 4572 KB Output is correct
12 Correct 2 ms 4612 KB Output is correct
13 Correct 1 ms 4576 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4568 KB Output is correct
16 Correct 2 ms 4624 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4636 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4560 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 11856 KB Output is correct
2 Correct 100 ms 12520 KB Output is correct
3 Correct 99 ms 13000 KB Output is correct
4 Correct 94 ms 12368 KB Output is correct
5 Correct 96 ms 13668 KB Output is correct
6 Correct 82 ms 12656 KB Output is correct
7 Correct 79 ms 12568 KB Output is correct
8 Correct 94 ms 13504 KB Output is correct
9 Correct 95 ms 13704 KB Output is correct
10 Correct 90 ms 12476 KB Output is correct
11 Correct 120 ms 12480 KB Output is correct
12 Correct 84 ms 13216 KB Output is correct
13 Correct 83 ms 13388 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4440 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 2 ms 4572 KB Output is correct
12 Correct 2 ms 4612 KB Output is correct
13 Correct 1 ms 4576 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4568 KB Output is correct
16 Correct 2 ms 4624 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4636 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4560 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 97 ms 11856 KB Output is correct
23 Correct 100 ms 12520 KB Output is correct
24 Correct 99 ms 13000 KB Output is correct
25 Correct 94 ms 12368 KB Output is correct
26 Correct 96 ms 13668 KB Output is correct
27 Correct 82 ms 12656 KB Output is correct
28 Correct 79 ms 12568 KB Output is correct
29 Correct 94 ms 13504 KB Output is correct
30 Correct 95 ms 13704 KB Output is correct
31 Correct 90 ms 12476 KB Output is correct
32 Correct 120 ms 12480 KB Output is correct
33 Correct 84 ms 13216 KB Output is correct
34 Correct 83 ms 13388 KB Output is correct
35 Correct 96 ms 12104 KB Output is correct
36 Correct 113 ms 13392 KB Output is correct
37 Correct 99 ms 14164 KB Output is correct
38 Correct 101 ms 13908 KB Output is correct
39 Correct 108 ms 14028 KB Output is correct
40 Correct 101 ms 13988 KB Output is correct
41 Correct 100 ms 13904 KB Output is correct
42 Correct 100 ms 14120 KB Output is correct
43 Correct 96 ms 13136 KB Output is correct
44 Correct 95 ms 13652 KB Output is correct
45 Correct 102 ms 13960 KB Output is correct
46 Correct 100 ms 14676 KB Output is correct
47 Correct 82 ms 13396 KB Output is correct
48 Correct 90 ms 13168 KB Output is correct
49 Correct 86 ms 12216 KB Output is correct
50 Correct 83 ms 12880 KB Output is correct
51 Correct 79 ms 13392 KB Output is correct
52 Correct 81 ms 13136 KB Output is correct