結果

問題 No.599 回文かい
ユーザー uafr_csuafr_cs
提出日時 2017-11-24 23:16:46
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 3,170 bytes
コンパイル時間 1,958 ms
コンパイル使用メモリ 77,656 KB
実行使用メモリ 46,272 KB
最終ジャッジ日時 2024-05-05 11:31:52
合計ジャッジ時間 9,713 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 102 ms
46,272 KB
testcase_01 AC 98 ms
40,220 KB
testcase_02 AC 93 ms
40,284 KB
testcase_03 AC 104 ms
41,004 KB
testcase_04 AC 111 ms
41,144 KB
testcase_05 AC 123 ms
40,872 KB
testcase_06 AC 124 ms
41,100 KB
testcase_07 AC 119 ms
41,032 KB
testcase_08 AC 102 ms
40,576 KB
testcase_09 AC 117 ms
41,108 KB
testcase_10 AC 174 ms
41,424 KB
testcase_11 AC 169 ms
41,200 KB
testcase_12 AC 231 ms
40,844 KB
testcase_13 AC 350 ms
42,792 KB
testcase_14 TLE -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
evil_0.txt -- -
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
	
	public static long P1 = 1298719;
	public static long P2 = 961151;
	public static long MOD = 1000000007;
	
	public static long[] rolling_hash1(char[] ins){
		long[] hash = new long[ins.length + 1];
		
		hash[0] = 0;
		for(int i = 1; i <= ins.length; i++){
			hash[i] = hash[i - 1] * P1;
			hash[i] %= MOD;
			hash[i] += ins[i - 1];
			hash[i] %= MOD;
		}
		
		return hash;
	}
	
	public static long[] rolling_hash2(char[] ins){
		long[] hash = new long[ins.length + 1];
		
		hash[0] = 0;
		for(int i = 1; i <= ins.length; i++){
			hash[i] = hash[i - 1] * P2;
			hash[i] %= MOD;
			hash[i] += ins[i - 1];
			hash[i] %= MOD;
		}
		
		return hash;
	}
	
	public static long mod_pow(long a, long p){
		if(p == 0){ return 1; }
		if(p == 1){ return a % MOD; }
		if(p % 2 == 1){
			return (mod_pow(a, p - 1) * a) % MOD;
		}else{
			final long ret = mod_pow(a, p / 2) % MOD;
			return (ret * ret) % MOD;
		}
	}
	
	public static long calc_hash1(long[] hash, int begin, int end){
		final long from_end = hash[end];
		final long from_begin = (hash[begin] * mod_pow(P1, (end - begin))) % MOD;
		return (MOD + (from_end - from_begin)) % MOD;
	}
	
	public static long calc_hash2(long[] hash, int begin, int end){
		final long from_end = hash[end];
		final long from_begin = (hash[begin] * mod_pow(P2, (end - begin))) % MOD;
		return (MOD + (from_end - from_begin)) % MOD;
	}
	
	public static long dfs(int offset, char[] ins, long[] memo, long[] hash1, long[] hash2){
		if(memo[offset] >= 0){
			return memo[offset];
		}
		
		long ret = 1;
		
		LOOP:
		for(int len = 1; ;len++){
			final int fst_begin = offset;
			final int snd_end = ins.length - offset;
			
			final int snd_begin = snd_end - len;
			final int fst_end = fst_begin + len;
			
			if(fst_end > snd_begin){ break; }
			/*
			System.out.println(fst_begin + " " + snd_begin + " " + len);
			System.out.println("[" + fst_begin + ", " + fst_end + "]");
			//*/
			
			/*
			for(int i = 0; i < len; i++){
				final int fst = fst_begin + i;
				final int snd = snd_begin + i;
				
				if(ins[fst] != ins[snd]){ continue LOOP; }
			}
			//*/
			if(len != 1){
				final long fst_hash1 = calc_hash1(hash1, fst_begin, fst_end);
				final long snd_hash1 = calc_hash1(hash1, snd_begin, snd_end);
				
				final long fst_hash2 = calc_hash2(hash2, fst_begin, fst_end);
				final long snd_hash2 = calc_hash2(hash2, snd_begin, snd_end);
				
				
				//System.out.println(fst_hash1 + " " + snd_hash1);
				if(fst_hash1 != snd_hash1){ continue; }
				if(fst_hash2 != snd_hash2){ continue; }
			}else if(ins[fst_begin] != ins[snd_begin]){
				continue;
			}
			
			//System.out.println(offset + " " + fst_begin + " " + snd_begin + " " + len);
			ret += dfs(offset + len, ins, memo, hash1, hash2);
			ret %= MOD;
		}
		
		return memo[offset] = ret;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final char[] ins = sc.next().toCharArray();
		
		long[] memo = new long[ins.length];
		Arrays.fill(memo, -1);
		
		System.out.println(dfs(0, ins, memo, rolling_hash1(ins), rolling_hash2(ins)));
	}
}
0