結果
問題 | No.225 文字列変更(medium) |
ユーザー |
|
提出日時 | 2020-03-28 03:47:09 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 182 ms / 5,000 ms |
コード長 | 3,161 bytes |
コンパイル時間 | 2,647 ms |
コンパイル使用メモリ | 81,332 KB |
実行使用メモリ | 59,612 KB |
最終ジャッジ日時 | 2025-01-02 10:36:57 |
合計ジャッジ時間 | 7,041 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
ソースコード
import java.io.FileNotFoundException;import java.io.IOException;import java.io.InputStream;import java.util.Arrays;import java.util.NoSuchElementException;import java.util.Scanner;public class Main {public static void main(String[] args) throws FileNotFoundException {long t = System.currentTimeMillis();new Main().run();System.err.println(System.currentTimeMillis() - t);}void run() {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];int INF=Integer.MAX_VALUE/3;for(int i=0;i<=n;++i)for(int j=0;j<=m;++j)dp[i][j]=INF;dp[0][0]=0;for(int i=0;i<n;++i)dp[i+1][0]=i+1;for(int i=0;i<m;++i)dp[0][i+1]=i+1;for(int i=0;i<n;++i) {for(int j=0;j<m;++j) {if(S[i]==T[j]) dp[i+1][j+1]=dp[i][j];dp[i+1][j+1]=Math.min(dp[i][j+1]+1,dp[i+1][j+1]);// deletedp[i+1][j+1]=Math.min(dp[i][j]+1,dp[i+1][j+1]);// modifydp[i+1][j+1]=Math.min(dp[i+1][j]+1,dp[i+1][j+1]);// insert}}System.out.println(dp[n][m]);}static void tr(Object... objects) {System.out.println(Arrays.deepToString(objects));}}class FastScanner {private final InputStream in = System.in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}public boolean hasNext() { skipUnprintable(); return hasNextByte();}public String next() {if (!hasNext()) throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {return (int)nextLong();}}