結果

問題 No.3239 Omnibus
ユーザー hos.lyric
提出日時 2025-08-15 22:07:55
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 600 ms / 10,000 ms
コード長 3,899 bytes
コンパイル時間 3,281 ms
コンパイル使用メモリ 111,476 KB
実行使用メモリ 61,928 KB
最終ジャッジ日時 2025-08-15 22:08:31
合計ジャッジ時間 16,575 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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;
}

// sum of [l, r)
T bSum(T)(T[] bit, int l, int r)
in {
  assert(0 <= l && l <= r && r <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  return bit.bSum(r) - bit.bSum(l);
}


enum A = 26;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      auto S = readToken.dup;
      auto O = new int[Q];
      
      alias Entry = Tuple!(int, "q", int, "l", int, "r", int, "sig");
      Entry[][A][A][A] E;
      foreach (i; 0 .. N - 3 + 1) {
        E[S[i] - 'a'][S[i + 1] - 'a'][S[i + 2] - 'a'] ~= Entry(-1, i, i + 3, +1);
      }
      foreach (q; 0 .. Q) {
        O[q] = readInt;
        if (O[q] == 1) {
          const K = readInt - 1;
          const X = readToken[0];
          foreach (i; K - 2 .. K + 1) if (0 <= i && i + 3 <= N) {
            E[S[i] - 'a'][S[i + 1] - 'a'][S[i + 2] - 'a'] ~= Entry(q, i, i + 3, -1);
          }
          S[K] = X;
          foreach (i; K - 2 .. K + 1) if (0 <= i && i + 3 <= N) {
            E[S[i] - 'a'][S[i + 1] - 'a'][S[i + 2] - 'a'] ~= Entry(q, i, i + 3, +1);
          }
        } else if (O[q] == 2) {
          const L = readInt - 1;
          const R = readInt;
          const T = readToken;
          E[T[0] - 'a'][T[1] - 'a'][T[2] - 'a'] ~= Entry(q, L, R, 0);
        } else {
          assert(false);
        }
      }
      foreach (i; 0 .. N - 3 + 1) {
        E[S[i] - 'a'][S[i + 1] - 'a'][S[i + 2] - 'a'] ~= Entry(Q, i, i + 3, -1);
      }
      
      auto ans = new long[Q];
      auto bit0 = new long[N];
      auto bit1 = new long[N];
      foreach (a0; 0 .. A) foreach (a1; 0 .. A) foreach (a2; 0 .. A) if (E[a0][a1][a2]) {
        debug writeln(cast(char)('a' + a0), cast(char)('a' + a1), cast(char)('a' + a2));
        foreach (e; E[a0][a1][a2]) {
          debug writeln(e);
          if (e.sig) {
            bit0.bAdd(e.l, e.sig);
            bit1.bAdd(e.l, e.sig * e.l);
          } else {
            if (e.r - e.l >= 3) {
              const res0 = bit0.bSum(e.l, e.r - 2);
              const res1 = bit1.bSum(e.l, e.r - 2);
              ans[e.q] += (res1 - (e.l - 1) * res0);
            }
          }
        }
      }
      
      foreach (q; 0 .. Q) if (O[q] == 2) {
        writeln(ans[q]);
      }
    }
  } catch (EOFException e) {
  }
}
0