結果

問題 No.464 PPAP
ユーザー GrenacheGrenache
提出日時 2016-12-16 18:54:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 242 ms / 2,000 ms
コード長 4,680 bytes
コンパイル時間 4,056 ms
コンパイル使用メモリ 78,080 KB
実行使用メモリ 66,256 KB
最終ジャッジ日時 2024-11-30 10:32:52
合計ジャッジ時間 6,762 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
38,688 KB
testcase_01 AC 54 ms
38,844 KB
testcase_02 AC 55 ms
39,116 KB
testcase_03 AC 55 ms
38,760 KB
testcase_04 AC 55 ms
38,488 KB
testcase_05 AC 54 ms
40,784 KB
testcase_06 AC 55 ms
40,844 KB
testcase_07 AC 85 ms
42,184 KB
testcase_08 AC 88 ms
42,136 KB
testcase_09 AC 56 ms
40,828 KB
testcase_10 AC 242 ms
66,196 KB
testcase_11 AC 139 ms
56,508 KB
testcase_12 AC 174 ms
66,104 KB
testcase_13 AC 88 ms
64,500 KB
testcase_14 AC 173 ms
66,256 KB
testcase_15 AC 55 ms
40,456 KB
testcase_16 AC 54 ms
40,924 KB
testcase_17 AC 57 ms
40,804 KB
testcase_18 AC 55 ms
40,952 KB
testcase_19 AC 55 ms
40,904 KB
testcase_20 AC 56 ms
40,756 KB
testcase_21 AC 56 ms
40,956 KB
testcase_22 AC 55 ms
40,892 KB
testcase_23 AC 88 ms
64,476 KB
testcase_24 AC 88 ms
64,364 KB
testcase_25 AC 89 ms
64,768 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder464_2 {

	private static Scanner sc;
	private static Printer pr;

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

		boolean[][] p = new boolean[n][n];
		for (int i = 0; i < n; i++) {
			p[i][i] = true;
			for (int k = 1; i - k >= 0 && i + k < n && s[i - k] == s[i + k]; k++) {
				p[i - k][i + k] = true;
			}

			if (i + 1 < n && s[i] == s[i + 1]) {
				p[i][i + 1] = true;
				for (int k = 1; i - k >= 0 && i + 1 + k < n && s[i - k] == s[i + 1 + k]; k++) {
					p[i - k][i + 1 + k] = true;
				}
			}
		}

		int[] cnt = new int[n];
		for (int i = n - 2; i >= 0; i--) {
			if (p[i + 1][n - 1]) {
				cnt[i] = cnt[i + 1] + 1;
			} else {
				cnt[i] = cnt[i + 1];
			}
		}

		long ret = 0;
		for (int j = 1; j <= n; j++) {
			if (p[0][j - 1]) {
				for (int k = j + 1; k < n; k++) {
					if (p[j][k - 1]) {
						ret += cnt[k];
					}
				}
			}
		}

		pr.println(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