oj.uz

Submission #979061

# Submission time Handle Problem Language Result Execution time Memory
979061 2024-05-10T07:22:32 Z Kenjikrab Street Lamps (APIO19_street_lamps) C++14
80 / 100
 5000 ms 45756 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));
    int n,q;
    scanf("%d%d%s",&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];
    for(int i=1;i<=q;i++)
    {
        scanf("%s",com);
        if(com[0]=='q')
        {
            int a,b;
            scanf("%d%d",&a,&b);
            b--;
            arr[cnt++]={a,b,0,i};
            ans[i]=*zero.lower_bound(a)<=b? 0:i;
        }
        else
        {
            int a;
            scanf("%d",&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 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];
      |         ^~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d%d%s",&n,&q,s);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
street_lamps.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%s",com);
      |         ~~~~~^~~~~~~~~~
street_lamps.cpp:62:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |             scanf("%d%d",&a,&b);
      |             ~~~~~^~~~~~~~~~~~~~
street_lamps.cpp:70:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |             scanf("%d",&a);
      |             ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 25856 KB Output is correct
2 Correct 309 ms 26172 KB Output is correct
3 Correct 268 ms 25808 KB Output is correct
4 Correct 325 ms 32740 KB Output is correct
5 Correct 343 ms 32012 KB Output is correct
6 Correct 326 ms 34716 KB Output is correct
7 Correct 395 ms 32108 KB Output is correct
8 Correct 175 ms 19856 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 2 ms 6744 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 360 ms 45756 KB Output is correct
6 Correct 381 ms 40228 KB Output is correct
7 Correct 374 ms 33608 KB Output is correct
8 Correct 310 ms 18752 KB Output is correct
9 Correct 228 ms 13932 KB Output is correct
10 Correct 273 ms 17772 KB Output is correct
11 Correct 247 ms 16740 KB Output is correct
12 Correct 497 ms 32404 KB Output is correct
13 Correct 318 ms 18056 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 2 ms 6608 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 409 ms 25928 KB Output is correct
6 Correct 377 ms 29220 KB Output is correct
7 Correct 339 ms 35068 KB Output is correct
8 Correct 302 ms 37812 KB Output is correct
9 Correct 263 ms 31400 KB Output is correct
10 Correct 241 ms 27928 KB Output is correct
11 Correct 272 ms 27492 KB Output is correct
12 Correct 236 ms 28012 KB Output is correct
13 Correct 260 ms 26828 KB Output is correct
14 Correct 238 ms 29348 KB Output is correct
15 Correct 472 ms 30336 KB Output is correct
16 Correct 302 ms 14892 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 391 ms 25856 KB Output is correct
9 Correct 309 ms 26172 KB Output is correct
10 Correct 268 ms 25808 KB Output is correct
11 Correct 325 ms 32740 KB Output is correct
12 Correct 343 ms 32012 KB Output is correct
13 Correct 326 ms 34716 KB Output is correct
14 Correct 395 ms 32108 KB Output is correct
15 Correct 175 ms 19856 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6488 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 360 ms 45756 KB Output is correct
21 Correct 381 ms 40228 KB Output is correct
22 Correct 374 ms 33608 KB Output is correct
23 Correct 310 ms 18752 KB Output is correct
24 Correct 228 ms 13932 KB Output is correct
25 Correct 273 ms 17772 KB Output is correct
26 Correct 247 ms 16740 KB Output is correct
27 Correct 497 ms 32404 KB Output is correct
28 Correct 318 ms 18056 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 2 ms 6608 KB Output is correct
32 Correct 2 ms 6744 KB Output is correct
33 Correct 409 ms 25928 KB Output is correct
34 Correct 377 ms 29220 KB Output is correct
35 Correct 339 ms 35068 KB Output is correct
36 Correct 302 ms 37812 KB Output is correct
37 Correct 263 ms 31400 KB Output is correct
38 Correct 241 ms 27928 KB Output is correct
39 Correct 272 ms 27492 KB Output is correct
40 Correct 236 ms 28012 KB Output is correct
41 Correct 260 ms 26828 KB Output is correct
42 Correct 238 ms 29348 KB Output is correct
43 Correct 472 ms 30336 KB Output is correct
44 Correct 302 ms 14892 KB Output is correct
45 Correct 280 ms 17972 KB Output is correct
46 Correct 186 ms 18848 KB Output is correct
47 Correct 218 ms 20380 KB Output is correct
48 Correct 366 ms 31016 KB Output is correct
49 Execution timed out 5056 ms 16724 KB Time limit exceeded
50 Halted 0 ms 0 KB -