結果

問題 No.464 PPAP
ユーザー GrenacheGrenache
提出日時 2016-12-15 22:23:43
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 5,196 bytes
コンパイル時間 4,365 ms
コンパイル使用メモリ 80,544 KB
実行使用メモリ 164,276 KB
最終ジャッジ日時 2024-05-07 15:04:34
合計ジャッジ時間 8,590 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
42,252 KB
testcase_01 AC 46 ms
37,244 KB
testcase_02 AC 49 ms
36,916 KB
testcase_03 AC 48 ms
36,836 KB
testcase_04 AC 65 ms
37,640 KB
testcase_05 AC 52 ms
37,004 KB
testcase_06 AC 48 ms
36,856 KB
testcase_07 AC 390 ms
69,632 KB
testcase_08 AC 228 ms
56,280 KB
testcase_09 AC 84 ms
39,172 KB
testcase_10 TLE -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder464 {

	private static Scanner sc;
	private static Printer pr;

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

		p = new ArrayList<>();
		rp = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			p.add(new ArrayList<>());
			rp.add(new ArrayList<>());
		}

		for (int i = 0; i < n; i++) {
			List<Integer> alist = p.get(i);
			for (int j = i + 1; j <= n; j++) {
				int m = (j - i) / 2;
				boolean flag = true;
				for (int k = 0; k < m; k++) {
					if (s[i + k] != s[j - 1 - k]) {
						flag = false;
						break;
					}
				}

				if (flag) {
					alist.add(j);
					rp.get(j - 1).add(i);
				}
			}
		}

		pr.println(f(s, 0, n));
	}

	private static List<List<Integer>> p;
	private static List<List<Integer>> rp;

	private static long f(char[] s, int from, int to) {
		List<Integer> alist = p.get(from);

		long ret = 0;
		for (int next : alist) {
			if (next >= to) {
				break;
			}
			ret += f2(s, next, to);
		}

		return ret;
	}

	private static long f2(char[] s, int from, int to) {
		List<Integer> alist = p.get(from);

		long ret = 0;
		for (int next : alist) {
			if (next >= to) {
				break;
			}
			ret += f3(s, next, to);
		}

		return ret;
	}

	private static long f3(char[] s, int from, int to) {
		List<Integer> alist = rp.get(to - 1);

		int ret = Collections.binarySearch(alist, from + 1);
		if (ret < 0) {
			ret = -(ret + 1);
		}

		return alist.size() - 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