結果

問題 No.599 回文かい
ユーザー GrenacheGrenache
提出日時 2017-11-25 09:15:02
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,499 bytes
コンパイル時間 3,100 ms
コンパイル使用メモリ 78,120 KB
実行使用メモリ 77,012 KB
最終ジャッジ日時 2024-11-27 09:47:38
合計ジャッジ時間 15,527 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
42,244 KB
testcase_01 AC 48 ms
77,012 KB
testcase_02 AC 47 ms
42,448 KB
testcase_03 AC 48 ms
36,648 KB
testcase_04 AC 48 ms
37,144 KB
testcase_05 AC 49 ms
37,092 KB
testcase_06 AC 46 ms
36,984 KB
testcase_07 AC 48 ms
37,112 KB
testcase_08 AC 47 ms
37,100 KB
testcase_09 AC 49 ms
36,900 KB
testcase_10 AC 73 ms
37,468 KB
testcase_11 AC 62 ms
36,928 KB
testcase_12 AC 75 ms
38,416 KB
testcase_13 AC 77 ms
38,252 KB
testcase_14 AC 217 ms
38,856 KB
testcase_15 AC 93 ms
38,292 KB
testcase_16 TLE -
testcase_17 TLE -
testcase_18 AC 48 ms
36,996 KB
testcase_19 AC 47 ms
37,052 KB
testcase_20 AC 48 ms
36,924 KB
evil_0.txt AC 200 ms
79,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder599 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		s = sc.next().toCharArray();
		n = s.length;

		pr.println(kai(0, n));
	}

	private static final int MOD = 1_000_000_007;
	private static int n;
	private static char[] s;
	private static int[] dp;

	private static int kai(int i, int j) {
		if (dp == null) {
			dp = new int[n + 1];
			Arrays.fill(dp, -1);
		}

		if (dp[i] >= 0) {
			return dp[i];
		}

		long ret = 1;
		out:
		for (int k = 1; i + k <= j - k; k++) {
			for (int l = 0; l < k; l++) {
				if (s[i + l] != s[j - k + l]) {
					continue out;
				}
			}
//			pr.printf("%d %d\n", i + k, j - k);
			ret += kai(i + k, j - k);
			ret %= MOD;
		}

		return dp[i] = (int)ret;
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0