結果
問題 | No.765 ukuku 2 |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-03-25 10:12:27 |
言語 | D (dmd 2.106.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,167 bytes |
コンパイル時間 | 1,129 ms |
コンパイル使用メモリ | 119,940 KB |
実行使用メモリ | 49,872 KB |
最終ジャッジ日時 | 2024-06-13 04:29:48 |
合計ジャッジ時間 | 17,635 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 152 ms
23,368 KB |
testcase_01 | AC | 152 ms
16,508 KB |
testcase_02 | AC | 151 ms
17,024 KB |
testcase_03 | AC | 155 ms
19,256 KB |
testcase_04 | AC | 155 ms
16,920 KB |
testcase_05 | AC | 151 ms
16,336 KB |
testcase_06 | AC | 150 ms
16,852 KB |
testcase_07 | AC | 151 ms
18,760 KB |
testcase_08 | AC | 151 ms
16,636 KB |
testcase_09 | AC | 151 ms
19,052 KB |
testcase_10 | AC | 152 ms
16,548 KB |
testcase_11 | AC | 153 ms
16,636 KB |
testcase_12 | AC | 151 ms
17,320 KB |
testcase_13 | AC | 149 ms
16,412 KB |
testcase_14 | AC | 151 ms
16,088 KB |
testcase_15 | AC | 150 ms
19,564 KB |
testcase_16 | AC | 154 ms
19,156 KB |
testcase_17 | AC | 151 ms
16,640 KB |
testcase_18 | AC | 151 ms
16,280 KB |
testcase_19 | AC | 149 ms
18,408 KB |
testcase_20 | AC | 149 ms
16,780 KB |
testcase_21 | AC | 151 ms
16,084 KB |
testcase_22 | AC | 151 ms
16,232 KB |
testcase_23 | AC | 153 ms
16,272 KB |
testcase_24 | AC | 153 ms
16,848 KB |
testcase_25 | AC | 151 ms
16,456 KB |
testcase_26 | AC | 153 ms
18,264 KB |
testcase_27 | AC | 155 ms
19,368 KB |
testcase_28 | AC | 152 ms
16,032 KB |
testcase_29 | AC | 153 ms
16,196 KB |
testcase_30 | AC | 2,187 ms
36,028 KB |
testcase_31 | AC | 2,209 ms
36,208 KB |
testcase_32 | AC | 1,989 ms
31,864 KB |
testcase_33 | TLE | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
ソースコード
import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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)); } enum long[] P = [1000000007, 1000000009, 1000000021, 1000000033, 1000000087, 1000000093, 1000000097, 1000000103]; enum LIM = 2 * 10^^5; int N; string S; void main() { auto BASE = new long[P.length]; BASE[0] = 314159265L; foreach (h; 1 .. P.length) { BASE[h] = (BASE[h - 1] * 123456789L) % 999999937L; } auto BB = new long[][](P.length, LIM + 1); foreach (h; 0 .. P.length) { BB[h][0] = 1; foreach (i; 0 .. LIM) { BB[h][i + 1] = (BB[h][i] * BASE[h]) % P[h]; } } try { for (; ; ) { S = readToken(); N = cast(int)(S.length); auto sum0 = new long[][](P.length, N + 1); auto sum1 = new long[][](P.length, N + 1); foreach (h; 0 .. P.length) { foreach (i; 0 .. N) { sum0[h][i + 1] = (sum0[h][i] + S[i] * BB[h][i]) % P[h]; sum1[h][i + 1] = (sum1[h][i] + S[i] * BB[h][N - i]) % P[h]; } } int calc(int l, int r) { int lo = 0, hi = min(l + 1, N - r) + 1; for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; bool ok = true; foreach (h; 0 .. P.length) { const tmpL = (sum0[h][l + 1] - sum0[h][l + 1 - mid]) * BB[h][N - r]; const tmpR = (sum1[h][r + mid] - sum1[h][r]) * BB[h][l]; if ((tmpL - tmpR) % P[h] != 0) { ok = false; break; } } (ok ? lo : hi) = mid; } debug { writeln("calc ", l, " ", r, " = ", lo); } return lo; } int ans; foreach (i; 0 .. N) { foreach (s; 0 .. 2) { if (i + s < N) { const int a = calc(i, i + s); chmax(ans, 2 * a - 1 + s - 1); if (0 <= i - a) { chmax(ans, 2 * a - 1 + s + 2 * calc(i - a - 1, i + s + a)); } if (i + s + a < N) { chmax(ans, 2 * a - 1 + s + 2 * calc(i - a, i + s + a + 1)); } } } } writeln(ans); } } catch (EOFException e) { } }