oj.uz

Submission #1005514

# Submission time Handle Problem Language Result Execution time Memory
1005514 2024-06-22T14:26:40 Z vjudge1 Street Lamps (APIO19_street_lamps) C++17
0 / 100
 1839 ms 133952 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int mxn=3e5+5;
int a[mxn],b[mxn],ans[mxn],n;
bool vis[mxn]{0};
vector<pii>qr[mxn];
multiset<int>ms,ms2;
vector<int>bit[mxn];
vector<int>bval[mxn];
vector<int>val[mxn];
void build(){
    for(int i=1;i<=n;i++){
        if(val[i].empty())continue;
        sort(val[i].begin(),val[i].end());
        for(auto it : val[i]){
            for(int j=i;j<=n;j+=j&-j){
                if(bval[j].empty()||bval[j].back()!=it)bval[j].pb(it);
            }
        }
    }
    for(int i=1;i<=n;i++)bit[i].resize((int)bval[i].size()+1,0);
}
int ub(int x,int y){
    return upper_bound(bval[x].begin(),bval[x].end(),y)-bval[x].begin();
}
void upd(int i,int j,int amt){
    for(int x=i;x<=n;x+=x&-x)for(int y=ub(x,j);y<bit[x].size();y+=y&-y)bit[x][y]+=amt;
}
int query(int a,int b,int res=0){
    for(int x=a;x>0;x-=x&-x)for(int y=ub(x,b);y>0;y-=y&-y)res+=bit[x][y];
    return res;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int q;cin>>n>>q;ms.insert(0);ms.insert(n+1);ms2.insert(0);ms2.insert(n+1);
    for(int i=1;i<=n;i++){
        char x;cin>>x;a[i]=x-'0';b[i]=a[i];
        if(!a[i])ms.insert(i),ms2.insert(i);
    }vector<pair<int,pii>>qq;
    for(int i=1;i<=q;i++){
        string s;cin>>s;ans[i]=-1;
        if(s=="toggle"){
            int x;cin>>x;qq.pb({1,{x,0}});
            if(a[x]){
                int l = 1+*prev(ms.lower_bound(x));
                int r = -1+*ms.upper_bound(x);
                val[l].pb(x);val[l].pb(r+1);val[x+1].pb(x);val[x+1].pb(r+1);
                a[x]=0;ms.insert(x);
            }
            else {
                int l = 1+*prev(ms.lower_bound(x));
                int r = -1+*ms.upper_bound(x);
                val[l].pb(x);val[l].pb(r+1);val[x+1].pb(x);val[x+1].pb(r+1);
                a[x]=1;ms.erase(x);
             }
        }
        else {
            int l,r;cin>>l>>r;qq.pb({2,{l,r}});
        }
    }build();
    for(int i=0;i<qq.size();i++){
        auto it=qq[i];
        if(it.f==1){int x=it.s.f;
            if(b[x]){
                int l = 1+*prev(ms2.lower_bound(x));
                int r = -1+*ms2.upper_bound(x);
                upd(l,x,i+1);upd(l,r+1,-i-1);upd(x+1,x,-i-1);upd(x+1,r+1,i+1);
                b[x]=0;ms2.insert(x);
            }
            else {
                int l = 1+*prev(ms2.lower_bound(x));
                int r = -1+*ms2.upper_bound(x);
                upd(l,x,-i-1);upd(l,r+1,i+1);upd(x+1,x,i+1);upd(x+1,r+1,-i-1);
                b[x]=1;ms2.erase(x);
            }
        }
        else {
            ans[i+1] = query(it.s.f,it.s.s-1);
            int ij = *ms2.lower_bound(it.s.f);
            if(ij>it.s.s-1)ans[i+1]+=i+1;
        }
    }
    for(int i=1;i<=q;i++)if(ans[i]!=-1)cout<<ans[i]<<'\n';
}

Compilation message

street_lamps.cpp: In function 'void upd(int, int, int)':
street_lamps.cpp:39:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int x=i;x<=n;x+=x&-x)for(int y=ub(x,j);y<bit[x].size();y+=y&-y)bit[x][y]+=amt;
      |                                                ~^~~~~~~~~~~~~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0;i<qq.size();i++){
      |                 ~^~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31320 KB Output is correct
2 Correct 6 ms 31324 KB Output is correct
3 Incorrect 5 ms 31324 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 167 ms 45580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31580 KB Output is correct
2 Incorrect 6 ms 31616 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 31360 KB Output is correct
2 Correct 6 ms 31580 KB Output is correct
3 Correct 6 ms 31580 KB Output is correct
4 Correct 7 ms 31472 KB Output is correct
5 Correct 265 ms 68404 KB Output is correct
6 Correct 772 ms 95732 KB Output is correct
7 Correct 1260 ms 113144 KB Output is correct
8 Correct 1839 ms 133952 KB Output is correct
9 Incorrect 281 ms 46844 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31320 KB Output is correct
2 Correct 6 ms 31324 KB Output is correct
3 Incorrect 5 ms 31324 KB Output isn't correct
4 Halted 0 ms 0 KB -