結果

問題 No.1848 Long Prefixes
ユーザー 👑 hos.lyric
提出日時 2022-02-18 21:50:03
言語 D
(dmd 2.109.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
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

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)); }
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) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0