oj.uz

Submission #979069

# Submission time Handle Problem Language Result Execution time Memory
979069 2024-05-10T07:27:21 Z Kenjikrab Street Lamps (APIO19_street_lamps) C++14
80 / 100
 5000 ms 47832 KB 
#pragma GCC optimize("Ofast")
#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+15;

set<int> zero;
//char s[n_max];
arr4 arr[4*n_max];
int ans[n_max];
int cnt=0;
int fen[n_max];
inline void upd(int idx,int val)
{
    for(;idx<n_max;idx+=idx&-idx)fen[idx]+=val;
}
inline int qr(int idx)
{
    int ret=0;
    for(;idx;idx-=idx&-idx)ret+=fen[idx];
    return ret;
}
void sol(int l,int r)
{
    if(l>=r)return;
    int mid=(l+r)>>1,p=l;
    sol(l,mid);sol(mid+1,r);
    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];});
}
    string s;
    int n,q;
signed main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    memset(ans,-1,sizeof(ans));
    //scanf("%d%d%s",&n,&q,s+1);
    cin>>n>>q>>s;
    zero.insert(0);
    for(int i=0;i<n;i++)
    { 
        if(!(s[i]-='0'))zero.insert(i+1);
    }
    zero.insert(n+1);
    //char com[10];
    string com;
    int a,b;
    for(int i=1;i<=q;i++)
    {
        //scanf("%s",com);
        cin>>com;
        if(com[0]=='q')
        {
            //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
        {
            //scanf("%d",&a);
            cin>>a;
            if(s[a-1])
            {
                auto it=zero.insert(a).first;
                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};
            }
            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]^=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;
}

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 4560 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 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 376 ms 23452 KB Output is correct
2 Correct 296 ms 24516 KB Output is correct
3 Correct 282 ms 25148 KB Output is correct
4 Correct 304 ms 32464 KB Output is correct
5 Correct 287 ms 31336 KB Output is correct
6 Correct 345 ms 35612 KB Output is correct
7 Correct 311 ms 32588 KB Output is correct
8 Correct 169 ms 20232 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 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 357 ms 47832 KB Output is correct
6 Correct 359 ms 40424 KB Output is correct
7 Correct 347 ms 31344 KB Output is correct
8 Correct 303 ms 20256 KB Output is correct
9 Correct 217 ms 13720 KB Output is correct
10 Correct 245 ms 15768 KB Output is correct
11 Correct 248 ms 16364 KB Output is correct
12 Correct 452 ms 33108 KB Output is correct
13 Correct 294 ms 19268 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 1 ms 4440 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 379 ms 27520 KB Output is correct
6 Correct 357 ms 29460 KB Output is correct
7 Correct 328 ms 36748 KB Output is correct
8 Correct 301 ms 39952 KB Output is correct
9 Correct 250 ms 27180 KB Output is correct
10 Correct 233 ms 30904 KB Output is correct
11 Correct 248 ms 28228 KB Output is correct
12 Correct 242 ms 31112 KB Output is correct
13 Correct 243 ms 28412 KB Output is correct
14 Correct 223 ms 31668 KB Output is correct
15 Correct 460 ms 32984 KB Output is correct
16 Correct 299 ms 20032 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 4560 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 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 376 ms 23452 KB Output is correct
9 Correct 296 ms 24516 KB Output is correct
10 Correct 282 ms 25148 KB Output is correct
11 Correct 304 ms 32464 KB Output is correct
12 Correct 287 ms 31336 KB Output is correct
13 Correct 345 ms 35612 KB Output is correct
14 Correct 311 ms 32588 KB Output is correct
15 Correct 169 ms 20232 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 357 ms 47832 KB Output is correct
21 Correct 359 ms 40424 KB Output is correct
22 Correct 347 ms 31344 KB Output is correct
23 Correct 303 ms 20256 KB Output is correct
24 Correct 217 ms 13720 KB Output is correct
25 Correct 245 ms 15768 KB Output is correct
26 Correct 248 ms 16364 KB Output is correct
27 Correct 452 ms 33108 KB Output is correct
28 Correct 294 ms 19268 KB Output is correct
29 Correct 2 ms 4440 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 379 ms 27520 KB Output is correct
34 Correct 357 ms 29460 KB Output is correct
35 Correct 328 ms 36748 KB Output is correct
36 Correct 301 ms 39952 KB Output is correct
37 Correct 250 ms 27180 KB Output is correct
38 Correct 233 ms 30904 KB Output is correct
39 Correct 248 ms 28228 KB Output is correct
40 Correct 242 ms 31112 KB Output is correct
41 Correct 243 ms 28412 KB Output is correct
42 Correct 223 ms 31668 KB Output is correct
43 Correct 460 ms 32984 KB Output is correct
44 Correct 299 ms 20032 KB Output is correct
45 Correct 244 ms 17528 KB Output is correct
46 Correct 176 ms 19508 KB Output is correct
47 Correct 207 ms 21948 KB Output is correct
48 Correct 345 ms 33164 KB Output is correct
49 Execution timed out 5058 ms 24656 KB Time limit exceeded
50 Halted 0 ms 0 KB -