oj.uz

답안 #312999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312999 2020-10-14T22:49:02 Z anishrajeev Mate (COCI18_mate) Java 11
0 / 100
 2000 ms 60380 KB 
import java.util.*;
import java.io.*;
public class mate {
    public static void main(String[] args) throws IOException{
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        String str = bf.readLine();
        int mod = 1000000007;
        char[] array = new char[str.length()];
        int N = array.length;
        for(int i = 0; i < str.length(); i++)array[i] = str.charAt(i);
        int[] s = new int[N];
        for(int i = 0; i < N; i++)s[i] = array[i]-96;
        int[][][][] dpwindow = new int[2][N+1][27][27];
        dpwindow[1][1][0][s[0]] = 1;
        for(int x = 1; x < N; x++){
            dpwindow[0][1][0][s[x]] = 1;
            for(int length = 1; length <= N; length++){
                for(int i = 0; i <= 26; i++){
                    for(int c = 0; c <= 26; c++){
                        dpwindow[0][length][i][c] = 0;
                        if(c == s[x]){
                            for(int d = 0; d <= 26; d++){
                                /*dp[x][length][i][c] += dp[x-1][length-1][d][i];
                                dp[x][length][i][c] %= mod;*/
                                dpwindow[0][length][i][c] += dpwindow[1][length-1][d][i];
                                dpwindow[0][length][i][c] %= mod;
                            }
                        }
                        dpwindow[0][length][i][c] += dpwindow[1][length][i][c];
                        dpwindow[0][length][i][c] %= mod;
                    }
                }
            }
            dpwindow[1] = dpwindow[0].clone();
            
        }
        int Q = Integer.parseInt(bf.readLine());
        for(int i = 0; i < Q; i++){
            StringTokenizer stk = new StringTokenizer(bf.readLine());
            int num = Integer.parseInt(stk.nextToken());
            String[] XY = stk.nextToken().split("");
            int letter1 = XY[0].charAt(0)-96;
            int letter2 = XY[1].charAt(0)-96;
            pw.println(dpwindow[1][num][letter1][letter2]);
        }
        pw.close();
    }
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 693 ms 52780 KB Output isn't correct
2 Incorrect 577 ms 40616 KB Output isn't correct
3 Incorrect 472 ms 43716 KB Output isn't correct
4 Incorrect 742 ms 55516 KB Output isn't correct
5 Incorrect 1434 ms 59688 KB Output isn't correct
6 Incorrect 1692 ms 60380 KB Output isn't correct
7 Incorrect 1686 ms 59660 KB Output isn't correct
8 Incorrect 1581 ms 58896 KB Output isn't correct
9 Execution timed out 2070 ms 27976 KB Time limit exceeded
10 Execution timed out 2024 ms 29136 KB Time limit exceeded