Submission #979040

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
979040	2024-05-10T06:57:44 Z	Kenjikrab	Street Lamps (APIO19_street_lamps)	C++14	80 / 100	5000 ms	45472 KB

street_lamps

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
using namespace std;
typedef array<int,4> arr4;
int const n_max=3e5+10;

set<int> zero;
//char s[n_max];
arr4 arr[3*n_max];
int ans[n_max];
int cnt=0;
int fen[n_max];
void upd(int idx,int val)
{
    for(;idx<n_max;idx+=idx&-idx)fen[idx]+=val;
}
int qr(int idx)
{
    int ret=0;
    for(idx;idx;idx-=idx&-idx)ret+=fen[idx];
    return ret;
}
void sol(int l,int r)
{
    if(l>=r)return;
    int mid=(l+r)>>1;
    sol(l,mid);sol(mid+1,r);
    int p=l;
    for(int i=mid+1;i<=r;i++)
    {
        if(arr[i][2])continue;
        while(p<=mid&&arr[p][1]>=arr[i][1]){upd(arr[p][3],arr[p][2]),p++;}
        ans[arr[i][3]]+=qr(arr[i][3]);
    }
    for(int i=l;i<p;i++)
    {
        upd(arr[i][3],-arr[i][2]);
    }
    inplace_merge(arr+l,arr+mid+1,arr+r+1,[&](const arr4 &a,const arr4 &b)
    {return a[1]>b[1];});
}
signed main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    memset(ans,-1,sizeof(ans));
    string s;
    int n,q;
    //scanf("%d%d%s",&n,&q,s+1);
    cin>>n>>q>>s;s=" "+s;
    zero.insert(0);
    for(int i=1;i<=n;i++)
    { 
        if(!(s[i]-='0'))zero.insert(i);
    }
    zero.insert(n+1);
    //char com[10];
    string com;
    for(int i=1;i<=q;i++)
    {
        //scanf("%s",com);
        cin>>com;
        if(com[0]=='q')
        {
            int a,b;
            //scanf("%d%d",&a,&b);
            cin>>a>>b;
            b--;
            arr[cnt++]={a,b,0,i};
            ans[i]=*zero.lower_bound(a)<=b? 0:i;
        }
        else
        {
            int a;
            //scanf("%d",&a);
            cin>>a;
            if(s[a])
            {
                auto it=zero.upper_bound(a);
                int l=*prev(it),m=a,r=*it;
                arr[cnt++]={l+1,r-1,i,i};
                arr[cnt++]={l+1,m-1,-i,i};
                arr[cnt++]={m+1,r-1,-i,i};
                zero.insert(a);
            }
            else
            {
                auto it=zero.find(a);
                int l=*prev(it),m=a,r=*next(it);
                arr[cnt++]={l+1,r-1,-i,i};
                arr[cnt++]={l+1,m-1,i,i};
                arr[cnt++]={m+1,r-1,i,i};
                zero.erase(it);
            }
            s[a]^=1;
        }
    }
    sort(arr, arr+cnt, [&](const arr4 &a, const arr4 &b)
    {return a[0]^b[0] ? a[0]<b[0] : ((a[1]!=b[1])? a[1]>b[1]:(b[2]==0)); });
    sol(0,cnt-1);
    for(int i=1;i<=q;i++)
    {
        if(ans[i]==-1)continue;
        else cout<<ans[i]<<"\n";//printf("%d\n",ans[i]);
    }
    return 0;
}

Compilation message

street_lamps.cpp: In function 'int qr(int)':
street_lamps.cpp:22:9: warning: statement has no effect [-Wunused-value]
   22 |     for(idx;idx;idx-=idx&-idx)ret+=fen[idx];
      |         ^~~

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	355 ms	23892 KB	Output is correct
2	Correct	299 ms	25476 KB	Output is correct
3	Correct	257 ms	23440 KB	Output is correct
4	Correct	311 ms	31268 KB	Output is correct
5	Correct	299 ms	31492 KB	Output is correct
6	Correct	321 ms	33044 KB	Output is correct
7	Correct	332 ms	30064 KB	Output is correct
8	Correct	164 ms	17216 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	2 ms	4440 KB	Output is correct
3	Correct	2 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	438 ms	45472 KB	Output is correct
6	Correct	348 ms	39312 KB	Output is correct
7	Correct	340 ms	29240 KB	Output is correct
8	Correct	296 ms	17468 KB	Output is correct
9	Correct	225 ms	11052 KB	Output is correct
10	Correct	248 ms	14936 KB	Output is correct
11	Correct	244 ms	14464 KB	Output is correct
12	Correct	455 ms	31920 KB	Output is correct
13	Correct	297 ms	16480 KB	Output is correct

Subtask #4

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4440 KB	Output is correct
2	Correct	2 ms	4444 KB	Output is correct
3	Correct	2 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	398 ms	24396 KB	Output is correct
6	Correct	379 ms	27696 KB	Output is correct
7	Correct	352 ms	33392 KB	Output is correct
8	Correct	307 ms	37456 KB	Output is correct
9	Correct	258 ms	26108 KB	Output is correct
10	Correct	227 ms	28816 KB	Output is correct
11	Correct	250 ms	27540 KB	Output is correct
12	Correct	244 ms	30216 KB	Output is correct
13	Correct	247 ms	26764 KB	Output is correct
14	Correct	233 ms	29084 KB	Output is correct
15	Correct	434 ms	30852 KB	Output is correct
16	Correct	300 ms	17976 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	355 ms	23892 KB	Output is correct
9	Correct	299 ms	25476 KB	Output is correct
10	Correct	257 ms	23440 KB	Output is correct
11	Correct	311 ms	31268 KB	Output is correct
12	Correct	299 ms	31492 KB	Output is correct
13	Correct	321 ms	33044 KB	Output is correct
14	Correct	332 ms	30064 KB	Output is correct
15	Correct	164 ms	17216 KB	Output is correct
16	Correct	1 ms	4440 KB	Output is correct
17	Correct	2 ms	4440 KB	Output is correct
18	Correct	2 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	438 ms	45472 KB	Output is correct
21	Correct	348 ms	39312 KB	Output is correct
22	Correct	340 ms	29240 KB	Output is correct
23	Correct	296 ms	17468 KB	Output is correct
24	Correct	225 ms	11052 KB	Output is correct
25	Correct	248 ms	14936 KB	Output is correct
26	Correct	244 ms	14464 KB	Output is correct
27	Correct	455 ms	31920 KB	Output is correct
28	Correct	297 ms	16480 KB	Output is correct
29	Correct	2 ms	4440 KB	Output is correct
30	Correct	2 ms	4444 KB	Output is correct
31	Correct	2 ms	4444 KB	Output is correct
32	Correct	1 ms	4440 KB	Output is correct
33	Correct	398 ms	24396 KB	Output is correct
34	Correct	379 ms	27696 KB	Output is correct
35	Correct	352 ms	33392 KB	Output is correct
36	Correct	307 ms	37456 KB	Output is correct
37	Correct	258 ms	26108 KB	Output is correct
38	Correct	227 ms	28816 KB	Output is correct
39	Correct	250 ms	27540 KB	Output is correct
40	Correct	244 ms	30216 KB	Output is correct
41	Correct	247 ms	26764 KB	Output is correct
42	Correct	233 ms	29084 KB	Output is correct
43	Correct	434 ms	30852 KB	Output is correct
44	Correct	300 ms	17976 KB	Output is correct
45	Correct	261 ms	17844 KB	Output is correct
46	Correct	185 ms	19040 KB	Output is correct
47	Correct	213 ms	21568 KB	Output is correct
48	Correct	359 ms	30820 KB	Output is correct
49	Execution timed out	5044 ms	18516 KB	Time limit exceeded
50	Halted	0 ms	0 KB	-