#740213 (D) No.1848 Long Prefixes

提出ソース

結果

問題	No.1848 Long Prefixes
ユーザー	👑 hos.lyric
提出日時	2022-02-18 21:50:03
言語	D (dmd 2.106.1)
結果	AC
実行時間	42 ms / 2,000 ms
コード長	4,627 bytes
コンパイル時間	1,329 ms
コンパイル使用メモリ	154,604 KB
実行使用メモリ	13,800 KB
最終ジャッジ日時	2024-06-22 14:18:49
合計ジャッジ時間	3,995 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	42 ms 13,480 KB
testcase_01	AC	22 ms 13,788 KB
testcase_02	AC	40 ms 13,412 KB
testcase_03	AC	38 ms 13,656 KB
testcase_04	AC	23 ms 13,800 KB
testcase_05	AC	41 ms 13,548 KB
testcase_06	AC	37 ms 13,272 KB
testcase_07	AC	21 ms 13,160 KB
testcase_08	AC	37 ms 13,700 KB
testcase_09	AC	36 ms 13,608 KB
testcase_10	AC	24 ms 13,276 KB
testcase_11	AC	39 ms 13,740 KB
testcase_12	AC	33 ms 12,788 KB
testcase_13	AC	20 ms 13,160 KB
testcase_14	AC	39 ms 13,576 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	1 ms 6,944 KB
testcase_19	AC	1 ms 6,944 KB
testcase_20	AC	1 ms 6,940 KB
testcase_21	AC	1 ms 6,944 KB
testcase_22	AC	1 ms 6,944 KB
testcase_23	AC	1 ms 6,940 KB
testcase_24	AC	1 ms 6,940 KB
testcase_25	AC	1 ms 6,944 KB
testcase_26	AC	1 ms 6,944 KB
testcase_27	AC	1 ms 6,940 KB
testcase_28	AC	1 ms 6,940 KB
testcase_29	AC	1 ms 6,940 KB
testcase_30	AC	1 ms 6,944 KB
testcase_31	AC	1 ms 6,944 KB
testcase_32	AC	1 ms 6,944 KB
testcase_33	AC	18 ms 6,940 KB
testcase_34	AC	21 ms 10,076 KB
testcase_35	AC	9 ms 6,944 KB
testcase_36	AC	15 ms 6,944 KB
testcase_37	AC	15 ms 6,944 KB
testcase_38	AC	20 ms 8,800 KB
testcase_39	AC	14 ms 6,944 KB

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

ソースコード

raw source code

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


struct ModInt(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = x_ % M; }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;


int[] getZ(T)(T a) {
  const n = cast(int)(a.length);
  auto z = new int[n + 1];
  int j = 0;
  foreach (i; 1 .. n) {
    if (i + z[i - j] < j + z[j]) {
      z[i] = z[i - j];
    } else {
      int k = max(j + z[j] - i, 0);
      for (; i + k < n && a[k] == a[i + k]; ++k) {}
      z[i] = k;
      j = i;
    }
  }
  z[0] = n;
  return z;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      const S = readToken;
      
      auto ASum = new long[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      
      const ZA = getZ(A[1 .. $]);
      const ZS = getZ(S[1 .. $]);
      debug {
        writeln("A = ", A);
        writeln("S = ", S);
        writeln("ZA = ", ZA);
        writeln("ZS = ", ZS);
      }
      
      Mint ans;
      foreach (i; 0 .. N) {
        if (S[0] == S[i]) {
          if (A[0] <= A[i]) {
            ans += Mint(A[i] - A[0]) * Mint(A[0]);
            ans += Mint(A[0]) * Mint(A[0] + 1) / 2;
            const k = min(ZA[i], ZS[i]);
            debug {
              writefln("i = %s: k = %s", i, k);
            }
            ans += Mint(ASum[i + 1 + k] - ASum[i + 1]);
            if (i + 1 + k < N && S[1 + k] == S[i + 1 + k]) {
              ans += Mint(min(A[1 + k], A[i + 1 + k]));
            }
          } else {
            ans += Mint(A[i]) * Mint(A[i] + 1) / 2;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード