結果

問題 No.464 PPAP
ユーザー hiro116shiro116s
提出日時 2017-02-09 02:11:54
言語 Java21
(openjdk 21)
結果
AC  
実行時間 330 ms / 2,000 ms
コード長 4,783 bytes
コンパイル時間 3,868 ms
コンパイル使用メモリ 76,568 KB
実行使用メモリ 77,468 KB
最終ジャッジ日時 2023-08-26 17:46:30
合計ジャッジ時間 6,672 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
49,448 KB
testcase_01 AC 39 ms
49,836 KB
testcase_02 AC 39 ms
49,352 KB
testcase_03 AC 38 ms
49,328 KB
testcase_04 AC 41 ms
49,572 KB
testcase_05 AC 41 ms
49,364 KB
testcase_06 AC 41 ms
49,560 KB
testcase_07 AC 97 ms
52,620 KB
testcase_08 AC 82 ms
52,096 KB
testcase_09 AC 77 ms
52,272 KB
testcase_10 AC 330 ms
77,468 KB
testcase_11 AC 172 ms
66,036 KB
testcase_12 AC 293 ms
77,220 KB
testcase_13 AC 159 ms
77,000 KB
testcase_14 AC 290 ms
77,272 KB
testcase_15 AC 40 ms
49,352 KB
testcase_16 AC 42 ms
49,432 KB
testcase_17 AC 39 ms
49,520 KB
testcase_18 AC 39 ms
49,408 KB
testcase_19 AC 41 ms
49,528 KB
testcase_20 AC 41 ms
49,508 KB
testcase_21 AC 39 ms
49,352 KB
testcase_22 AC 39 ms
49,616 KB
testcase_23 AC 169 ms
77,296 KB
testcase_24 AC 228 ms
77,072 KB
testcase_25 AC 253 ms
76,916 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

import javax.tools.FileObject;

public class Main {
	InputStream is;

	int __t__ = 1;
	int __f__ = 0;
	
	int __STACKSIZE_CHANGE_FLAG__ = __f__;
	int __FILE_DEBUG_FLAG__ = __f__;
	String __DEBUG_FILE_NAME__ = "src/X1";

	FastScanner in;
	PrintWriter out;
	
	public void solve() {
		String s = in.next();
		int N = s.length();
		
		boolean[][] isPalindrome = new boolean[N][N];
		for (int i = 0; i < N; i++) {
			isPalindrome[i][i] = true;
			if (i < N - 1 && s.charAt(i) == s.charAt(i+1))
				isPalindrome[i][i+1] = true;
		}
		for (int d = 2; d < N; d++) {
			for (int l = 0; l < N - d; l++) {
				int r = l + d;
				if (s.charAt(l) == s.charAt(r)) isPalindrome[l][r] = isPalindrome[l+1][r-1];
			}
		}
		long[][] dp = new long[N+1][5];
		dp[0][0] = 1;
		for (int i = 0; i < N; i++) {
			for (int k = 0; k < 4; k++) {
				if (dp[i][k] == 0) continue;
				for (int j = i; j < N; j++) {
					if (isPalindrome[i][j] || k == 2) 
						dp[j+1][k+1] += dp[i][k];
				}
			}
		}
		System.out.println(dp[N][4]);
	}
	
	public void run() {
		if (__FILE_DEBUG_FLAG__ == __t__) {
			try {
				is = new FileInputStream(__DEBUG_FILE_NAME__);
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
			System.out.println("FILE_INPUT!");
		} else {
			is = System.in;
		}
		in = new FastScanner(is);
		out = new PrintWriter(System.out);
		if (__STACKSIZE_CHANGE_FLAG__ == __t__)
			new Thread(null, new Runnable() {
				@Override
				public void run() {
					solve();
				}
			}, "main", 1 << 30).start();
		else
			solve();
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(long[][] a) {
		System.out.println("--------map display---------");

		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}

		System.out.println("----------------------------");
		System.out.println();
	}

	public void debug(Object... obj) {
		System.out.println(Arrays.deepToString(obj));
	}

	class FastScanner {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public FastScanner(InputStream stream) {
			this.stream = stream;
			// stream = new FileInputStream(new File("dec.in"));

		}

		int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();

			return array;
		}

		int[][] nextIntMap(int n, int m) {
			int[][] map = new int[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextIntArray(m);
			}
			return map;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();

			return array;
		}

		long[][] nextLongMap(int n, int m) {
			long[][] map = new long[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextLongArray(m);
			}
			return map;
		}

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

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();

			return array;
		}

		double[][] nextDoubleMap(int n, int m) {
			double[][] map = new double[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextDoubleArray(m);
			}
			return map;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}
0