結果

問題 No.422 文字列変更 (Hard)
コンテスト
ユーザー hermione17
提出日時 2016-09-10 00:12:59
言語 Java
(openjdk 23)
結果
MLE  
実行時間 -
コード長 3,720 bytes
コンパイル時間 4,310 ms
コンパイル使用メモリ 77,960 KB
実行使用メモリ 566,692 KB
最終ジャッジ日時 2024-11-17 06:43:54
合計ジャッジ時間 36,459 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 14 WA * 1 MLE * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.OutputStream;
import java.util.Scanner;


public class Y422 {
	Y422() throws IOException {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int m = sc.nextInt();
		char[] S = sc.next().toCharArray();
		char[] T = sc.next().toCharArray();

		int[][][][] dp = new int[n+1][m+1][2][2];
		int[][][][][] from = new int[n+1][m+1][2][2][];

		for (int i = 0; i <= S.length; i++) {
			for (int j = 0; j <= T.length; j++) {
				for (int a = 0; a < 2; a ++) {
					for (int b = 0; b < 2; b ++ ) {
						dp[i][j][a][b] = 100 * (n + m);
					}
				}
			}
		}
		
		dp[0][0][0][0] = 0;
				
		
		for (int i = -1; i < S.length; i++) {
			for (int j = -1; j < T.length; j++) {
				
				int cost;
				if (i >= 0 && j >= 0) {
					int change_cost = 5;
					if (S[i] == T[j]) change_cost = 0;

					cost = change_cost + dp[i][j][0][0];
					{
						int[] tmp = { i, j, 0, 0 };
						dp[i+1][j+1][0][0] = cost;
						from[i+1][j+1][0][0] = tmp;
					}

					cost = change_cost + dp[i][j][0][1];
					if (cost < dp[i+1][j+1][0][0]) {
						int[] tmp = { i, j, 0, 1 };
						dp[i+1][j+1][0][0] = cost;
						from[i+1][j+1][0][0] = tmp;
					}

					cost = change_cost + dp[i][j][1][0];
					if (cost < dp[i+1][j+1][0][0]) {
						int[] tmp = { i, j, 1, 0 };
						dp[i+1][j+1][0][0] = cost;
						from[i+1][j+1][0][0] = tmp;
					}
				}				
				
				if (j >= 0) {
					cost = 9 + dp[i+1][j][0][0];
					{
						int[] tmp = { i+1, j, 0, 0 };
						dp[i+1][j+1][1][0] = cost;
						from[i+1][j+1][1][0] = tmp;
					}

					cost = 2 + dp[i+1][j][1][0];
					if (cost < dp[i+1][j+1][1][0]) {
						int[] tmp = { i+1, j, 1, 0 };
						dp[i+1][j+1][1][0] = cost;
						from[i+1][j+1][1][0] = tmp;
					}

					cost = 9 + dp[i+1][j][0][1];
					if (cost < dp[i+1][j+1][1][0]) {
						int[] tmp = { i+1, j, 0, 1 };
						dp[i+1][j+1][1][0] = cost;
						from[i+1][j+1][1][0] = tmp;
					}
				}
				
				
				if (i >= 0) {
					cost = 9 + dp[i][j+1][0][0];
					{
						int[] tmp = { i, j+1, 0, 0 };
						dp[i+1][j+1][0][1] = cost;
						from[i+1][j+1][0][1] = tmp;
					}

					cost = 9 + dp[i][j+1][1][0];
					if (cost < dp[i+1][j+1][0][1]) {
						int[] tmp = { i, j+1, 1, 0 };
						dp[i+1][j+1][0][1] = cost;
						from[i+1][j+1][0][1] = tmp;
					}

					cost = 2 + dp[i][j+1][0][1];
					if (cost < dp[i+1][j+1][0][1]) {
						int[] tmp = { i, j+1, 0, 1 };
						dp[i+1][j+1][0][1] = cost;
						from[i+1][j+1][0][1] = tmp;
					}
				}
			}
		}
		
		
		int cost = 100 * (n + m);
		int[] state = null;
		for (int a = 0; a < 2; a++) {
			for (int b = 0; b < 2; b++) {
				if (cost > dp[S.length][T.length][a][b]) {
					cost = dp[S.length][T.length][a][b];
					int[] tmp = {S.length, T.length, a, b};
					state = tmp;
				}
			}
		}
		
		
		char[] S_ans = new char[n+m];
		char[] T_ans = new char[n+m];
		int len = 0;
		
		while (state[0] != 0 || state[0] != 0) {
			int[] next = from[state[0]][state[1]][state[2]][state[3]];

			// System.err.println("" + state[0] + " " + state[1] + " " + state[2] + " " + state[3]);
			
			if (state[2] == 1) {
				S_ans[len] = '-';
			} else {
				S_ans[len] = S[state[0]-1];
			}
			if (state[3] == 1) {
				T_ans[len] = '-';
			} else {
				T_ans[len] = T[state[1]-1];
			}
			len++;
			state = next;
		}

		OutputStream os = new BufferedOutputStream(System.out);
		
		os.write(Integer.toString(cost).getBytes());
		os.write('\n');

		for (int i = len - 1; i >= 0; i--) {
			os.write(S_ans[i]);
		}
		os.write('\n');

		for (int i = len - 1; i >= 0; i--) {
			os.write(T_ans[i]);
		}
		os.write('\n');
	
		os.flush();
	}
	public static void main(String argv[]) throws IOException {
		new Y422();
	}
}
0