组队训练 K K - The Stream of Corning 2

K - The Stream of Corning 2

这个题目不是很难，因为给你的这个S是单调递增的，所以就用优先队列+权值线段树就可以很快的解决了。

这个+读入挂可以优化，不过不用也没关系。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <bitset>
#include <string>
#include <algorithm>
#include <iostream>
#include <map>
#define inf 0x3f3f3f3f
#define inf64 0x3f3f3f3f3f3f3f3f
using namespace std;
const int maxn = 1e6 + ;
const int mod = 1e9 + ;
const int M = 1e6;
typedef long long ll;
int num[maxn * ];

void build(int id, int l, int r) {
    num[id] = ;
    if (l == r) return;
    int mid = (l + r) >> ;
    build(id << , l, mid);
    build(id <<  | , mid + , r);
}
struct node {
    int l, r, val;
    node(int l=,int r=,int val=):l(l),r(r),val(val){}
    bool operator<(const node &a)const {
        return a.r < r;
    }
};
priority_queue<node>que;

void update(int id, int l, int r, int pos, int f) {
    if (f) num[id]++;
    else num[id]--;
    if (l == r) return;
    int mid = (l + r) >> ;
    if (pos <= mid) update(id << , l, mid, pos, f);
    else update(id <<  | , mid + , r, pos, f);
}

int query(int id, int l, int r, int k) {
    if (l == r) return l;
    int mid = (l + r) >> ;
    int val1 = num[id << ];
    if (val1 >= k) return query(id << , l, mid, k);
    return query(id <<  | , mid + , r, k - val1);
}

inline int read() {
    int X = ; bool flag = ; char ch = getchar();
    while (ch<'' || ch>'') { if (ch == '-') flag = ; ch = getchar(); }
    while (ch >= ''&&ch <= '') { X = (X << ) + (X << ) + ch - ''; ch = getchar(); }
    if (flag) return X;
    return ~(X - );
}
inline void write(int X) {
    if (X < ) { putchar('-'); X = ~(X - ); }
    int s[], top = ;
    while (X) { s[++top] = X % ; X /= ; }
    if (!top) s[++top] = ;
    while (top) putchar(s[top--] + '');
    putchar('\n');
}

int main() {
    int t = read();
    for (int cas = ; cas <= t; cas++) {
        printf("Case %d:\n", cas);
        while (!que.empty()) que.pop();
        int n = read();
        memset(num, , sizeof(num));
        while (n--) {
            int opt;
            scanf("%d", &opt);
            if (opt == ) {
                int l, val, r;
                l = read(), val = read(), r = read();
                update(, , M, val, );
                que.push(node(l, r, val));
            }
            else {
                int s, k;
                s = read(), k = read();
                while (!que.empty()&&que.top().r < s) {
                    update(, , M, que.top().val, );
                    que.pop();
                }
                if (k > que.size()) write(-);
                else write(query(, , M, k));
            }
        }
    }
    return ;
}