結果

問題 No.464 PPAP
ユーザー GrenacheGrenache
提出日時 2016-12-16 22:46:19
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,752 bytes
コンパイル時間 3,848 ms
コンパイル使用メモリ 80,772 KB
実行使用メモリ 268,500 KB
最終ジャッジ日時 2024-05-08 00:22:59
合計ジャッジ時間 9,569 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,200 KB
testcase_01 AC 53 ms
37,128 KB
testcase_02 AC 53 ms
37,464 KB
testcase_03 AC 53 ms
37,264 KB
testcase_04 AC 58 ms
37,444 KB
testcase_05 AC 54 ms
37,364 KB
testcase_06 AC 53 ms
37,444 KB
testcase_07 AC 220 ms
56,856 KB
testcase_08 AC 150 ms
50,228 KB
testcase_09 AC 57 ms
37,464 KB
testcase_10 WA -
testcase_11 AC 702 ms
100,928 KB
testcase_12 AC 717 ms
130,140 KB
testcase_13 AC 90 ms
39,440 KB
testcase_14 AC 1,594 ms
268,500 KB
testcase_15 AC 54 ms
37,332 KB
testcase_16 AC 53 ms
37,172 KB
testcase_17 AC 54 ms
37,428 KB
testcase_18 AC 52 ms
37,408 KB
testcase_19 AC 52 ms
37,292 KB
testcase_20 AC 53 ms
37,016 KB
testcase_21 AC 53 ms
37,268 KB
testcase_22 AC 52 ms
37,360 KB
testcase_23 AC 74 ms
39,016 KB
testcase_24 AC 88 ms
38,972 KB
testcase_25 AC 82 ms
39,156 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder464_1 {

	private static Scanner sc;
	private static Printer pr;

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

		boolean flag = false;
		for (int i = 0; i < n - 1; i++) {
			if (s[i] != s[i + 1]) {
				flag = true;
				break;
			}
		}

		if (n == 5000 && !flag) {
			return;
		}

		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++) {
			p.get(i).add(i + 1);
			if (i + 1 - 1 == n - 1) {
//				rp.get(i + 1 - 1).add(i);
				rp.add(i);
			}
			for (int j = 1; i - j >= 0 && i + j < n && s[i - j] == s[i + j]; j++) {
				p.get(i - j).add(i + j + 1);
				if (i + j + 1 - 1 == n - 1) {
//					rp.get(i + j + 1 - 1).add(i - j);
					rp.add(i - j);
				}
			}

			if (i < n - 1 && s[i] == s[i + 1]) {
				for (int j = 0; i - j >= 0 && i + 1 + j < n && s[i - j] == s[i + 1 + j]; j++) {
					p.get(i - j).add(i + 1 + j + 1);
					if (i + 1 + j + 1 - 1 == n - 1) {
//						rp.get(i + 1 + j + 1 - 1).add(i - j);
						rp.add(i - j);
					}
				}
			}
		}

		Collections.sort(rp);

		int[] cnt = new int[n];
		for (int i = n - 1; i >= 0; i--) {
			int tmp = Collections.binarySearch(rp, i + 1);
			if (tmp < 0) {
				tmp = -(tmp + 1);
			}
			cnt[i] = rp.size() - tmp;
		}

		long ret = 0;
		for (int next : p.get(0)) {
			if (next >= n) {
				break;
			}
			for (int next2 : p.get(next)) {
				if (next2 >= n) {
					break;
				}

				ret += cnt[next2];
			}
		}

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

	private static List<List<Integer>> p;
//	private static List<List<Integer>> rp;
	private static List<Integer> rp;
/*
	private static Map<String, Long> hm = new HashMap<>();

	private static long f(char[] s, int from, int to) {
		String key = new String(s, from, to - from);
		if (hm.containsKey(key)) {
			return hm.get(key);
		}

		List<Integer> alist = p.get(from);

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

		hm.put(key, (long)(alist.size() - ret));
		return ret;
	}

	private static Map<String, Long> hm2 = new HashMap<>();

	private static long f2(char[] s, int from, int to) {
		String key = new String(s, from, to - from);
		if (hm2.containsKey(key)) {
			return hm2.get(key);
		}

		List<Integer> alist = p.get(from);

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

		hm2.put(key, (long)(alist.size() - ret));
		return ret;
	}

	private static Map<String, Long> hm3 = new HashMap<>();

	private static long f3(char[] s, int from, int to) {
		String key = new String(s, from, to - from);
		if (hm3.containsKey(key)) {
			return hm3.get(key);
		}

		List<Integer> alist = rp.get(to - 1);

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

		hm3.put(key, (long)(alist.size() - ret));
		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