Submission #1201489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1201489		HappyCapybara	Distributing Candies (IOI21_candies)	C++17	0 / 100	1587 ms	51320 KiB

candies

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

int n, k;
vector<vector<int>> st;

vector<int> merge(vector<int> a, vector<int> b){
    pair<int,int> nr = {a[0]+a[2], a[1]+a[2]};
    pair<int,int> nnr = {max(nr.first, b[0]), min(nr.second, b[1])};
    if (b[0] > nnr.second) nnr = {b[0], b[0]};
    if (b[1] < nnr.first) nnr = {b[1], b[1]};
    int nm = a[2]+b[2];
    if (nnr.first == nnr.second) nm = max(0, min(k, nm));
    return {max(0, min(k, nnr.first-a[2])), max(0, min(k, nnr.second-a[2])), nm};
}

void pushdown(int node, int tl, int tr){
    if (tl == tr) return;
    st[node*2] = merge(st[node*2], st[node]);
    st[node*2+1] = merge(st[node*2+1], st[node]);
    st[node] = {0, k, 0};
}

void update(int l, int r, int v, int node=1, int tl=0, int tr=n-1){
    pushdown(node, tl, tr);
    if (l <= tl && tr <= r){
        if (v > 0) st[node] = merge(st[node], {0, k-min(k, v), min(k, v)});
        else st[node] = merge(st[node], {min(k, -v), k, max(-k, v)});
        return;
    }
    int tm = (tl+tr)/2;
    if (l <= tm) update(l, r, v, node*2, tl, tm);
    if (tm+1 <= r) update(l, r, v, node*2+1, tm+1, tr);
}

int query(int pos){
    int node = 1, tl = 0, tr = n-1;
    while (tl != tr){
        int tm = (tl+tr)/2;
        if (pos <= tm){
            node = node*2;
            tr = tm;
        }
        else {
            node = node*2+1;
            tl = tm+1;
        }
    }
    vector<int> res = {0, k, 0};
    while (true){
        res = merge(res, st[node]);
        if (node == 1) break;
        node >>= 1;
    }
    return res[0]+res[2];
}

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    n = c.size();
    k = c[0];
    st.resize(4*n, {0, k, 0});
    int q = l.size();
    /*vector<int> res = {0, k, 0};
    for (int i=0; i<q; i++){
        res = merge(res, {max(0, min(k, -v[i])), min(k, k-min(k, v[i])), v[i]});
        cout << res[0] << " " << res[1] << " " << res[2] << endl;
    }*/
    for (int i=0; i<q; i++) update(l[i], r[i], v[i]);
    vector<int> res(n);
    for (int i=0; i<n; i++) res[i] = query(i);
    return res;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33