結果

問題 No.1646 Avoid Palindrome
ユーザー nishi5451nishi5451
提出日時 2021-08-14 15:53:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,333 ms / 3,000 ms
コード長 3,917 bytes
コンパイル時間 2,297 ms
コンパイル使用メモリ 78,484 KB
実行使用メモリ 467,108 KB
最終ジャッジ日時 2024-04-26 03:49:19
合計ジャッジ時間 36,073 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,020 KB
testcase_01 AC 53 ms
50,160 KB
testcase_02 AC 52 ms
50,368 KB
testcase_03 AC 53 ms
50,116 KB
testcase_04 AC 878 ms
366,384 KB
testcase_05 AC 786 ms
364,356 KB
testcase_06 AC 825 ms
364,932 KB
testcase_07 AC 891 ms
366,348 KB
testcase_08 AC 823 ms
365,340 KB
testcase_09 AC 794 ms
364,672 KB
testcase_10 AC 843 ms
366,008 KB
testcase_11 AC 815 ms
364,596 KB
testcase_12 AC 887 ms
366,260 KB
testcase_13 AC 928 ms
366,892 KB
testcase_14 AC 945 ms
367,332 KB
testcase_15 AC 930 ms
366,112 KB
testcase_16 AC 946 ms
366,252 KB
testcase_17 AC 1,062 ms
366,264 KB
testcase_18 AC 937 ms
366,184 KB
testcase_19 AC 929 ms
366,056 KB
testcase_20 AC 1,040 ms
368,092 KB
testcase_21 AC 1,028 ms
366,712 KB
testcase_22 AC 944 ms
366,284 KB
testcase_23 AC 1,027 ms
366,640 KB
testcase_24 AC 1,239 ms
467,028 KB
testcase_25 AC 1,205 ms
467,068 KB
testcase_26 AC 1,197 ms
466,924 KB
testcase_27 AC 1,205 ms
467,104 KB
testcase_28 AC 1,333 ms
467,108 KB
testcase_29 AC 968 ms
464,792 KB
testcase_30 AC 936 ms
464,692 KB
testcase_31 AC 951 ms
464,712 KB
testcase_32 AC 935 ms
464,752 KB
testcase_33 AC 969 ms
465,188 KB
testcase_34 AC 1,209 ms
467,024 KB
testcase_35 AC 53 ms
50,220 KB
testcase_36 AC 52 ms
50,308 KB
testcase_37 AC 52 ms
49,936 KB
testcase_38 AC 50 ms
50,268 KB
testcase_39 AC 51 ms
50,368 KB
testcase_40 AC 52 ms
49,928 KB
testcase_41 AC 52 ms
49,956 KB
testcase_42 AC 53 ms
50,336 KB
testcase_43 AC 957 ms
465,184 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