oj.uz

답안 #743076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743076 2023-05-17T07:45:44 Z Mauve 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 107164 KB 
#include <bits/stdc++.h>

using namespace std;
#define low(i) (i<<(__builtin_clz(i)-31+n_bits))-(1<<n_bits)
#define high(i) ((i+1)<<(__builtin_clz(i)-31+n_bits))-(1<<n_bits)-1

const int n_bits=20;
const long long inf = 1e18;
long long minseg[2][1<<(n_bits+1)];
long long maxseg[2][1<<(n_bits+1)];
long long lazyadd[2][1<<(n_bits+1)];

struct segtree {
    int id;
    segtree(int q, int _id) {
        id = _id;
        for(int i=q+1; i<(1<<n_bits); i++) {
            minseg[id][i+(1<<n_bits)] = inf;
            maxseg[id][i+(1<<n_bits)] = 0;
        }
        for(int i=0; i<=q; i++) {
            minseg[id][i+(1<<n_bits)] = 0;
            maxseg[id][i+(1<<n_bits)] = 0;
        }
        for(int i=(1<<n_bits)-1; i>=1; i--) {
            minseg[id][i] = min(minseg[id][2*i], minseg[id][2*i+1]);
            maxseg[id][i] = max(maxseg[id][2*i], maxseg[id][2*i+1]);
        }
        for(int i=0; i<(1<<(n_bits+1)); i++) {
            lazyadd[id][i] = 0;
        }
    }
    void value(int node) {
        minseg[id][node] += lazyadd[id][node];
        maxseg[id][node] += lazyadd[id][node];
        if(node<(1<<n_bits)) {
            lazyadd[id][2*node] += lazyadd[id][node];
            lazyadd[id][2*node+1] += lazyadd[id][node];
        }
        lazyadd[id][node] = 0;
    }

    void update(int node, int left, int right, long long change) {
        value(node);
        if(right>=high(node) && left<=low(node)) {
            lazyadd[id][node] += change;
        } else if(right<low(node) || left>high(node)) {
            return;
        } else {
            update(2*node, left, right, change);
            update(2*node+1, left, right, change);
            value(node*2);
            value(node*2+1);
            minseg[id][node] = min(minseg[id][node*2], minseg[id][node*2+1]);
            maxseg[id][node] = max(maxseg[id][node*2], maxseg[id][node*2+1]);
        }
    }

    void update(int left, int right, long long change) {
        update(1, left, right, change);
    }

    long long minquery(int node, int left, int right) {
        value(node);
        if(right>=high(node) && left<=low(node)) {
            return minseg[id][node];
        } else if(right<low(node) || left>high(node)) {
            return inf;
        } else {
            return min(minquery(node*2, left, right), minquery(node*2+1, left, right));
        }
    }

    long long maxquery(int node, int left, int right) {
        value(node);
        if(right>=high(node) && left<=low(node)) {
            return maxseg[id][node];
        } else if(right<low(node) || left>high(node)) {
            return -inf;
        } else {
            return max(maxquery(node*2, left, right), maxquery(node*2+1, left, right));
        }
    }

    long long range(int left, int right) {
        return maxquery(1, left, right) - minquery(1, left, right); // gives the difference between max and min
    }

    void reset_negative(int node, segtree *other) {
        value(node);
        if(maxseg[id][node]<0) {
            other -> update(low(node), high(node), maxseg[id][node]);
            update(low(node), high(node), -maxseg[id][node]); // increment by corresponding amount
            assert(maxseg[id][node]==0);
        }
        if(minseg[id][node] >= 0) {
            return;
        }
        reset_negative(2*node, other);
        reset_negative(2*node+1, other);
    }
    void reset_overflow(int node, int cap) {
        value(node);
        assert(lazyadd[id][node]==0);
        if(minseg[id][node] > cap) {
            update(low(node), high(node), cap - minseg[id][node]); // decrease value
            assert(minseg[id][node]==cap);
        }
        if(maxseg[id][node] <= cap) {
            return;
        }
        reset_overflow(2*node, cap);
        reset_overflow(2*node+1, cap);
    }
};

vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
    int n = C.size();
    int q = L.size();

    segtree s0(n, 0); // s0 stores normal
    segtree s1(n, 1); // s1 stores "inverted"
    // fill all boxes
    for(int i=0; i<n; i++) {
        s1.update(i, i, C[i]); // in s1, all boxes are initially full
    }

    for(int i = 0; i < q; ++i) {
        s0.update(L[i], R[i], V[i]); // segtree stores values as if the boxes have infinite capacity
        s1.update(L[i], R[i], -V[i]);
        if(i%100==0 || q-i<5000) {
            if(V[i]<0) {
                s0.reset_negative(1, &s1);
            } else {
                s1.reset_negative(1, &s0);
            }
        }
    }
    vector<int> ans(n);

    for(int i=0; i<n; i++) {
        ans[i] = min(s0.maxquery(1, i, i), (long long)C[i]);
    }
    return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 98664 KB Output is correct
2 Correct 50 ms 98776 KB Output is correct
3 Correct 71 ms 98716 KB Output is correct
4 Correct 93 ms 98720 KB Output is correct
5 Correct 992 ms 98876 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5047 ms 107164 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 98776 KB Output is correct
2 Incorrect 561 ms 105052 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 98764 KB Output is correct
2 Correct 53 ms 98784 KB Output is correct
3 Execution timed out 5049 ms 104920 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 98664 KB Output is correct
2 Correct 50 ms 98776 KB Output is correct
3 Correct 71 ms 98716 KB Output is correct
4 Correct 93 ms 98720 KB Output is correct
5 Correct 992 ms 98876 KB Output is correct
6 Execution timed out 5047 ms 107164 KB Time limit exceeded
7 Halted 0 ms 0 KB -