#728878 (C++14) No.1802 Range Score Query for Bracket Sequence

• 問題: No.1802 Range Score Query for Bracket Sequence
• ユーザー: 蜜蜂
• 提出日時: 2022-01-07 22:08:49
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 330 ms / 2,000 ms
• コード長: 1,794 bytes
• コンパイル時間: 3,979 ms
• コンパイル使用メモリ: 230,280 KB
• 実行使用メモリ: 7,296 KB
• 最終ジャッジ日時: 2024-06-30 02:15:59
• 合計ジャッジ時間: 8,543 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 1
other	AC * 24

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())
int op(int a,int b){
  return a+b;
}
int e(){
  return 0;
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n,q;
  cin>>n>>q;
  string s;
  cin>>s;
  vi a(n);
  rep(i,0,n){
    if(s[i]=='('){
      a[i]=0;
    }
    else{
      a[i]=1;
    }
  }
  vi sc(n-1);
  rep(i,0,n-1){
    if(a[i]==1&&a[i+1]==0){
      sc[i]=1;
    }
    else{
      sc[i]=0;
    }
  }
  segtree<int,op,e> seg(sc);
  while(q--){
    int x;
    cin>>x;
    if(x==1){
      int id;
      cin>>id;
      id--;
      a[id]=1-a[id];
      if(id<n-1){
        if(a[id]==1&&a[id+1]==0){
          seg.set(id,1);
        }
        else{
          seg.set(id,0);
        }
      }
      if(0<id){
        if(a[id-1]==1&&a[id]==0){
          seg.set(id-1,1);
        }
        else{
          seg.set(id-1,0);
        }
      }
    }
    else{
      int l,r;
      cin>>l>>r;
      l--;r--;
      int p=seg.prod(l,r);
      p++;
      if(a[l]==1){
        p--;
      }
      if(a[r]==0){
        p--;
      }
      cout<<p<<endl;
    }
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX