oj.uz

답안 #539309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
539309 2022-03-18T16:39:14 Z SlavicG Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 175 ms 13148 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

#define int long long
template<typename T, bool zero_indexing>
struct fenwick_tree {
    int N;
    vector<T> fen;
    fenwick_tree(int n) {
        N = n, fen.assign(n + 1, 0);
    }
    fenwick_tree(vector<T> a) {
        N = a.size();
        fen.assign(N + 1, 0);
        for(int i = 0; i < N; ++i) {
            add(i, a[i]);
        }
    }
    void add(int p, T val) {
        for(int i = p + zero_indexing;i <= N;i += i & -i) {
            fen[i] += val;
        }
    }
    void set(int p, T val) {
        T set_val = val - query(p, p);
        add(p, set_val);
    }

    T query(int l, int r) {
        T ret = 0;
        for(int i = r + zero_indexing; i >= 1; i -= i & -i) {
            ret += fen[i];
        }   
        for(int i = l + zero_indexing - 1; i >= 1; i -= i & -i) {
            ret -= fen[i];
        }   
        return ret;
    }
};

ll gett(int a, int b) {return a + b;}
ll upp(int a, int b) {return a + b;}
void solve() {
    int n, q, s, t;
    cin >> n >> q >> s >> t; ++n;

    vector<int> a(n);
    fenwick_tree<ll, 1> st(n + 2);
        

    for(int i = 0;i < n; ++i) {
        cin >> a[i];
        st.add(i, a[i]);
        st.add(i + 1, -a[i]);
    }
    ll ans = 0;
    for(int i = 0; i + 1 < n; ++i) {
        if(a[i] < a[i + 1]) {
            ans -= abs(a[i + 1] - a[i]) * s;
        } else {
            ans += abs(a[i] - a[i + 1]) * t;
        }
    }

    while(q--) {
        int l, r, x;
        cin >> l >> r >> x;

        ll prev = st.query(0, l - 1);
        ll now = st.query(0, l), next;
        if(prev < now) ans += abs(now - prev) * s;
        else ans -= abs(now - prev) * t;

        if(r + 1 < n) {
            now = st.query(0, r);
            next = st.query(0, r + 1);
            if(now < next)ans += abs(next - now) * s; 
            else ans -= abs(now - next) * t;
        }
        st.add(l, x);
        st.add(r + 1, -x);
        prev = st.query(0, l - 1);
        now = st.query(0, l);

        if(prev < now) ans -= abs(now - prev) * s;
        else ans += abs(prev - now) * t;

        if(r + 1 < n) {
            now = st.query(0, r);
            next = st.query(0, r + 1);
            if(now < next)ans -= abs(next - now) * s; 
            else ans += abs(now - next) * t;
        }

        cout << ans << "\n";

    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 404 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 408 KB Output is correct
13 Correct 2 ms 392 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 396 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 10204 KB Output is correct
2 Correct 140 ms 10844 KB Output is correct
3 Correct 175 ms 11380 KB Output is correct
4 Correct 131 ms 10840 KB Output is correct
5 Correct 137 ms 11996 KB Output is correct
6 Correct 113 ms 11036 KB Output is correct
7 Correct 91 ms 10976 KB Output is correct
8 Correct 137 ms 11852 KB Output is correct
9 Correct 132 ms 12104 KB Output is correct
10 Correct 153 ms 10828 KB Output is correct
11 Correct 107 ms 10860 KB Output is correct
12 Correct 99 ms 11724 KB Output is correct
13 Correct 121 ms 11888 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 404 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 408 KB Output is correct
13 Correct 2 ms 392 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 396 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 156 ms 10204 KB Output is correct
23 Correct 140 ms 10844 KB Output is correct
24 Correct 175 ms 11380 KB Output is correct
25 Correct 131 ms 10840 KB Output is correct
26 Correct 137 ms 11996 KB Output is correct
27 Correct 113 ms 11036 KB Output is correct
28 Correct 91 ms 10976 KB Output is correct
29 Correct 137 ms 11852 KB Output is correct
30 Correct 132 ms 12104 KB Output is correct
31 Correct 153 ms 10828 KB Output is correct
32 Correct 107 ms 10860 KB Output is correct
33 Correct 99 ms 11724 KB Output is correct
34 Correct 121 ms 11888 KB Output is correct
35 Correct 142 ms 10428 KB Output is correct
36 Correct 149 ms 11748 KB Output is correct
37 Correct 136 ms 12608 KB Output is correct
38 Correct 151 ms 12388 KB Output is correct
39 Correct 137 ms 12452 KB Output is correct
40 Correct 147 ms 12472 KB Output is correct
41 Correct 174 ms 12224 KB Output is correct
42 Correct 144 ms 12320 KB Output is correct
43 Correct 168 ms 11596 KB Output is correct
44 Correct 131 ms 11980 KB Output is correct
45 Correct 136 ms 12096 KB Output is correct
46 Correct 135 ms 13148 KB Output is correct
47 Correct 104 ms 11624 KB Output is correct
48 Correct 109 ms 11692 KB Output is correct
49 Correct 134 ms 10708 KB Output is correct
50 Correct 98 ms 11436 KB Output is correct
51 Correct 104 ms 11884 KB Output is correct
52 Correct 105 ms 11588 KB Output is correct