제출 #422372

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422372		lyc	푸드 코트 (JOI21_foodcourt)	C++14	0 / 100	499 ms	28648 KiB

foodcourt

#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;

const int mxN = 250005;
const int mxM = 250005;
const int mxQ = 250005;

int N, M, Q;
int group[mxM];

struct node {
    int s, e, m;
    ll vsum; bool vmax;
    node *l, *r;
    node(int s, int e): s(s), e(e), m((s+e)/2), vsum(0), vmax(0) {
        if (s != e) {
            l = new node(s,m);
            r = new node(m+1,e);
        }
    }

    void pushdown() {
        if (vmax) {
            if (vsum < 0) {
                if (s != e) {
                    l->vsum += vsum;
                    r->vsum += vsum;
                }
                vsum = 0;
            }

            if (s != e) {
                l->vmax = r->vmax = 1;
            }
            vmax = 0;
        }
    }

    void uadd(int a, int b, int c) {
        pushdown();
        if (a <= s && e <= b) {
            vsum += c;
        } else {
            if (a <= m) l->uadd(a,b,c);
            if (b > m) r->uadd(a,b,c);
        }
    }

    void umax(int a, int b) {
        pushdown();
        if (a <= s && e <= b) {
            vmax = 1;
        } else {
            if (a <= m) l->umax(a,b);
            if (b > m) r->umax(a,b);
        }
    }

    ll qsum(int a) {
        pushdown();
        //assert(vsum >= 0);
        ll ret = vsum;
        if (s != e) {
            if (a <= m) ret += l->qsum(a);
            else ret += r->qsum(a);
        }
        return ret;
    }

} *root;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);

    cin >> N >> M >> Q;
    root = new node(1,N);
    FOR(i,1,Q){
        int T, L, R, C, K, A;
        long long B;
        cin >> T;
        if (T == 1) {
            cin >> L >> R >> C >> K;
            root->uadd(L,R,K);
        } else if (T == 2) {
            cin >> L >> R >> K;
            root->uadd(L,R,-K);
            root->umax(L,R);
        } else {
            cin >> A >> B;
            int res = root->qsum(A) >= B ? 1 : 0;
            cout << res << '\n';
        }
    }
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 7
• Subtask 4: 0 / 21
• Subtask 5: 0 / 15
• Subtask 6: 0 / 13
• Subtask 7: 0 / 26
• Subtask 8: 0 / 11