oj.uz

답안 #835478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835478 2023-08-23T14:59:01 Z Koyote Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 351 ms 17740 KB 
#include <bits/stdc++.h>
using namespace std;

template<class T> void read(T &u) { cin >> u; }
template<class T, class... U> void read(T &u, U &...v) { read(u); read(v...); }

template <class S, S (*op)(S, S), S (*e)(),
          class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
  public:
    lazy_segtree() : lazy_segtree(0) {}
    lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = lazy_segtree<S, op, e, F, mapping, composition, id>::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) update(i);
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();

        l += size, r += size;
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push(r >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1, r >>= 1;
        }

        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;

        l += size, r += size;
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1, r >>= 1;
            }
            l = l2, r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

  private:
    static int ceil_pow2(int n) {
        int x = 0;
        while ((1U << x) < (unsigned int)(n)) x++;
        return x;
    }
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
};

const int N = 2e5 + 2;
int n, q;
int64_t s, t;
vector<int64_t> a;

int64_t op(int64_t x, int64_t y) { return x ^ y; }
int64_t e() { return 0; }
struct F { int64_t delta; };
int64_t mapping(F x, int64_t y) { return y + x.delta; }
F composition(F x, F y) { return F{x.delta + y.delta}; }
F id() { return F{0}; }

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    read(n, q, s, t); a.resize(n + 1);
    for (int64_t &i : a) read(i);
    lazy_segtree<int64_t, op, e, F, mapping, composition, id> b(a);

    int64_t val = 0;
    for (int i = 0; i < n; i++) {
        if (a[i] < a[i + 1]) val -= s * (a[i + 1] - a[i]);
        else val += t * (a[i] - a[i + 1]);
    }
    while (q--) {
        int l, r;
        int64_t x; read(l, r, x);
        
        {
            int64_t Lvalue = b.get(l), Lvalue_before = b.get(l - 1);
            if (Lvalue_before < Lvalue) val += s * (Lvalue - Lvalue_before);
            else val -= t * (Lvalue_before - Lvalue);

            if (Lvalue_before < (x + Lvalue)) val -= s * ((x + Lvalue) - Lvalue_before);
            else val += t * (Lvalue_before - (x + Lvalue));
        }

        if (r < n) {
            int64_t Rvalue = b.get(r), Rvalue_after = b.get(r + 1);
            if (Rvalue < Rvalue_after) val += s * (Rvalue_after - Rvalue);
            else val -= t * (Rvalue - Rvalue_after);

            if ((Rvalue + x) < Rvalue_after) val -= s * (Rvalue_after - (Rvalue + x));
            else val += t * ((Rvalue + x) - Rvalue_after);
        }

        cout << val << '\n';
        b.apply(l, r + 1, F{x});
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 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 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 9396 KB Output is correct
2 Correct 179 ms 10188 KB Output is correct
3 Correct 179 ms 10592 KB Output is correct
4 Correct 181 ms 9872 KB Output is correct
5 Correct 176 ms 10572 KB Output is correct
6 Correct 307 ms 11032 KB Output is correct
7 Correct 332 ms 10904 KB Output is correct
8 Correct 165 ms 10944 KB Output is correct
9 Correct 165 ms 11212 KB Output is correct
10 Correct 165 ms 9932 KB Output is correct
11 Correct 192 ms 10992 KB Output is correct
12 Correct 284 ms 11328 KB Output is correct
13 Correct 333 ms 16592 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 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 212 KB Output is correct
22 Correct 175 ms 9396 KB Output is correct
23 Correct 179 ms 10188 KB Output is correct
24 Correct 179 ms 10592 KB Output is correct
25 Correct 181 ms 9872 KB Output is correct
26 Correct 176 ms 10572 KB Output is correct
27 Correct 307 ms 11032 KB Output is correct
28 Correct 332 ms 10904 KB Output is correct
29 Correct 165 ms 10944 KB Output is correct
30 Correct 165 ms 11212 KB Output is correct
31 Correct 165 ms 9932 KB Output is correct
32 Correct 192 ms 10992 KB Output is correct
33 Correct 284 ms 11328 KB Output is correct
34 Correct 333 ms 16592 KB Output is correct
35 Correct 182 ms 14980 KB Output is correct
36 Correct 180 ms 16456 KB Output is correct
37 Correct 192 ms 17188 KB Output is correct
38 Correct 193 ms 17068 KB Output is correct
39 Correct 271 ms 16972 KB Output is correct
40 Correct 187 ms 16980 KB Output is correct
41 Correct 195 ms 16844 KB Output is correct
42 Correct 199 ms 16912 KB Output is correct
43 Correct 200 ms 16200 KB Output is correct
44 Correct 189 ms 16584 KB Output is correct
45 Correct 208 ms 16664 KB Output is correct
46 Correct 186 ms 17740 KB Output is correct
47 Correct 337 ms 16424 KB Output is correct
48 Correct 143 ms 16208 KB Output is correct
49 Correct 175 ms 15376 KB Output is correct
50 Correct 196 ms 16076 KB Output is correct
51 Correct 284 ms 16600 KB Output is correct
52 Correct 351 ms 16212 KB Output is correct