oj.uz

Submission #245274

# Submission time Handle Problem Language Result Execution time Memory
245274 2020-07-05T22:25:02 Z WhaleVomit Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 187 ms 7800 KB 
#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()

#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;

template<int sz> struct BIT {
    ll b[sz+1];
    BIT() {
        M00(i, sz+1) b[i] = 0;
    }
    void add(int k, ll val) {
        k++;
        for(; k <= sz; k+=(k&-k)) b[k] += val;
    }
    ll psum(int ind) {
        ll ans = 0;
        ind++;
        for(; ind>0; ind-=(ind&-ind)) ans+=b[ind];
        return ans;
    }
    ll sum(int l, int r) {
        return psum(r) - psum(l-1);
    }
    void upd(int l, int r, ll x) {
        add(l, x);
        if(r != sz-1) add(r+1, -x);
    }
    ll query(int idx) {
        return psum(idx);
    }
};

const int MAX_N = 200200;
BIT<MAX_N> st;
ll S, T;

ll get(int i) {
    ll x1 = st.query(i);
    ll x2 = st.query(i+1);
    if(x1 < x2) return -S*(x2-x1);
    else return T*(x1-x2);
}

int main() { FAST
    int n, q;
    cin >> n >> q >> S >> T;
    n++;
    vector<ll> arr(n);
    M00(i, n) cin >> arr[i];
    M00(i, n) st.upd(i, i, arr[i]);
    ll ans = 0;
    M00(i, n-1) ans += get(i);
    M00(i, q) {
        int l, r, x; cin >> l >> r >> x;
        if(l != 0) ans -= get(l-1);
        if(r != n-1) ans -= get(r);
        st.upd(l,r,x);
        if(l != 0) ans += get(l-1);
        if(r != n-1) ans += get(r);
        cout << ans << "\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1920 KB Output is correct
2 Correct 7 ms 1920 KB Output is correct
3 Correct 7 ms 1920 KB Output is correct
4 Correct 7 ms 1920 KB Output is correct
5 Correct 7 ms 2048 KB Output is correct
6 Correct 7 ms 1920 KB Output is correct
7 Correct 7 ms 2048 KB Output is correct
8 Correct 7 ms 2048 KB Output is correct
9 Correct 7 ms 1920 KB Output is correct
10 Correct 7 ms 1920 KB Output is correct
11 Correct 7 ms 1920 KB Output is correct
12 Correct 7 ms 2048 KB Output is correct
13 Correct 7 ms 1920 KB Output is correct
14 Correct 7 ms 1920 KB Output is correct
15 Correct 7 ms 1920 KB Output is correct
16 Correct 6 ms 1920 KB Output is correct
17 Correct 7 ms 1920 KB Output is correct
18 Correct 6 ms 1920 KB Output is correct
19 Correct 5 ms 1920 KB Output is correct
20 Correct 5 ms 1920 KB Output is correct
21 Correct 5 ms 1920 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 5016 KB Output is correct
2 Correct 170 ms 5720 KB Output is correct
3 Correct 168 ms 6136 KB Output is correct
4 Correct 175 ms 5244 KB Output is correct
5 Correct 172 ms 6520 KB Output is correct
6 Correct 133 ms 7032 KB Output is correct
7 Correct 131 ms 6904 KB Output is correct
8 Correct 171 ms 6904 KB Output is correct
9 Correct 168 ms 7416 KB Output is correct
10 Correct 165 ms 6008 KB Output is correct
11 Correct 136 ms 7032 KB Output is correct
12 Correct 134 ms 7416 KB Output is correct
13 Correct 130 ms 7800 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1920 KB Output is correct
2 Correct 7 ms 1920 KB Output is correct
3 Correct 7 ms 1920 KB Output is correct
4 Correct 7 ms 1920 KB Output is correct
5 Correct 7 ms 2048 KB Output is correct
6 Correct 7 ms 1920 KB Output is correct
7 Correct 7 ms 2048 KB Output is correct
8 Correct 7 ms 2048 KB Output is correct
9 Correct 7 ms 1920 KB Output is correct
10 Correct 7 ms 1920 KB Output is correct
11 Correct 7 ms 1920 KB Output is correct
12 Correct 7 ms 2048 KB Output is correct
13 Correct 7 ms 1920 KB Output is correct
14 Correct 7 ms 1920 KB Output is correct
15 Correct 7 ms 1920 KB Output is correct
16 Correct 6 ms 1920 KB Output is correct
17 Correct 7 ms 1920 KB Output is correct
18 Correct 6 ms 1920 KB Output is correct
19 Correct 5 ms 1920 KB Output is correct
20 Correct 5 ms 1920 KB Output is correct
21 Correct 5 ms 1920 KB Output is correct
22 Correct 169 ms 5016 KB Output is correct
23 Correct 170 ms 5720 KB Output is correct
24 Correct 168 ms 6136 KB Output is correct
25 Correct 175 ms 5244 KB Output is correct
26 Correct 172 ms 6520 KB Output is correct
27 Correct 133 ms 7032 KB Output is correct
28 Correct 131 ms 6904 KB Output is correct
29 Correct 171 ms 6904 KB Output is correct
30 Correct 168 ms 7416 KB Output is correct
31 Correct 165 ms 6008 KB Output is correct
32 Correct 136 ms 7032 KB Output is correct
33 Correct 134 ms 7416 KB Output is correct
34 Correct 130 ms 7800 KB Output is correct
35 Correct 164 ms 5624 KB Output is correct
36 Correct 176 ms 7048 KB Output is correct
37 Correct 179 ms 7800 KB Output is correct
38 Correct 177 ms 7544 KB Output is correct
39 Correct 173 ms 7544 KB Output is correct
40 Correct 178 ms 7544 KB Output is correct
41 Correct 178 ms 7416 KB Output is correct
42 Correct 174 ms 7544 KB Output is correct
43 Correct 171 ms 6776 KB Output is correct
44 Correct 169 ms 7160 KB Output is correct
45 Correct 172 ms 7028 KB Output is correct
46 Correct 187 ms 7756 KB Output is correct
47 Correct 139 ms 7548 KB Output is correct
48 Correct 136 ms 7800 KB Output is correct
49 Correct 156 ms 6776 KB Output is correct
50 Correct 139 ms 7544 KB Output is correct
51 Correct 132 ms 7672 KB Output is correct
52 Correct 139 ms 7604 KB Output is correct