結果
問題 | No.599 回文かい |
ユーザー | 37zigen |
提出日時 | 2017-11-26 11:46:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 333 ms / 4,000 ms |
コード長 | 3,223 bytes |
コンパイル時間 | 1,973 ms |
コンパイル使用メモリ | 77,752 KB |
実行使用メモリ | 44,572 KB |
最終ジャッジ日時 | 2024-05-05 13:48:27 |
合計ジャッジ時間 | 5,696 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
36,500 KB |
testcase_01 | AC | 43 ms
36,588 KB |
testcase_02 | AC | 44 ms
36,424 KB |
testcase_03 | AC | 44 ms
36,616 KB |
testcase_04 | AC | 66 ms
37,100 KB |
testcase_05 | AC | 58 ms
36,796 KB |
testcase_06 | AC | 57 ms
37,004 KB |
testcase_07 | AC | 63 ms
37,096 KB |
testcase_08 | AC | 72 ms
37,336 KB |
testcase_09 | AC | 58 ms
37,020 KB |
testcase_10 | AC | 229 ms
44,224 KB |
testcase_11 | AC | 201 ms
44,572 KB |
testcase_12 | AC | 276 ms
44,108 KB |
testcase_13 | AC | 209 ms
44,268 KB |
testcase_14 | AC | 233 ms
43,592 KB |
testcase_15 | AC | 240 ms
43,796 KB |
testcase_16 | AC | 333 ms
43,156 KB |
testcase_17 | AC | 325 ms
43,304 KB |
testcase_18 | AC | 46 ms
36,616 KB |
testcase_19 | AC | 47 ms
36,232 KB |
testcase_20 | AC | 46 ms
36,708 KB |
evil_0.txt | AC | 238 ms
43,952 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; class Main { public static void main(String[] args) { // long time = System.currentTimeMillis(); new Main().run(); // System.err.println(System.currentTimeMillis() - time); } final long MOD = 1_000_000_000 + 7; void run() { Scanner sc = new Scanner(); String s = sc.next(); int n = s.length(); long[] f = new long[(n + 1) / 2]; Arrays.fill(f, 1); for (int i = 0; i < (n + 1) / 2; ++i) { String t = s.substring((n - 1) / 2 - i, n / 2 + i + 1); int pos = i; int[] h = zalgo(t); for (int j = (t.length() + 1) / 2; j < t.length(); ++j) { int len = t.length() - j; if (h[j] != len) continue; if (pos - len == -1) { f[pos] = (f[pos] + 1); } else f[pos] = (f[pos] + f[pos - len]); if (f[pos] >= MOD) f[pos] -= MOD; } } System.out.println(f[f.length - 1]); } int[] zalgo(String s) { int n = s.length(); int[] ret = new int[n]; ret[0] = n; int i = 1, j = 0; while (i < n) { while (i + j < n && s.charAt(j) == s.charAt(i + j)) ++j; ret[i] = j; if (j == 0) { ++i; continue; } int k = 1; while (i + k < n && k + ret[k] < j) { ret[i + k] = ret[k]; ++k; } i += k; j -= k; } return ret; } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } } void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }