結果

問題 No.1029 JJOOII 3
ユーザー uwiuwi
提出日時 2020-04-17 22:10:03
言語 Java21
(openjdk 21)
結果
AC  
実行時間 345 ms / 2,000 ms
コード長 5,115 bytes
コンパイル時間 5,454 ms
コンパイル使用メモリ 87,584 KB
実行使用メモリ 55,736 KB
最終ジャッジ日時 2024-04-14 14:22:21
合計ジャッジ時間 12,947 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
49,996 KB
testcase_01 AC 53 ms
50,136 KB
testcase_02 AC 53 ms
50,268 KB
testcase_03 AC 139 ms
52,888 KB
testcase_04 AC 169 ms
55,212 KB
testcase_05 AC 317 ms
55,432 KB
testcase_06 AC 274 ms
55,304 KB
testcase_07 AC 299 ms
55,632 KB
testcase_08 AC 309 ms
55,412 KB
testcase_09 AC 315 ms
55,328 KB
testcase_10 AC 300 ms
55,412 KB
testcase_11 AC 325 ms
55,332 KB
testcase_12 AC 249 ms
53,152 KB
testcase_13 AC 345 ms
55,432 KB
testcase_14 AC 330 ms
55,508 KB
testcase_15 AC 260 ms
55,204 KB
testcase_16 AC 297 ms
55,736 KB
testcase_17 AC 299 ms
55,376 KB
testcase_18 AC 321 ms
55,192 KB
testcase_19 AC 55 ms
50,176 KB
testcase_20 AC 82 ms
51,168 KB
testcase_21 AC 83 ms
51,068 KB
testcase_22 AC 82 ms
51,180 KB
testcase_23 AC 81 ms
50,888 KB
testcase_24 AC 82 ms
51,376 KB
testcase_25 AC 68 ms
50,744 KB
testcase_26 AC 70 ms
51,512 KB
testcase_27 AC 99 ms
52,552 KB
testcase_28 AC 80 ms
51,304 KB
testcase_29 AC 82 ms
51,360 KB
testcase_30 AC 82 ms
51,124 KB
testcase_31 AC 70 ms
51,188 KB
testcase_32 AC 333 ms
55,340 KB
testcase_33 AC 331 ms
55,404 KB
testcase_34 AC 338 ms
55,172 KB
testcase_35 AC 334 ms
55,012 KB
testcase_36 AC 340 ms
55,356 KB
testcase_37 AC 53 ms
50,272 KB
testcase_38 AC 55 ms
50,332 KB
testcase_39 AC 52 ms
50,048 KB
testcase_40 AC 53 ms
50,392 KB
権限があれば一括ダウンロードができます

ソースコード

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[i+ss[j].length-1]){
					if(s[i] == 'J' && setj[j] != -1){
						dp[i+setj[j]] = Math.min(dp[i+setj[j]], dp[i] + cs[j]);
						continue;
					}
					if(s[i] == 'O' && seto[j] != -1){
						dp[i+seto[j]] = Math.min(dp[i+seto[j]], dp[i] + cs[j]);
						continue;
					}
					if(s[i] == 'I' && seti[j] != -1){
						dp[i+seti[j]] = Math.min(dp[i+seti[j]], 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[i+ss[j].length-1]){
					if(s[i] == 'J')setj[j] = p-i;
					if(s[i] == 'O')seto[j] = p-i;
					if(s[i] == 'I')seti[j] = 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
	{
//		int n = 2;
//		Random gen = new Random();
//		int K = gen.nextInt(5)+1;
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(K + "\n");
//		for (int i = 0; i < n; i++) {
//			int len = gen.nextInt(5)+1;
//			for(int j = 0;j < len;j++){
//				sb.append("JOI".charAt(gen.nextInt(3)));
//			}
//			sb.append(" " + (gen.nextInt(5)+1) + "\n");
//		}
//		INPUT = sb.toString();

		
		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