#374256 (Java21) No.874 正規表現間距離

提出ソース

結果

問題	No.874 正規表現間距離
ユーザー	uwi
提出日時	2019-08-30 23:05:51
言語	Java21 (openjdk 21)
結果	AC
実行時間	118 ms / 2,000 ms
コード長	4,661 bytes
コンパイル時間	5,449 ms
コンパイル使用メモリ	77,252 KB
実行使用メモリ	55,316 KB
最終ジャッジ日時	2023-08-14 07:42:27
合計ジャッジ時間	9,149 ms
ジャッジサーバーID （参考情報）	judge11 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	40 ms 49,256 KB
testcase_01	AC	39 ms 49,208 KB
testcase_02	AC	39 ms 49,340 KB
testcase_03	AC	39 ms 49,204 KB
testcase_04	AC	41 ms 49,388 KB
testcase_05	AC	39 ms 49,400 KB
testcase_06	AC	40 ms 49,764 KB
testcase_07	AC	39 ms 49,392 KB
testcase_08	AC	39 ms 49,364 KB
testcase_09	AC	39 ms 49,396 KB
testcase_10	AC	40 ms 49,648 KB
testcase_11	AC	38 ms 49,152 KB
testcase_12	AC	40 ms 49,384 KB
testcase_13	AC	39 ms 49,332 KB
testcase_14	AC	41 ms 49,656 KB
testcase_15	AC	41 ms 49,288 KB
testcase_16	AC	75 ms 52,540 KB
testcase_17	AC	71 ms 51,996 KB
testcase_18	AC	39 ms 49,392 KB
testcase_19	AC	39 ms 49,360 KB
testcase_20	AC	38 ms 49,668 KB
testcase_21	AC	39 ms 49,184 KB
testcase_22	AC	39 ms 49,304 KB
testcase_23	AC	39 ms 49,472 KB
testcase_24	AC	38 ms 49,284 KB
testcase_25	AC	85 ms 54,296 KB
testcase_26	AC	85 ms 54,712 KB
testcase_27	AC	115 ms 54,364 KB
testcase_28	AC	109 ms 54,932 KB
testcase_29	AC	115 ms 54,328 KB
testcase_30	AC	114 ms 54,168 KB
testcase_31	AC	118 ms 54,960 KB
testcase_32	AC	118 ms 54,924 KB
testcase_33	AC	42 ms 49,464 KB
testcase_34	AC	39 ms 49,464 KB
testcase_35	AC	41 ms 49,396 KB
testcase_36	AC	102 ms 55,316 KB
testcase_37	AC	87 ms 54,784 KB
testcase_38	AC	41 ms 47,772 KB
testcase_39	AC	40 ms 49,268 KB
testcase_40	AC	40 ms 49,352 KB
testcase_41	AC	40 ms 49,420 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest190830;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E4 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		Datum a = new Datum(ns().toCharArray());
		Datum b = new Datum(ns().toCharArray());
		
		int n = a.cs.length, m = b.cs.length;
		int[] dp = new int[m+1];
		for(int i = 0;i <= n;i++) {
			int[] ndp = new int[m+1];
			for(int j = 0;j <= m;j++) {
				if(i == 0 && j == 0)continue;
				int min = 999999999;
				if(i-1 >= 0) {
					min = Math.min(min, dp[j] + (a.con[i-1] == 0 ? 1 : 0));
				}
				if(j-1 >= 0) {
					min = Math.min(min, ndp[j-1] + (b.con[j-1] == 0 ? 1 : 0));
				}
				if(i-1 >= 0 && j-1 >= 0) {
					if(a.con[i-1] == 2) {
						min = Math.min(min, Math.min(dp[j-1], ndp[j-1]) + (b.cs[j-1] != a.cs[i-1] && b.con[j-1] == 0 ? 1 : 0));
					}else if(b.con[j-1] == 2) {
						min = Math.min(min, Math.min(dp[j-1], dp[j]) + (b.cs[j-1] != a.cs[i-1] && a.con[i-1] == 0 ? 1 : 0));
					}else if(a.con[i-1] == 1) {
						min = Math.min(min, dp[j-1] + (a.cs[i-1] != b.cs[j-1] && b.con[j-1] == 0 ? 1 : 0));
					}else if(b.con[j-1] == 1) {
						min = Math.min(min, dp[j-1] + (a.cs[i-1] != b.cs[j-1] && a.con[i-1] == 0 ? 1 : 0));
					}else {
						min = Math.min(min, dp[j-1] + (a.cs[i-1] != b.cs[j-1] ? 1 : 0));
					}
				}
				ndp[j] = min;
			}
			dp = ndp;
		}
		out.println(dp[m]);
	}
	
	static class Datum
	{
		char[] cs;
		int[] con;
		public Datum(char[] s) {
			int n = s.length;
			cs = new char[n];
			con = new int[n];
			int p = 0;
			for(int i = 0;i < n;i++) {
				cs[p] = s[i];
				if(i+1 < n && s[i+1] == '?') {
					con[p] = 1;
					i++;
				}else if(i+1 < n && s[i+1] == '*') {
					con[p] = 2;
					i++;
				}else {
					con[p] = 0;
				}
				p++;
			}
			cs = Arrays.copyOf(cs, p);
			con = Arrays.copyOf(con, p);
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E4().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード