#729247 (C++17) No.1802 Range Score Query for Bracket Sequence

• 問題: No.1802 Range Score Query for Bracket Sequence
• ユーザー: first_vil
• 提出日時: 2022-01-08 16:01:57
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 70 ms / 2,000 ms
• コード長: 4,661 bytes
• コンパイル時間: 2,105 ms
• コンパイル使用メモリ: 204,600 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-30 02:20:16
• 合計ジャッジ時間: 4,656 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	67 ms; 5,376 KB
testcase_02	AC	66 ms; 5,376 KB
testcase_03	AC	68 ms; 5,376 KB
testcase_04	AC	68 ms; 5,376 KB
testcase_05	AC	67 ms; 5,376 KB
testcase_06	AC	70 ms; 5,376 KB
testcase_07	AC	66 ms; 5,376 KB
testcase_08	AC	67 ms; 5,376 KB
testcase_09	AC	68 ms; 5,376 KB
testcase_10	AC	67 ms; 5,376 KB
testcase_11	AC	65 ms; 5,376 KB
testcase_12	AC	63 ms; 5,376 KB
testcase_13	AC	63 ms; 5,376 KB
testcase_14	AC	64 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	1 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB

ソースコード

// clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define inside(h,w,y,x) (unsigned(y)<h&&unsigned(x)<w)
#ifndef ONLINE_JUDGE
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr int dy[]{ -1,0,1,0 }, dx[]{ 0,1,0,-1 };
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T> inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T> inline V<T> vec(size_t a) { return V<T>(a); }
template<class T> inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts> inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T> inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts> inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T> inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T> inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T> inline constexpr const T cumsum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }//[l,r]
template<class T> inline constexpr const T min(const V<T>& v) { return *min_element(all(v)); }
template<class T> inline constexpr const T max(const V<T>& v) { return *max_element(all(v)); }
// clang-format on

template <class T> class BinaryIndexedTree {
    int n;
    vector<T> dat;

public:
    BinaryIndexedTree(int n) : n(n), dat(n + 1){};
    BinaryIndexedTree(int n, T a) : n(n), dat(n + 1) {
        eFOR(i, 1, n) {
            dat[i] += a;
            if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i];
        }
    }
    BinaryIndexedTree(VI v) : n(v.size()), dat(n + 1) {
        eFOR(i, 1, n) {
            dat[i] += v[i - 1];
            if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i];
        }
    }
    void add(int i, T a) {
        for (++i; i <= n; i += i & -i) dat[i] += a;
    }
    T sum(int r) {  // sum of [0,r)
        T res = 0;
        for (; r; r -= r & -r) res += dat[r];
        return res;
    }
    T sum(int l, int r) {  // sum of [l,r)
        if (l < 0 || n < r || l > r) return 0;
        return sum(r) - sum(l);
    }
    int lower_bound(T a) {
        int res = 0, k = 1;
        for (; k * 2 <= n; k *= 2)
            ;
        for (; k; k /= 2) {
            if (res + k <= n && a > dat[res + k]) {
                a -= dat[res + k];
                res += k;
            }
        }
        return res;
    }
};

int main() {
    init();

    int n, q;
    cin >> n >> q;
    string s;
    cin >> s;

    BinaryIndexedTree<int> bit(n);
    FOR(i, 0, n - 1) if (s.substr(i, 2) == "()") bit.add(i, 1);
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int i;
            cin >> i;
            --i;
            if (0 < i && s.substr(i - 1, 2) == "()") bit.add(i - 1, -1);
            if (s.substr(i, 2) == "()") bit.add(i, -1);
            s[i] ^= '(' ^ ')';
            if (0 < i && s.substr(i - 1, 2) == "()") bit.add(i - 1, 1);
            if (s.substr(i, 2) == "()") bit.add(i, 1);
        }
        else {
            int l, r;
            cin >> l >> r;
            --l, --r;
            print(bit.sum(l, r));
        }
    }

    return 0;
}