QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#668671#7904. Rainbow SubarrayCorycle#TL 1080ms13984kbC++142.7kb2024-10-23 15:25:362024-10-23 15:25:48

Judging History

你现在查看的是最新测评结果

  • [2024-10-23 15:25:48]
  • 评测
  • 测评结果:TL
  • 用时:1080ms
  • 内存:13984kb
  • [2024-10-23 15:25:36]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define lson p<<1,l,mid
#define rson p<<1|1,mid+1,r
using namespace std;
const int N=5e5+5;
ll read(){
    ll s=0,f=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){s=s*10+c-'0';c=getchar();}
    return s*f;
}
ll K;
int n,m,a[N],b[N];
struct Tree{
    int tag;
    ll sum1,sum2;
};
struct Segment_Tree{
    Tree t[N<<2];
    void clear(int p){t[p]=(Tree){1,0,0};}
    void Pushdown(int p){if(t[p].tag){clear(p<<1);clear(p<<1|1);t[p].tag=0;}}
    void Pushup(int p){
        t[p].sum1=t[p<<1].sum1+t[p<<1|1].sum1;
        t[p].sum2=t[p<<1].sum2+t[p<<1|1].sum2;
    }
    void Update(int x,int y,int f,int p,int l,int r){
        if(x<l||x>r)return;
        if(l==r){t[p].sum1+=f;t[p].sum2+=f*y;return;}
        int mid=(l+r)>>1;Pushdown(p);
        Update(x,y,f,lson);
        Update(x,y,f,rson);
        Pushup(p);
    }
    ll Query1(int x,int y,int p,int l,int r){
        if(y<l||x>r)return 0;
        if(x<=l&&r<=y)return t[p].sum1;
        int mid=(l+r)>>1;Pushdown(p);
        return Query1(x,y,lson)+Query1(x,y,rson);
    }
    ll Query2(int x,int y,int p,int l,int r){
        if(y<l||x>r)return 0;
        if(x<=l&&r<=y)return t[p].sum2;
        int mid=(l+r)>>1;Pushdown(p);
        return Query2(x,y,lson)+Query2(x,y,rson);
    }
    int Find(int k,int p,int l,int r){
        if(l==r)return l;
        int mid=(l+r)>>1;Pushdown(p);
        if(k<=t[p<<1].sum1)return Find(k,lson);
        return Find(k-t[p<<1].sum1,rson);
    }
}tree;
bool Check(int len){
    // cout<<"Check: "<<len<<endl;
    tree.clear(1);
    for(int i=1;i<=len;i++){
        tree.Update(a[i],b[a[i]],1,1,1,n);
    }
    for(int l=1;l+len-1<=n;l++){
        int r=l+len-1;
        if(l!=1){
            tree.Update(a[l-1],b[a[l-1]],-1,1,1,n);
            tree.Update(a[r],b[a[r]],1,1,1,n);
        }
        int x=tree.Find((len+1)/2,1,1,n);
        ll sum=(b[x]*tree.Query1(1,x,1,1,n)-tree.Query2(1,x,1,1,n))+(tree.Query2(x+1,n,1,1,n)-b[x]*tree.Query1(x+1,n,1,1,n));
        // cout<<"calc: "<<l<<" "<<r<<" "<<sum<<endl;
        if(sum<=K)return true;
    }
    return false;
}
int main(){
    int T=read();
    while(T--){
        n=read();K=read();
        for(int i=1;i<=n;i++)a[i]=b[i]=read()-i;
        sort(b+1,b+n+1);
        b[0]=unique(b+1,b+n+1)-b-1;
        for(int i=1;i<=n;i++)a[i]=lower_bound(b+1,b+b[0]+1,a[i])-b;
        int l=1,r=n,ans=1;
        while(l<=r){
            int mid=(l+r)>>1;
            if(Check(mid)){
                ans=mid;
                l=mid+1;
            }
            else r=mid-1;
        }
        // puts("Ans: ");
        printf("%d\n",ans);
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 7920kb

input:

5
7 5
7 2 5 5 4 11 7
6 0
100 3 4 5 99 100
5 6
1 1 1 1 1
5 50
100 200 300 400 500
1 100
3

output:

4
3
5
1
1

result:

ok 5 lines

Test #2:

score: 0
Accepted
time: 1080ms
memory: 13984kb

input:

11102
2 167959139
336470888 134074578
5 642802746
273386884 79721198 396628655 3722503 471207868
6 202647942
268792718 46761498 443917727 16843338 125908043 191952768
2 717268783
150414369 193319712
6 519096230
356168102 262263554 174936674 407246545 274667941 279198849
9 527268921
421436316 3613460...

output:

1
4
3
2
6
5
7
2
4
1
4
1
1
3
2
2
7
8
7
7
1
7
6
2
4
3
1
6
7
7
3
4
3
9
3
8
6
6
3
1
6
3
1
2
4
6
4
6
4
1
4
7
1
6
3
5
6
6
1
7
5
3
1
6
4
5
3
2
2
6
2
3
10
1
4
3
2
4
5
1
7
5
5
5
8
5
3
6
3
5
5
8
5
4
5
2
1
5
2
3
3
4
8
1
3
1
2
2
8
3
1
6
8
1
8
4
5
6
6
8
4
8
3
2
8
4
5
6
2
6
2
4
1
5
4
5
3
2
4
1
2
1
4
5
8
3
7
3
3
3...

result:

ok 11102 lines

Test #3:

score: -100
Time Limit Exceeded

input:

1
500000 17244641009859
54748096 75475634 204928248 276927808 84875072 103158867 27937890 322595515 186026685 45468307 69240390 139887597 188586447 373764525 121365644 310156469 185188306 60350786 211308832 384695957 370562147 208427221 35937909 267590963 126478310 275357775 55361535 335993561 36696...

output:


result: