oj.uz

답안 #541255

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541255 2022-03-22T20:37:04 Z Olympia Sjeckanje (COCI21_sjeckanje) C++17
0 / 110
 1 ms 340 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>

using namespace std;
const int MOD = 1e9;

class Node {
public:
    int64_t dp[2][2] = {{-(long long)1e18, -(long long)1e18}, {-(long long)1e18, -(long long)1e18}};
    int64_t left;
    int64_t right;
};

Node merge (Node x, Node y) {
    if (x.right == -1) {
        return y;
    }
    if (y.right == -1) {
        return x;
    }
    Node ans;
    ans.left = x.left;
    ans.right = y.right;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            ans.dp[i][j] = max(ans.dp[i][j], x.dp[i][1] + y.dp[1][j]);
            ans.dp[i][j] = max(ans.dp[i][j], x.dp[i][0] + y.dp[1][j]);
            ans.dp[i][j] = max(ans.dp[i][j], x.dp[i][1] + y.dp[0][j]);
            ans.dp[i][j] = max(ans.dp[i][j], x.dp[i][0] + y.dp[0][j]);
            if (x.right >= y.left) ans.dp[i][j] = max(ans.dp[i][j], x.dp[i][0] + abs(x.right - y.left) + y.dp[0][j]);
            else ans.dp[i][j] = max(ans.dp[i][j], x.dp[i][1] + abs(x.right - y.left) + y.dp[1][j]);
        }
    }
    return ans;
}

void update(Node &x, int val) {
    x.left += val, x.right += val;
}

Node INF;

struct segmentTree {
    vector<Node> vec;
    vector<int64_t> addLater;

    void push(int v) {
        addLater[2 * v + 1] += addLater[v];
        addLater[2 * v] += addLater[v];
        update(vec[2 * v + 1], addLater[v]);
        update(vec[2 * v], addLater[v]);
        addLater[v] = 0;
    }

    void upd(int dum, int tl, int tr, int l, int r, int64_t val) {
        if (tr < l || tl > r) {
            return;
        }
        if (tl >= l && tr <= r) {
            addLater[dum] += val;
            update(vec[dum], val);
            return;
        }
        push(dum);
        int mid = (tl + tr) >> 1;
        upd(2 * dum, tl, mid, l, r, val);
        upd(2 * dum + 1, mid + 1, tr, l, r, val);
        vec[dum] = merge(vec[2 * dum], vec[2 * dum + 1]);
    }

    void upd(int l, int r, int val) {
        upd(1, 0, (int) vec.size() / 2 - 1, l, r, val);
    }

    Node get(int dum, int tl, int tr, int &l, int &r) {
        if (tl > r || tr < l) {
            return INF;
        }
        if (tl >= l && tr <= r) {
            return vec[dum];
        }
        push(dum);
        int tm = (tl + tr) >> 1;
        return merge(get(dum * 2, tl, tm, l, r), get(dum * 2 + 1, tm + 1, tr, l, r));
    }

    Node get(int l, int r) {
        return get(1, 0, (int) vec.size() / 2 - 1, l, r);
    }

    vector<int> arr;

    void init (int dum, int tl, int tr) {
        if (tr >= vec.size()) {
            return;
        }
        if (tl == tr) {
            vec[dum].dp[0][0] = vec[dum].dp[1][1] = 0;
            vec[dum].left = vec[dum].right = arr[tr];
            return;
        }
        int mid = (tl + tr) >> 1;
        init(2 * dum, tl, mid);
        init(2 * dum + 1, mid + 1, tr);
        vec[dum] = merge(vec[2 * dum], vec[2 * dum + 1]);
    }

    int N;

    void resz(int n) {
        N = n;
        int sz = ((1 << (int) ceil(log2(n))));
        vec.assign(sz * 2, INF);
        addLater.resize(sz * 2);
        arr.resize(sz);
    }

    void build () {
        init(1, 0, (int)vec.size()/2 - 1);
    }

};
segmentTree st;
int N;

int main() {
    //freopen("inp.txt", "r", stdin);
    //freopen("haybales.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int D;
    cin >> N >> D;
    st.resz(N);
    for (int i = 0; i < N; i++) {
        cin >> st.arr[i];
    }
    INF.right = -1;
    st.build();
    st.upd(0, 0, 0);
    //cout << max(max(st.vec[1].dp[0][1], st.vec[1].dp[1][1]), max(st.vec[1].dp[1][0], st.vec[1].dp[0][0])) << '\n';
    while (D--) {
        int l, r, x;
        cin >> l >> r >> x;
        l--, r--;
        st.upd(l, r, x);
        cout << max(max(st.get(0, N - 1).dp[1][1], st.get(0, N - 1).dp[1][0]), max(st.get(0, N - 1).dp[0][1], st.get(0, N - 1).dp[0][0])) << '\n';
    }
}

Compilation message

Main.cpp: In member function 'void segmentTree::init(int, int, int)':
Main.cpp:103:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |         if (tr >= vec.size()) {
      |             ~~~^~~~~~~~~~~~~

Subtask #1
0 / 15.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 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 40.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 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 55.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 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -