이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define pll pair<ll , ll >
#define all(x) (x).begin(),(x).end()
#define SZ(x) (ll)(x).size()
#define X first
#define Y second
#define mp make_pair
#define pii pair<int , int>
#define vec vector
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ld long double
// BIG p : 1000000000000037 , 100000000003
ll poww(ll a, ll b, ll md) {
return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}
const int maxn = 3000*100+50 ;
const ll inf = 9223372036854775807 ;
const ll mod = 1e9 + 7 ;
const int lg = 20 ;
ll n , q ;
string c ;
set<ll> s ;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gp_hash_table<ll, ll> fen[maxn];
ll res ;
inline void add(int l , int r , ll x){
for( ; l < maxn ; l += l & -l ) for(int i = r ; i < maxn ; i += i & -i ) fen[l][i] += x ;
}
inline void get(int l , int r){
res = 0 ;
for( ; l ; l &= l-1 ) for(int i = r ; i ; i &= i-1) if(fen[l].find(i) != fen[l].end()) res += fen[l][i] ;
}
void doj(int l , int r , int l2 , int r2 , ll x){
add(l , r , x) ;
add(l2 + 1 , r2 + 1 , x) ;
add(l , r2 + 1 , -x) ;
add(l2 + 1 , r , -x) ;
}
int main()
{
migmig ;
/*for(int i = 1 ; i < maxn ; i ++ ){
fen[i].max_load_factor(0.13);
}*/
cin>>n>>q>>c ;
s.insert(0) ;
s.insert(n + 1) ;
for(int i = 0 ; i < n ; i ++ ){
if(c[i] == '0') s.insert(i + 1) ;
}
ll l , r ;
ll v ;
for(ll i = 1 ; i <= q ; i ++ ){
cin>>c ;
if(c == "query"){
cin>>l>>r ;
get(l , r) ;
//cout<<*s.lower_bound(l) << endl ;
if(s.lower_bound(l) == s.lower_bound(r) ) res += i ;
cout<<res << "\n" ;
continue ;
}
cin>>v ;
auto p = s.lower_bound(v) ;
if(*p == v){
l = *prev(p) + 1 ;
r = *next(p) ;
s.erase(v) ;
doj(l , v + 1 , v , r , -i ) ;
// cout<<l <<","<< r << endl ;
continue ;
}
l = *prev(p) + 1 ;
r = *p ;
// cout<<l<<" " << r << endl ;
s.insert(v) ;
doj(l , v + 1 , v , r , i) ;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |