結果

問題 No.464 PPAP
ユーザー ywmtywmt
提出日時 2018-01-02 06:03:08
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,209 bytes
コンパイル時間 2,411 ms
コンパイル使用メモリ 74,944 KB
実行使用メモリ 55,748 KB
最終ジャッジ日時 2023-08-24 16:29:47
合計ジャッジ時間 8,487 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
54,076 KB
testcase_01 WA -
testcase_02 AC 44 ms
49,228 KB
testcase_03 AC 44 ms
49,120 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 53 ms
49,448 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 517 ms
50,908 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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		String s=ir.next();
		int n=s.length();
		Manacher m=new Manacher(s);
		int ret=0;
		for(int i=0;i<n;i++){
			for(int j=i+1;j<n;j++){
				for(int k=j+1;k<n;k++){
					if(m.isParindrome(0,i)&&m.isParindrome(i+1,j)&&m.isParindrome(k,n-1))
						ret++;
				}
			}
		}
		out.println(ret);
	}

	static class Manacher{

		public long[] rads;
		private int n;

		public Manacher(String s){
			this.n=s.length();
			int m=2*n+1;
			char[] str=new char[m];
			rads=new long[m];
			Arrays.fill(str,'$');
			for(int i=0;i<n;i++)
				str[i*2+1]=s.charAt(i);
			int i=0,j=0;
			while (i<m) {
			  while (i-j >= 0 && i+j < m && str[i-j] == str[i+j]) ++j;
			  rads[i] = j;
			  int k = 1;
			  while (i-k >= 0 && i+k < m && k+rads[i-k] < j){
				  rads[i+k] = rads[i-k]; ++k;
			  }
			  i += k; j -= k;
			}
		}

		public long countEvenParindrome(int idx){
			return (rads[2*idx+2]-1)/2;
		}

		public long countOddParindrome(int idx){
			return (rads[2*idx+1]+1)/2;
		}

		public boolean isParindrome(int l,int r){
			//[l,r]
			return r*2+1<l+r+1+rads[l+r+1];
		}

		public long count(){
			long ret=0;
			for(int i=0;i<n-1;i++)
				ret+=countEvenParindrome(i);
			for(int i=0;i<n;i++)
				ret+=countOddParindrome(i);
			return ret;
		}
	}

	public static void main(String[] args) throws Exception {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

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

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0