oj.uz

Submission #979057

# Submission time Handle Problem Language Result Execution time Memory
979057 2024-05-10T07:18:33 Z Kenjikrab Street Lamps (APIO19_street_lamps) C++14
80 / 100
 5000 ms 43272 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[3*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&-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];});
}
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;
    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;
    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-1])
            {
                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]^=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 4440 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 353 ms 21520 KB Output is correct
2 Correct 289 ms 21424 KB Output is correct
3 Correct 255 ms 21212 KB Output is correct
4 Correct 312 ms 29128 KB Output is correct
5 Correct 295 ms 27000 KB Output is correct
6 Correct 327 ms 30304 KB Output is correct
7 Correct 301 ms 26952 KB Output is correct
8 Correct 164 ms 13128 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 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 359 ms 43272 KB Output is correct
6 Correct 344 ms 35216 KB Output is correct
7 Correct 341 ms 27568 KB Output is correct
8 Correct 328 ms 13372 KB Output is correct
9 Correct 217 ms 10280 KB Output is correct
10 Correct 251 ms 14004 KB Output is correct
11 Correct 229 ms 13644 KB Output is correct
12 Correct 448 ms 27900 KB Output is correct
13 Correct 291 ms 13128 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 393 ms 19772 KB Output is correct
6 Correct 371 ms 24136 KB Output is correct
7 Correct 343 ms 31792 KB Output is correct
8 Correct 299 ms 36184 KB Output is correct
9 Correct 252 ms 23864 KB Output is correct
10 Correct 224 ms 27424 KB Output is correct
11 Correct 250 ms 23600 KB Output is correct
12 Correct 224 ms 27596 KB Output is correct
13 Correct 244 ms 24968 KB Output is correct
14 Correct 227 ms 28284 KB Output is correct
15 Correct 423 ms 27460 KB Output is correct
16 Correct 298 ms 13888 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 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 353 ms 21520 KB Output is correct
9 Correct 289 ms 21424 KB Output is correct
10 Correct 255 ms 21212 KB Output is correct
11 Correct 312 ms 29128 KB Output is correct
12 Correct 295 ms 27000 KB Output is correct
13 Correct 327 ms 30304 KB Output is correct
14 Correct 301 ms 26952 KB Output is correct
15 Correct 164 ms 13128 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 359 ms 43272 KB Output is correct
21 Correct 344 ms 35216 KB Output is correct
22 Correct 341 ms 27568 KB Output is correct
23 Correct 328 ms 13372 KB Output is correct
24 Correct 217 ms 10280 KB Output is correct
25 Correct 251 ms 14004 KB Output is correct
26 Correct 229 ms 13644 KB Output is correct
27 Correct 448 ms 27900 KB Output is correct
28 Correct 291 ms 13128 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 393 ms 19772 KB Output is correct
34 Correct 371 ms 24136 KB Output is correct
35 Correct 343 ms 31792 KB Output is correct
36 Correct 299 ms 36184 KB Output is correct
37 Correct 252 ms 23864 KB Output is correct
38 Correct 224 ms 27424 KB Output is correct
39 Correct 250 ms 23600 KB Output is correct
40 Correct 224 ms 27596 KB Output is correct
41 Correct 244 ms 24968 KB Output is correct
42 Correct 227 ms 28284 KB Output is correct
43 Correct 423 ms 27460 KB Output is correct
44 Correct 298 ms 13888 KB Output is correct
45 Correct 245 ms 16824 KB Output is correct
46 Correct 174 ms 16948 KB Output is correct
47 Correct 213 ms 18696 KB Output is correct
48 Correct 356 ms 29072 KB Output is correct
49 Execution timed out 5041 ms 16600 KB Time limit exceeded
50 Halted 0 ms 0 KB -