oj.uz

Submission #979055

# Submission time Handle Problem Language Result Execution time Memory
979055 2024-05-10T07:14:22 Z Kenjikrab Street Lamps (APIO19_street_lamps) C++14
80 / 100
 5000 ms 47528 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+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,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 4440 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 4440 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 355 ms 24828 KB Output is correct
2 Correct 295 ms 24828 KB Output is correct
3 Correct 274 ms 25080 KB Output is correct
4 Correct 307 ms 33312 KB Output is correct
5 Correct 294 ms 30496 KB Output is correct
6 Correct 311 ms 35600 KB Output is correct
7 Correct 317 ms 34144 KB Output is correct
8 Correct 164 ms 19780 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 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 346 ms 47528 KB Output is correct
6 Correct 338 ms 41448 KB Output is correct
7 Correct 340 ms 32844 KB Output is correct
8 Correct 293 ms 18628 KB Output is correct
9 Correct 224 ms 12964 KB Output is correct
10 Correct 249 ms 15540 KB Output is correct
11 Correct 236 ms 15588 KB Output is correct
12 Correct 461 ms 33612 KB Output is correct
13 Correct 303 ms 19196 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4584 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 411 ms 26016 KB Output is correct
6 Correct 374 ms 30496 KB Output is correct
7 Correct 352 ms 36056 KB Output is correct
8 Correct 305 ms 38804 KB Output is correct
9 Correct 262 ms 28344 KB Output is correct
10 Correct 224 ms 31756 KB Output is correct
11 Correct 245 ms 30032 KB Output is correct
12 Correct 224 ms 31112 KB Output is correct
13 Correct 253 ms 28704 KB Output is correct
14 Correct 237 ms 31224 KB Output is correct
15 Correct 453 ms 33764 KB Output is correct
16 Correct 299 ms 20028 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 4440 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 4440 KB Output is correct
8 Correct 355 ms 24828 KB Output is correct
9 Correct 295 ms 24828 KB Output is correct
10 Correct 274 ms 25080 KB Output is correct
11 Correct 307 ms 33312 KB Output is correct
12 Correct 294 ms 30496 KB Output is correct
13 Correct 311 ms 35600 KB Output is correct
14 Correct 317 ms 34144 KB Output is correct
15 Correct 164 ms 19780 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4440 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 346 ms 47528 KB Output is correct
21 Correct 338 ms 41448 KB Output is correct
22 Correct 340 ms 32844 KB Output is correct
23 Correct 293 ms 18628 KB Output is correct
24 Correct 224 ms 12964 KB Output is correct
25 Correct 249 ms 15540 KB Output is correct
26 Correct 236 ms 15588 KB Output is correct
27 Correct 461 ms 33612 KB Output is correct
28 Correct 303 ms 19196 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 1 ms 4584 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 411 ms 26016 KB Output is correct
34 Correct 374 ms 30496 KB Output is correct
35 Correct 352 ms 36056 KB Output is correct
36 Correct 305 ms 38804 KB Output is correct
37 Correct 262 ms 28344 KB Output is correct
38 Correct 224 ms 31756 KB Output is correct
39 Correct 245 ms 30032 KB Output is correct
40 Correct 224 ms 31112 KB Output is correct
41 Correct 253 ms 28704 KB Output is correct
42 Correct 237 ms 31224 KB Output is correct
43 Correct 453 ms 33764 KB Output is correct
44 Correct 299 ms 20028 KB Output is correct
45 Correct 246 ms 17748 KB Output is correct
46 Correct 185 ms 18744 KB Output is correct
47 Correct 229 ms 22436 KB Output is correct
48 Correct 363 ms 33520 KB Output is correct
49 Execution timed out 5049 ms 20016 KB Time limit exceeded
50 Halted 0 ms 0 KB -