結果

問題 No.1029 JJOOII 3
ユーザー uwiuwi
提出日時 2020-04-17 22:04:57
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,684 bytes
コンパイル時間 4,199 ms
コンパイル使用メモリ 80,760 KB
実行使用メモリ 62,200 KB
最終ジャッジ日時 2024-04-14 14:16:02
合計ジャッジ時間 35,672 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
57,384 KB
testcase_01 AC 53 ms
50,060 KB
testcase_02 AC 53 ms
50,280 KB
testcase_03 RE -
testcase_04 RE -
testcase_05 TLE -
testcase_06 RE -
testcase_07 RE -
testcase_08 TLE -
testcase_09 RE -
testcase_10 RE -
testcase_11 TLE -
testcase_12 RE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 TLE -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200417;
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 C2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		char[][] ss = new char[n][];
		int[] cs = new int[n];
		for(int i = 0;i < n;i++){
			ss[i] = ns().toCharArray();
			cs[i] = ni();
		}
		
		char[] s = new char[3*K];
		for(int i = 0;i < K;i++){
			s[i] = 'J';
			s[i+K] = 'O';
			s[i+2*K] = 'I';
		}			
		long[] dp = new long[3*K+1];
		long I = Long.MAX_VALUE / 2;
		Arrays.fill(dp, Long.MAX_VALUE / 2);
		dp[0] = 0;
		int[] setj = new int[n];
		int[] seto = new int[n];
		int[] seti = new int[n];
		Arrays.fill(setj, -1);
		Arrays.fill(seto, -1);
		Arrays.fill(seti, -1);
		for(int i = 0;i < 3*K;i++){
			for(int j = 0;j < n;j++){
				if(i+ss[j].length < 3*K && s[i] == s[3*K-1]){
					if(s[i] == 'J' && setj[i] != -1){
						dp[i+setj[i]] = Math.min(dp[i+setj[i]], dp[i] + cs[j]);
						continue;
					}
					if(s[i] == 'O' && seto[i] != -1){
						dp[i+seto[i]] = Math.min(dp[i+seto[i]], dp[i] + cs[j]);
						continue;
					}
					if(s[i] == 'I' && seti[i] != -1){
						dp[i+seti[i]] = Math.min(dp[i+seti[i]], dp[i] + cs[j]);
						continue;
					}
				}
				int p = i;
				for(int k = 0;k < ss[j].length && p < 3*K;k++){
					if(ss[j][k] == s[p]){
						p++;
					}
				}
				if(i+ss[j].length < 3*K && s[i] == s[3*K-1]){
					if(s[i] == 'J')setj[i] = p-i;
					if(s[i] == 'O')seto[i] = p-i;
					if(s[i] == 'I')seti[i] = p-i;
				}
				
				dp[p] = Math.min(dp[p], dp[i] + cs[j]);
			}
		}
		long ans = dp[3*K];
		out.println(ans >= I/2 ? -1 : ans);
	}
	
	public static int[] mpTable(char[] str)
	{
		int n = str.length;
		int[] mp = new int[n+1];
		mp[0] = -1;
		for(int i = 1, j = 0;i < n;i++){
			while(j >= 0 && str[i] != str[j])j = mp[j];
			mp[i+1] = ++j;
		}
		return mp;
	}
	
	

	
	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 C2().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