結果

問題 No.1646 Avoid Palindrome
ユーザー nishi5451nishi5451
提出日時 2021-08-14 15:53:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,186 ms / 3,000 ms
コード長 3,917 bytes
コンパイル時間 4,194 ms
コンパイル使用メモリ 74,896 KB
実行使用メモリ 468,760 KB
最終ジャッジ日時 2023-08-08 10:39:03
合計ジャッジ時間 34,919 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,520 KB
testcase_01 AC 43 ms
49,376 KB
testcase_02 AC 42 ms
49,492 KB
testcase_03 AC 44 ms
47,444 KB
testcase_04 AC 908 ms
368,360 KB
testcase_05 AC 965 ms
364,004 KB
testcase_06 AC 785 ms
366,492 KB
testcase_07 AC 833 ms
367,724 KB
testcase_08 AC 818 ms
367,016 KB
testcase_09 AC 762 ms
365,800 KB
testcase_10 AC 781 ms
367,464 KB
testcase_11 AC 760 ms
367,052 KB
testcase_12 AC 833 ms
368,048 KB
testcase_13 AC 858 ms
368,032 KB
testcase_14 AC 870 ms
367,680 KB
testcase_15 AC 871 ms
367,952 KB
testcase_16 AC 870 ms
367,952 KB
testcase_17 AC 889 ms
369,372 KB
testcase_18 AC 880 ms
368,256 KB
testcase_19 AC 881 ms
367,460 KB
testcase_20 AC 865 ms
367,660 KB
testcase_21 AC 896 ms
367,992 KB
testcase_22 AC 1,036 ms
367,676 KB
testcase_23 AC 928 ms
367,668 KB
testcase_24 AC 1,183 ms
467,832 KB
testcase_25 AC 1,164 ms
468,088 KB
testcase_26 AC 1,132 ms
468,036 KB
testcase_27 AC 1,186 ms
467,860 KB
testcase_28 AC 1,109 ms
468,760 KB
testcase_29 AC 896 ms
465,696 KB
testcase_30 AC 883 ms
465,548 KB
testcase_31 AC 878 ms
465,100 KB
testcase_32 AC 891 ms
465,428 KB
testcase_33 AC 890 ms
466,396 KB
testcase_34 AC 1,108 ms
468,156 KB
testcase_35 AC 41 ms
49,236 KB
testcase_36 AC 41 ms
49,208 KB
testcase_37 AC 41 ms
49,076 KB
testcase_38 AC 41 ms
49,220 KB
testcase_39 AC 41 ms
49,400 KB
testcase_40 AC 41 ms
49,036 KB
testcase_41 AC 42 ms
49,156 KB
testcase_42 AC 41 ms
49,404 KB
testcase_43 AC 897 ms
465,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		// dp[i][j][k] := i文字目までみてi文字目jでi-1文字目がkであるとき
		// a b !(b,a)
		int n = fs.nextInt();
		char[] s = fs.nextChars();
		long[][][] dp = new long[n][27][27];	
		for(int i = 0; i < n; i++){
			if(i == 0){
				if(s[i] == '?'){
					for(int j = 1; j <= 26; j++){
						dp[i][j][0] = 1;
					}
				} else {
					int c = s[i]-'a'+1;
					dp[i][c][0] = 1;
				}
			} else if(i == 1){
				if(s[i] == '?'){
					for(int j = 1; j <= 26; j++){
						for(int k = 1; k <= 26; k++){
							if(j != k){
								dp[i][j][k] += dp[i-1][k][0];
							}
						}
					}
				} else {
					int c = s[i]-'a'+1;
					for(int k = 1; k <= 26; k++){
						if(c != k){
							dp[i][c][k] += dp[i-1][k][0];
						}
					}
				}
			} else {
				if(s[i] == '?'){
					// a??b
					long[] acm = new long[27];
					for(int k = 1; k <= 26; k++){
						for(int l = 1; l <= 26; l++){
							acm[k] += dp[i-1][k][l];
							acm[k] %= MOD2;
						}
					}
					for(int j = 1; j <= 26; j++){
						for(int k = 1; k <= 26; k++){
							if(j != k){
								dp[i][j][k] += acm[k] - dp[i-1][k][j];
								dp[i][j][k] = (dp[i][j][k] + MOD2) % MOD2;
							}
						}
					}
				} else {
					int c = s[i]-'a'+1;
					for(int k = 1; k <= 26; k++){
						for(int l = 1; l <= 26; l++){
							if(c != k && c != l){
								dp[i][c][k] += dp[i-1][k][l];
								dp[i][c][k] %= MOD2;
							}
						}
					}
				}
			}

		}
		long ans = 0;
		for(int j = 0; j <= 26; j++){
			for(int k = 0; k <= 26; k++){
				ans += dp[n-1][j][k];
				ans %= MOD2;
			}
		}
		pw.println(ans);
	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0