#1180051 (C++23) No.3652 Range Bracket Sequence

• 問題: No.3652 Range Bracket Sequence
• ユーザー: igeee
• 提出日時: 2026-08-28 22:43:58
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 769 ms / 2,000 ms
• コード長: 5,739 bytes
• コンパイル時間: 5,876 ms
• コンパイル使用メモリ: 415,960 KB
• 実行使用メモリ: 6,272 KB
• 最終ジャッジ日時: 2026-08-28 22:44:35
• 合計ジャッジ時間: 32,531 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_0

ファイルパターン	結果
sample	AC * 3
other	AC * 57

ソースコード

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
#define fr first
#define sc second
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
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<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;
 
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  LL(n,q);
  Str(s);
  ll B = sqrtl(n)+1;
  // [l, r) を処理する基本形、Bはブロックの長さ
  ll siz = lceil(n,B);
  vector<tpl3> blc(siz);


  
  auto clc = [&](ll id) -> tpl3 {
    ll l = B * id;
    ll r = min((id+1)*B,n); 
    vll used(r-l);
    
    ll cnt = 0;
    stack<ll> st;
    reps(i,l,r){
      if(s[i] == '(')st.push(i);
      else if(!st.empty()){
        ll j = st.top();st.pop();
        used[j-l]=1;
        used[i-l]=1;
        cnt++;
      }
    }
    ll ls = 0,rs = 0;
    reps(i,l,r)if(!used[i-l]){
      if(s[i] == '(')ls++;
      else rs++;
    }
    return {cnt,ls,rs};
  };

  rep(i,siz){
    blc[i] = clc(i);
  }

  while(q--){
    LL(type);
    if(type ==1){
      LL(x,t);
      x--;
      if(t == 1){
        s[x] = '(';
      }else s[x] = ')';
      ll id = x/B;
      blc[id] = clc(id);
    }else{
      LL(l,r);
      l--;
      ll cnt = 0;
      ll lrem = 0;
      {
        while(l < r && l % B != 0) {
          // 左端の端数の処理
          if(s[l] == '(')lrem++;
          else if(lrem > 0){
            cnt++;
            lrem--;
          }
          l++;
        }
      }
      
      while(l + B <= r) {
        // ブロック丸ごと処理の処理
        auto [nc,nl,nr] = blc[l/B];
        cnt += nc;
        cnt += min(nr,lrem);
        lrem -= nr;
        chmax(lrem,0LL);
        lrem += nl;
        l += B;
      }
      
      {
        
        while(l < r) {
          // 右端の端数を愚直の処理
          if(s[l] == '(')lrem++;
          else if(lrem > 0){
            cnt++;
            lrem--;
          }
          l++;
        }
      }
      cout << 2*cnt << endl;
    }
  }

  
}