#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
vvp casc,id;
vvi seg;
vi NN;
ll N;
void init(){
NN=vi(N*2-1,1);
rep(t,N*2-1){
while(NN[t]<casc[t].size())NN[t]<<=1;
seg.pb(vi(NN[t]*2-1));
}
}
void add(ll t,ll i,ll x){
i=NN[t]+i-1;
seg[t][i]+=x;
while(i>0){
i=(i-1)/2;
seg[t][i]=seg[t][i*2+1]+seg[t][i*2+2];
}
}
ll getsum(ll t,ll a,ll b,ll k,ll l,ll r){
if(r<=a||b<=l)return 0;
if(a<=l&&r<=b)return seg[t][k];
ll c1=getsum(t,a,b,k*2+1,l,(l+r)/2);
ll c2=getsum(t,a,b,k*2+2,(l+r)/2,r);
return c1+c2;
}
void init_fractional_cascading(vector<PP> v){ //(x座標,y座標,id)
N=1;
while(N<v.size())N<<=1;
while(v.size()<N)v.pb(0,0,v.size());sort(all(v));
casc=vvp(2*N-1);
id=vvp(N);
rep(i,N)casc[i+N-1].pb(get<1>(v[i]),get<2>(v[i]));
for(int i=N-2;i>=0;i--){
ll a=0,b=0;
while(true){
bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
if(A&&B)break;
if(A)casc[i].pb(casc[i*2+2][b++]);
else if(B)casc[i].pb(casc[i*2+1][a++]);
else if(casc[i*2+1][a]>casc[i*2+2][b])casc[i].pb(casc[i*2+2][b++]);
else casc[i].pb(casc[i*2+1][a++]);
}
}
rep(i,2*N-1)rep(j,casc[i].size())id[casc[i][j].se].pb(i,j);
init();
}
ll answer_query(int i){
ll res=0;
for(auto x:id[i])res+=getsum(x.fi,0,x.se+1,0,0,NN[x.fi]);
return res;
}
void add_all(int x1,int x2,int y1,int y2,int k,int l,int r,ll x){//[x1,x2],[y1,y2],[l,r)
// cout<<k<<' '<<l<<' '<<r<<'!'<<endl;
if(x2<casc[k][l].fi||casc[k][r-1].fi<x1)return;
if(x1<=casc[k][l].fi&&casc[k][r-1].fi<=x2){
ll a=lb(casc[k],P(y1,-inf)),b=lb(casc[k],P(y2,inf)); //[a,b)+=x
add(k,a,x);
if(b!=casc[k].size())add(k,b,-x);
return;
}
add_all(x1,x2,y1,y2,k*2+1,l,(l+r)/2,x);
add_all(x1,x2,y1,y2,k*2+2,(l+r)/2,r,x);
}
int main(){
ll n,q;cin>>n>>q;
string s;cin>>s;
vi v(n);
rep(i,n)v[i]='1'-s[i];
vi ans(q);
vp query(q);
vector<PP> d;
rep(i,q){
string t;cin>>t;
if(t=="query"){
ll a,b;cin>>a>>b;
query[i]=P(a-1,b-2);
d.pb(a-1,b-2,i);
}
else{
ll a;cin>>a;
query[i]=P(-1,a-1);
d.pb(0,0,i);
}
}
init_fractional_cascading(d);
set<ll> S;
rep(i,n)if(v[i])S.insert(i);/*
auto add=[&](int x1,int x2,int y1,int y2,ll x){
for(auto t:d){
ll a,b,id;tie(a,b,id)=t;
if(x1<=a&&a<x2&&y1<=b&&b<y2)ans[id]+=x;
}
};*/
rep(i,q){
// out('?');
if(query[i].fi==-1){
ll ID=query[i].se;
if(v[ID]==1)S.erase(ID);
auto itr=S.lower_bound(ID);
ll a=0,b=n-1;
if(itr!=S.begin()){
itr--;a=(*itr)+1;itr++;
}
if(itr!=S.end())b=(*itr)-1;
// cout<<a<<' '<<ID<<' '<<b<<endl;
if(v[ID])add_all(a,ID,ID,b,0,0,N,-(i+1));
else add_all(a,ID,ID,b,0,0,N,i+1);
if(!v[ID])S.insert(ID);
v[ID]=1-v[ID];
}
else{
// out('!');
ll res=answer_query(i);
auto itr=S.lower_bound(query[i].fi);
if(itr==S.end()||*itr>query[i].se)res+=i+1;
out(res);
}
}
}
Compilation message
street_lamps.cpp: In function 'void init()':
street_lamps.cpp:60:20: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | while(NN[t]<casc[t].size())NN[t]<<=1;
street_lamps.cpp: In function 'void init_fractional_cascading(std::vector<std::tuple<long long int, long long int, long long int> >)':
street_lamps.cpp:81:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
81 | while(N<v.size())N<<=1;
| ~^~~~~~~~~
street_lamps.cpp:82:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
82 | while(v.size()<N)v.pb(0,0,v.size());sort(all(v));
| ~~~~~~~~^~
street_lamps.cpp:82:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
82 | while(v.size()<N)v.pb(0,0,v.size());sort(all(v));
| ^~~~~
street_lamps.cpp:82:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
82 | while(v.size()<N)v.pb(0,0,v.size());sort(all(v));
| ^~~~
street_lamps.cpp:89:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
| ~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:89:48: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
| ~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp: In function 'void add_all(int, int, int, int, int, int, int, ll)':
street_lamps.cpp:111:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
111 | if(b!=casc[k].size())add(k,b,-x);
| ~^~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
1459 ms |
524292 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
5 ms |
2432 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1280 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
1280 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
