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

提出ソース

結果

問題	No.1802 Range Score Query for Bracket Sequence
ユーザー	stoq
提出日時	2022-01-08 01:07:58
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	89 ms / 2,000 ms
コード長	6,534 bytes
コンパイル時間	3,833 ms
コンパイル使用メモリ	245,204 KB
実行使用メモリ	16,068 KB
最終ジャッジ日時	2024-06-30 02:18:55
合計ジャッジ時間	6,613 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	29 ms 14,944 KB
testcase_01	AC	84 ms 16,000 KB
testcase_02	AC	82 ms 15,988 KB
testcase_03	AC	83 ms 16,000 KB
testcase_04	AC	83 ms 16,000 KB
testcase_05	AC	81 ms 15,984 KB
testcase_06	AC	88 ms 15,892 KB
testcase_07	AC	85 ms 16,000 KB
testcase_08	AC	83 ms 16,000 KB
testcase_09	AC	83 ms 15,928 KB
testcase_10	AC	83 ms 16,068 KB
testcase_11	AC	85 ms 15,948 KB
testcase_12	AC	86 ms 16,036 KB
testcase_13	AC	81 ms 16,000 KB
testcase_14	AC	89 ms 16,000 KB
testcase_15	AC	31 ms 14,840 KB
testcase_16	AC	30 ms 14,976 KB
testcase_17	AC	31 ms 14,944 KB
testcase_18	AC	31 ms 14,960 KB
testcase_19	AC	29 ms 14,908 KB
testcase_20	AC	28 ms 14,936 KB
testcase_21	AC	29 ms 14,832 KB
testcase_22	AC	29 ms 14,980 KB
testcase_23	AC	30 ms 14,976 KB
testcase_24	AC	29 ms 14,892 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define MOD_TYPE 1

#include <bits/stdc++.h>
using namespace std;

//#include <atcoder/all>
#include <atcoder/modint>
//#include <atcoder/lazysegtree>
#include <atcoder/segtree>

using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 1
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 0
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#pragma region Macros

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif

using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())

struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T& val) {
  fill((T*)array, (T*)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T>& v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto&& vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream& operator>>(istream& is, pair<T, U>& p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream& operator<<(ostream& os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream& operator<<(ostream& os, mint m) {
  os << m.val();
  return os;
}
ostream& operator<<(ostream& os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream& operator>>(istream& is, vector<T>& v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream& operator<<(ostream& os, vector<T>& v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(1000010);

#pragma endregion

// -------------------------------

template <typename T>
struct BIT {
  int n;
  vector<T> dat;

  BIT() {}
  BIT(int n) : n(n), dat(n + 1, 0) {}
  BIT(vector<T>& a) : n(a.size()), dat(a.size() + 1) {
    for (int i = 0; i < n; i++) dat[i + 1] = a[i];
    for (int i = 1; i <= n; i++) {
      if (i + (i & -i) <= n) dat[i + (i & -i)] += dat[i];
    }
  }

  // 0-indexed
  void add(int i, T x) {
    i++;
    while (i <= n) {
      dat[i] += x;
      i += i & -i;
    }
  }

  void update(int i, T x) { add(i, x - get(i)); }

  // [0, i)
  T sum(int i) {
    T res = 0;
    while (i > 0) {
      res += dat[i];
      i -= i & -i;
    }
    return res;
  }

  // 0-indexed
  T get(int i) { return sum(i + 1) - sum(i); }

  // [l, r)
  T query(int l, int r) { return sum(r) - sum(l); }

  void display() {
    for (int i = 0; i < n; i++) cerr << get(i) << " ";
    cerr << "\n";
  }
};

void solve() {
  int n, q;
  string s;
  cin >> n >> q >> s;
  BIT<int> bit(n - 1);
  rep(i, n - 1) {
    if (s[i] == '(' and s[i + 1] == ')') bit.add(i, 1);
  }
  map<char, char> rev;
  rev['('] = ')', rev[')'] = '(';
  rep(qi, q) {
    int t;
    cin >> t;
    if (t == 1) {
      int i;
      cin >> i, i--;
      if (i < n - 1 and s[i] == '(' and s[i + 1] == ')') bit.add(i, -1);
      if (i > 0 and s[i - 1] == '(' and s[i] == ')') bit.add(i - 1, -1);
      s[i] = rev[s[i]];
      if (i < n - 1 and s[i] == '(' and s[i + 1] == ')') bit.add(i, 1);
      if (i > 0 and s[i - 1] == '(' and s[i] == ')') bit.add(i - 1, 1);
    } else {
      int l, r;
      cin >> l >> r;
      l--;
      cout << bit.query(l, r - 1) << "\n";
    }
  }
}

int main() { solve(); }

yukicoder

結果

テストケース

ソースコード