結果

問題 No.1192 半部分列
ユーザー uwiuwi
提出日時 2020-08-22 15:41:43
言語 Java21
(openjdk 21)
結果
AC  
実行時間 218 ms / 2,000 ms
コード長 4,070 bytes
コンパイル時間 4,564 ms
コンパイル使用メモリ 90,784 KB
実行使用メモリ 62,860 KB
最終ジャッジ日時 2024-10-15 09:53:00
合計ジャッジ時間 8,929 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,616 KB
testcase_01 AC 46 ms
36,728 KB
testcase_02 AC 48 ms
36,720 KB
testcase_03 AC 48 ms
36,528 KB
testcase_04 AC 47 ms
36,568 KB
testcase_05 AC 48 ms
36,504 KB
testcase_06 AC 218 ms
62,216 KB
testcase_07 AC 180 ms
62,860 KB
testcase_08 AC 174 ms
62,232 KB
testcase_09 AC 183 ms
62,676 KB
testcase_10 AC 49 ms
36,824 KB
testcase_11 AC 48 ms
36,888 KB
testcase_12 AC 168 ms
61,928 KB
testcase_13 AC 140 ms
49,444 KB
testcase_14 AC 138 ms
53,668 KB
testcase_15 AC 164 ms
53,844 KB
testcase_16 AC 125 ms
49,616 KB
testcase_17 AC 144 ms
53,756 KB
testcase_18 AC 49 ms
37,068 KB
testcase_19 AC 98 ms
45,284 KB
testcase_20 AC 49 ms
36,616 KB
testcase_21 AC 110 ms
52,624 KB
testcase_22 AC 51 ms
37,012 KB
testcase_23 AC 182 ms
62,056 KB
testcase_24 AC 99 ms
45,040 KB
testcase_25 AC 103 ms
49,232 KB
testcase_26 AC 104 ms
48,940 KB
testcase_27 AC 111 ms
49,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package gioku2020day1;
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 K {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		char[] t = ns().toCharArray();
		int n = s.length;
		int[] reach = new int[n];
		int p = t.length-1;
		for(int i = n-1;i >= 0;i--){
			while(p >= 0 && t[p] != s[i])p--;
			reach[i] = p + 1;
			if(p >= 0)p--;
		}
		int[][] ns = makeFatNext(s, 'a', 'z');
		int[][] nt = makeFatNext(t, 'a', 'z');
		
		int l = 0, r = 0;
		StringBuilder sb = new StringBuilder();
		outer:
		while(r < t.length+1){
			for(int i = 0;i < 26;i++){
				int spos = ns[i][l]-1;
				int tpos = nt[i][r]-1;
				if(spos >= n)continue;
				if(tpos < reach[spos])continue;
				sb.append((char)('a'+i));
				l = spos + 1;
				r = tpos + 1;
				continue outer;
			}
			out.println(-1);
			return;
		}
		out.println(sb);
	}
	
	public static int[][] makeFatNext(char[] s, char inf, char sup)
	{
		int n = s.length;
		int[][] next = new int[sup-inf+1][n+1];
		for(int i = 0;i < sup-inf+1;i++)next[i][n] = n+1;
		for(int i = s.length-1;i >= 0;i--){
			for(int j = 0;j < sup-inf+1;j++)next[j][i] = next[j][i+1];
			next[s[i]-inf][i] = i+1;
		}
		return next;
	}

	
	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 K().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)); }
}
0