結果
問題 | No.464 PPAP |
ユーザー |
|
提出日時 | 2020-04-15 02:02:48 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 395 ms / 2,000 ms |
コード長 | 3,191 bytes |
コンパイル時間 | 2,285 ms |
コンパイル使用メモリ | 78,272 KB |
実行使用メモリ | 66,284 KB |
最終ジャッジ日時 | 2024-10-01 18:33:24 |
合計ジャッジ時間 | 6,643 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 22 |
ソースコード
import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.NoSuchElementException;public class Main {final long MOD=(long)1e9+7;boolean[][] palindrome(char[] cs) {int n=cs.length;boolean[][] dp=new boolean[n][n];for (int i=0;i<n;++i) {int p=0;while (0<=i-p&&i+p<n&&cs[i-p]==cs[i+p]) {dp[i-p][i+p]=true;++p;}p=0;while (0<=i-p-1&&i+p<n&&cs[i-p-1]==cs[i+p]) {dp[i-p-1][i+p]=true;++p;}}return dp;}void run() {FastScanner sc=new FastScanner();PrintWriter pw=new PrintWriter(System.out);char[] cs=sc.next().toCharArray();int n=cs.length;boolean[][] dp=palindrome(cs);long[] head=new long[n];//P1=[0....i]//P2=[i+1...j]for (int i=0;i<n;++i) {if (!dp[0][i]) continue;for (int j=i+1;j<n;++j) {if (!dp[i+1][j]) continue;++head[j];}}long ans=0;for (int i=0;i<n;++i) {for (int j=i+2;j<n;++j) {if (!dp[j][n-1]) continue;ans+=head[i];}}pw.println(ans);pw.close();}void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}public static void main(String[] args) {new Main().run();}}class FastScanner {private final InputStream in = System.in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}public boolean hasNext() { skipUnprintable(); return hasNextByte();}public String next() {if (!hasNext()) throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {return (int)nextLong();}}