JZOJ5296.【清华集训2017模拟】Sequence

题意

数据范围

Analysis

首先考虑第二个条件如何解决，不可能直接把元素提取出来，考虑类似求区间第$K$小的方法，在主席树上根据给出的$x,y$来求，发现是一段连续的权值区间。那么再考虑第三个条件如何解决，不可能再在里面套数据结构，考虑整体二分解决。每次二分出一个值，然后，对于小于等于$mid$的第二个元素，其权值设为$1$，然后通过排序和树状数组求出，每个询问$l,r$内满足第一个元素在$x,y$对应的权值区间内的权值，就可以$check$了，这题就解决了。复杂度$O(m(logn)^2)$

Code

# include<cstdio>
# include<algorithm>
# include<cstring>
using namespace std;
const int N = 3e4 + 5;
const int M = 1e5 + 5;
struct node
{
    int l,r,x,y,id,k,cur,ty,now;
}q[N + M],a[N + M],b[N + M];
int sum[N * 20],ls[N * 20],rs[N * 20],rt[N],ans[M],t[N];
int n,m,tot;
inline bool cmp(node a,node b) { return (a.l == b.l) ? a.ty < b.ty : a.l < b.l; }
inline bool cmp1(node a,node b) { return (a.r == b.r) ? a.ty < b.ty : a.r < b.r; }
inline void ins(int &x,int y,int l,int r,int p)
{
    if (!x) x = ++tot; sum[x] = sum[y] + 1;
    if (l == r) return;
    int mid = (l + r) >> 1;
    if (p <= mid) rs[x] = rs[y],ins(ls[x],ls[y],l,mid,p);
    else ls[x] = ls[y],ins(rs[x],rs[y],mid + 1,r,p);
}
inline int qry(int x,int y,int l,int r,int k)
{
    if (l == r) return l;
    int mid = (l + r) >> 1,ret = sum[ls[x]] - sum[ls[y]];
    if (ret >= k) return qry(ls[x],ls[y],l,mid,k);
    else return qry(rs[x],rs[y],mid + 1,r,k - ret);
}
inline void add(int x,int v)
{
    for (int i = x ; i <= n ; i += i & (-i))
        t[i] += v;
}
inline int qry1(int x)
{
    int ret = 0;
    for (int i = x ; i ; i -= i & (-i))
        ret += t[i];
    return ret;
}
inline void solve(int ql,int qr,int l,int r)
{
    if (ql > qr) return;
    if (l == r)
    {
        for (int i = ql ; i <= qr ; ++i)
        if (q[i].ty == 2) ans[q[i].id] = l;
        return;
    }
    int mid = (l + r) >> 1,h = 0,h1 = 0;
    sort(q + ql,q + qr + 1,cmp);
    for (int i = ql ; i <= qr ; ++i)
    if (q[i].ty == 1)
    {
        if (q[i].y <= mid) add(q[i].x,-1);
    }else q[i].now = qry1(q[i].y) - qry1(q[i].x - 1);
    for (int i = ql ; i <= qr ; ++i)
    if (q[i].ty == 1 && q[i].y <= mid) add(q[i].x,1);
    sort(q + ql,q + qr + 1,cmp1);
    for (int i = ql ; i <= qr ; ++i)
    if (q[i].ty == 1)
    {
        if (q[i].y <= mid) add(q[i].x,1),a[++h] = q[i];
        else b[++h1] = q[i];
    }else q[i].now += qry1(q[i].y) - qry1(q[i].x - 1);
    for (int i = 1 ; i <= h ; ++i) add(a[i].x,-1);
    for (int i = ql ; i <= qr ; ++i)
    if (q[i].ty == 2)
    {
        if (q[i].now + q[i].cur >= q[i].k) a[++h] = q[i];
        else q[i].cur += q[i].now,b[++h1] = q[i];
        q[i].now = 0;
    }
    for (int i = 1 ; i <= h ; ++i) q[ql + i - 1] = a[i];
    for (int i = 1 ; i <= h1 ; ++i) q[ql + h + i - 1] = b[i];
    solve(ql,ql + h - 1,l,mid);
    solve(ql + h,qr,mid + 1,r);
}
int main()
{
    freopen("sequence.in","r",stdin);
    freopen("sequence.out","w",stdout);
    scanf("%d",&n);
    for (int i = 1 ; i <= n ; ++i)
    {
        int x; scanf("%d",&x); ins(rt[i],rt[i - 1],1,n,x);
        q[i] = (node){i,i,x,0,0,0,0,1,0};
    }
    for (int i = 1 ; i <= n ; ++i)
    {
        int x; scanf("%d",&x);
        q[i].y = x;
    }
    scanf("%d",&m);
    for (int i = 1 ; i <= m ; ++i)
    {
        int l,r,x,y,k; scanf("%d%d%d%d%d",&l,&r,&x,&y,&k);
        x = qry(rt[r],rt[l - 1],1,n,x); y = qry(rt[r],rt[l - 1],1,n,y);
        q[i + n] = (node){l - 1,r,x,y,i,k,0,2,0};
    }
    solve(1,n + m,1,n);
    for (int i = 1 ; i <= m ; ++i) printf("%d\n",ans[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}