結果

問題 No.2020 Sum of Common Prefix Length
ユーザー 👑 hos.lyric
提出日時 2022-07-22 21:51:50
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 348 ms / 2,000 ms
コード長 3,679 bytes
コンパイル時間 1,069 ms
コンパイル使用メモリ 122,184 KB
実行使用メモリ 69,268 KB
最終ジャッジ日時 2024-06-22 15:51:17
合計ジャッジ時間 12,840 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

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


enum E = 26;
int V;
int[][] nxt;

int zeit;
int[] dis, fin;
void dfs(int u) {
  dis[u] = zeit++;
  foreach (e; 0 .. E) {
    const v = nxt[u][e];
    if (~v) {
      dfs(v);
    }
  }
  fin[u] = zeit++;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto S = new string[N];
      foreach (i; 0 .. N) {
        S[i] = readToken;
      }
      const Q = readInt;
      auto O = new int[Q];
      auto X = new int[Q];
      auto C = new char[Q];
      foreach (q; 0 .. Q) {
        O[q] = readInt;
        X[q] = readInt - 1;
        if (O[q] == 1) {
          C[q] = readToken[0];
        }
      }
      
      auto L = new int[N];
      foreach (i; 0 .. N) {
        L[i] = cast(int)(S[i].length);
      }
      foreach (q; 0 .. Q) if (O[q] == 1) {
        S[X[q]] ~= C[q];
      }
      debug {
        writeln("S = ", S);
      }
      {
        int sumLen = 1;
        foreach (i; 0 .. N) {
          sumLen += cast(int)(S[i].length);
        }
        nxt = new int[][](sumLen, E);
        foreach (u; 0 .. sumLen) {
          nxt[u][] = -1;
        }
      }
      V = 1;
      
      foreach (i; 0 .. N) {
        int u;
        foreach (s; S[i]) {
          const e = s - 'a';
          if (!~nxt[u][e]) nxt[u][e] = V++;
          u = nxt[u][e];
        }
      }
      zeit = 0;
      dis = new int[V];
      fin = new int[V];
      dfs(0);
      debug {
        writeln("dis = ", dis);
        writeln("fin = ", fin);
      }
      
      auto bit = new long[2 * V];
      auto js = new int[N];
      auto us = new int[N];
      void adv(int i) {
        const e = S[i][js[i]++] - 'a';
        us[i] = nxt[us[i]][e];
        bit.bAdd(dis[us[i]], +1);
        bit.bAdd(fin[us[i]], -1);
      }
      
      foreach (i; 0 .. N) {
        for (; js[i] < L[i]; ) {
          adv(i);
        }
      }
      foreach (q; 0 .. Q) {
        if (O[q] == 1) {
          adv(X[q]);
        } else {
          const ans = bit.bSum(dis[us[X[q]]] + 1);
          writeln(ans);
        }
      }
    }
  } catch (EOFException e) {
  }
}
0