結果
問題 | No.1029 JJOOII 3 |
ユーザー | uwi |
提出日時 | 2020-04-17 21:38:58 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,932 bytes |
コンパイル時間 | 3,903 ms |
コンパイル使用メモリ | 80,380 KB |
実行使用メモリ | 61,584 KB |
最終ジャッジ日時 | 2024-10-03 11:43:17 |
合計ジャッジ時間 | 27,233 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
42,192 KB |
testcase_01 | AC | 48 ms
36,828 KB |
testcase_02 | AC | 48 ms
36,552 KB |
testcase_03 | AC | 258 ms
40,124 KB |
testcase_04 | AC | 638 ms
40,392 KB |
testcase_05 | TLE | - |
testcase_06 | AC | 1,891 ms
40,300 KB |
testcase_07 | TLE | - |
testcase_08 | TLE | - |
testcase_09 | TLE | - |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | AC | 1,514 ms
39,876 KB |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | AC | 1,746 ms
53,704 KB |
testcase_16 | AC | 1,735 ms
56,124 KB |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | AC | 55 ms
50,076 KB |
testcase_20 | AC | 84 ms
51,132 KB |
testcase_21 | AC | 81 ms
51,300 KB |
testcase_22 | AC | 77 ms
50,776 KB |
testcase_23 | AC | 77 ms
50,576 KB |
testcase_24 | AC | 80 ms
51,004 KB |
testcase_25 | AC | 65 ms
50,408 KB |
testcase_26 | AC | 65 ms
50,608 KB |
testcase_27 | AC | 96 ms
51,644 KB |
testcase_28 | AC | 81 ms
51,404 KB |
testcase_29 | AC | 79 ms
50,952 KB |
testcase_30 | AC | 82 ms
51,696 KB |
testcase_31 | AC | 80 ms
51,396 KB |
testcase_32 | TLE | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
ソースコード
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 C { 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; for(int i = 0;i < 3*K;i++){ for(int j = 0;j < n;j++){ int p = i; for(int k = 0;k < ss[j].length && p < 3*K;k++){ if(ss[j][k] == s[p]){ p++; } } 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 C().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)); } }