結果

問題 No.1802 Range Score Query for Bracket Sequence
ユーザー 👑 hos.lyric
提出日時 2022-01-18 02:01:37
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 2,912 bytes
コンパイル時間 701 ms
コンパイル使用メモリ 121,176 KB
実行使用メモリ 13,912 KB
最終ジャッジ日時 2024-06-22 14:05:05
合計ジャッジ時間 4,526 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons
    ;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}
// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}
void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      const S = readToken;
      
      auto cs = S.dup;
      auto bit = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        if (cs[i] == '(' && cs[i + 1] == ')') {
          bit.bAdd(i, +1);
        }
      }
      
      foreach (q; 0 .. Q) {
        const typ = readInt;
        switch (typ) {
          case 1: {
            const pos = readInt - 1;
            
            foreach (i; pos - 1 .. pos + 1) if (0 <= i && i < N - 1) {
              if (cs[i] == '(' && cs[i + 1] == ')') {
                bit.bAdd(i, -1);
              }
            }
            cs[pos] ^= '(' ^ ')';
            foreach (i; pos - 1 .. pos + 1) if (0 <= i && i < N - 1) {
              if (cs[i] == '(' && cs[i + 1] == ')') {
                bit.bAdd(i, +1);
              }
            }
          } break;
          case 2: {
            const l = readInt - 1;
            const r = readInt;
            
            debug {
              writeln("cs = ", cs);
              writeln("bit = ", bit);
            }
            const ans = bit.bSum(r - 1) - bit.bSum(l);
            writeln(ans);
          } break;
          default: assert(false);
        }
      }
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0