BZOJ3110 K大数查询

/**
思路：CDQ分治 + 整体二分，就是对整体的答案二分，对于所有答案落在[L, R]的查询，对[L, mid]的操作更新，然后
将当前的查询分为答案比mid小的S1部分和答案比mid大的S2部分，递归处理[L, mid, S1]和[mid + 1, R, S2]
**/
#include<bits/stdc++.h>
typedef long long ll;
const ll maxn = 5e4 + 10;
const ll INF = 1e8 + 10;
using namespace std;

struct query {
    ll o, x, y, val, id, fac_id;
    query() {}
    query(ll o, ll x, ll y, ll v, ll id) :
        o(o), x(x), y(y), val(v), id(id) {}
    void input(ll i) { scanf("%lld %lld %lld %lld", &o, &x, &y, &val); id = i; }
    bool operator < (query p) const { return val < p.val; }
} res[maxn], change[maxn], qry[maxn], tal[maxn];
struct seg_ment {
    ll sum, ls, rs, data;
    seg_ment(ll sum = 0, ll ls = 0, ll rs = 0) :
        sum(sum), ls(ls), rs(rs) {}
} seg[maxn * 4];
ll n, m, ans[maxn], ql, qr;
ll can[maxn], notcan[maxn], all[maxn];
ll b[maxn], cnt, cntq;
map<ll, ll> idx_first, idx_second;
ll cnum, qnum, cnt_node, idx[maxn * 3];
bool cmp1(query p1, query p2) { return p1.id < p2.id; }

void build(ll o, ll l, ll r) {
    seg[o].sum = seg[o].ls = seg[o].rs = seg[o].data = 0;
    if(l == r) return ;
    ll mid = (l + r) >> 1;
    seg[o].ls = cnt_node++; build(seg[o].ls, l, mid);
    seg[o].rs = cnt_node++; build(seg[o].rs, mid + 1, r);
}

void push_down(ll o, ll l, ll mid, ll r) {
    ll ls = seg[o].ls, rs = seg[o].rs, t = seg[o].data;
    seg[ls].sum += (idx[mid] - idx[l - 1]) * t;
    seg[rs].sum += (idx[r] - idx[mid]) * t;
    seg[ls].data += t; seg[rs].data += t; seg[o].data = 0;
}

void update(ll o, ll l, ll r) {
    if(l > qr || r < ql) return ;
    if(l >= ql && r <= qr) { seg[o].sum += (idx[r] - idx[l - 1]); seg[o].data++; return ; }
    ll mid = (l + r) >> 1, o1 = seg[o].ls, o2 = seg[o].rs;
    push_down(o, l, mid, r);
    update(o1, l, mid); update(o2, mid + 1, r);
    seg[o].sum = seg[o1].sum + seg[o2].sum;
}

ll ask(ll o, ll l, ll r) {
    if(l > qr || r < ql) return 0;
    if(l >= ql && r <= qr) return seg[o].sum;
    ll mid = (l + r) >> 1, o1 = seg[o].ls, o2 = seg[o].rs;
    push_down(o, l, mid, r);
    ll p1 = ask(o1, l, mid);
    ll p2 = ask(o2, mid + 1, r);
    seg[o].sum = seg[o1].sum + seg[o2].sum;
    return p1 + p2;
}

void add(query p, ll &v) { idx[v++] = p.x; idx[v++] = p.y; idx[v++] = p.x - 1; }

void solve(ll l, ll r, ll from, ll to) {
    if(from == to) return ;
    ll mid = (l + r) >> 1, v1 = b[l], v2 = b[mid];
    ll id1 = idx_first[v1], id2 = idx_second[v2];
    ll tot = 0, v = 0, t1 = 0, t2 = 0, now = from; cnt_node = 1;
    for(ll i = from; i < to; i++) { tal[tot++] = qry[all[i]]; add(qry[all[i]], v); }
    for(ll i = id1; i <= id2; i++) { tal[tot++] = change[i]; add(change[i], v); }
    sort(tal, tal + tot, cmp1); idx[v++] = -1;
    sort(idx, idx + v); v = unique(idx, idx + v) - idx;
    build(0, 0, v - 1);
    for(ll i = 0; i < tot; i++) {
        ql = lower_bound(idx, idx + v, tal[i].x) - idx;
        qr = lower_bound(idx, idx + v, tal[i].y) - idx;
        if(tal[i].o == 1) update(0, 0, v - 1);
        else {
            ll x = ql - 1, y = qr, ix = tal[i].fac_id;
            ql = 1; qr = y; ll totr = ask(0, 0, v - 1);
            ql = 1; qr = x; ll totl = ask(0, 0, v - 1);
            ll tt = totr - totl;
            if(tt >= tal[i].val) { ans[ix] = min(ans[ix], v2); can[t1++] = ix; }
            else { qry[ix].val -= tt; notcan[t2++] = ix; }
        }
    }
    if(l == r) return ;
    for(ll i = 0; i < t1; i++) all[now++] = can[i];
    for(ll i = 0; i < t2; i++) all[now++] = notcan[i];
    solve(mid + 1, r, from + t1, to);
    solve(l, mid, from, from + t1);
}

int main() {
    while(scanf("%lld %lld", &n, &m) != EOF) {
        cntq = cnt = qnum = cnum = 0; ans[0] = INF;
        idx_first.clear(); idx_second.clear();
        for(ll i = 1; i <= m; i++) {
            res[i].input(i); ans[i] = INF;
            if(res[i].o == 1) {
                res[i].val *= -1; b[cnt++] = res[i].val;
                change[cnum++] = res[i];
                change[cnum - 1].fac_id = cnum - 1;
            } else {
                all[cntq] = cntq; cntq++;
                qry[qnum++] = res[i];
                qry[qnum - 1].fac_id = qnum - 1;
            }
        }
        sort(b, b + cnt); cnt = unique(b, b + cnt) - b;
        sort(change, change + cnum);
        for(ll i = 0; i < cnum; i++) {
            if(!idx_first.count(change[i].val)) idx_first[change[i].val] = i;
            idx_second[change[i].val] = i;
        }
        solve(0, cnt - 1, 0, cntq);
        for(ll i = 0; i < cntq; i++) printf("%lld\n", -ans[i]);
    }
    return 0;
}