結果
問題 | No.1111 コード進行 |
ユーザー | uwi |
提出日時 | 2020-07-10 21:29:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 316 ms / 2,000 ms |
コード長 | 3,653 bytes |
コンパイル時間 | 4,301 ms |
コンパイル使用メモリ | 81,928 KB |
実行使用メモリ | 53,184 KB |
最終ジャッジ日時 | 2024-04-19 15:42:53 |
合計ジャッジ時間 | 9,014 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
37,252 KB |
testcase_01 | AC | 49 ms
37,008 KB |
testcase_02 | AC | 50 ms
36,716 KB |
testcase_03 | AC | 50 ms
37,152 KB |
testcase_04 | AC | 53 ms
37,228 KB |
testcase_05 | AC | 51 ms
39,336 KB |
testcase_06 | AC | 58 ms
42,224 KB |
testcase_07 | AC | 56 ms
41,328 KB |
testcase_08 | AC | 51 ms
38,460 KB |
testcase_09 | AC | 56 ms
39,372 KB |
testcase_10 | AC | 53 ms
41,188 KB |
testcase_11 | AC | 49 ms
38,364 KB |
testcase_12 | AC | 62 ms
42,568 KB |
testcase_13 | AC | 53 ms
40,288 KB |
testcase_14 | AC | 84 ms
42,892 KB |
testcase_15 | AC | 51 ms
37,896 KB |
testcase_16 | AC | 66 ms
42,976 KB |
testcase_17 | AC | 53 ms
41,252 KB |
testcase_18 | AC | 51 ms
38,396 KB |
testcase_19 | AC | 50 ms
37,900 KB |
testcase_20 | AC | 51 ms
39,000 KB |
testcase_21 | AC | 49 ms
37,180 KB |
testcase_22 | AC | 54 ms
42,216 KB |
testcase_23 | AC | 53 ms
39,868 KB |
testcase_24 | AC | 54 ms
40,836 KB |
testcase_25 | AC | 79 ms
43,664 KB |
testcase_26 | AC | 66 ms
42,688 KB |
testcase_27 | AC | 52 ms
38,252 KB |
testcase_28 | AC | 100 ms
52,660 KB |
testcase_29 | AC | 88 ms
43,756 KB |
testcase_30 | AC | 110 ms
51,888 KB |
testcase_31 | AC | 55 ms
42,864 KB |
testcase_32 | AC | 148 ms
43,980 KB |
testcase_33 | AC | 148 ms
48,060 KB |
testcase_34 | AC | 86 ms
49,856 KB |
testcase_35 | AC | 92 ms
46,848 KB |
testcase_36 | AC | 171 ms
52,872 KB |
testcase_37 | AC | 104 ms
43,788 KB |
testcase_38 | AC | 106 ms
43,912 KB |
testcase_39 | AC | 206 ms
52,800 KB |
testcase_40 | AC | 189 ms
51,564 KB |
testcase_41 | AC | 112 ms
52,712 KB |
testcase_42 | AC | 127 ms
44,068 KB |
testcase_43 | AC | 151 ms
45,184 KB |
testcase_44 | AC | 91 ms
43,752 KB |
testcase_45 | AC | 109 ms
47,376 KB |
testcase_46 | AC | 58 ms
38,204 KB |
testcase_47 | AC | 316 ms
53,184 KB |
testcase_48 | AC | 57 ms
38,360 KB |
testcase_49 | AC | 54 ms
38,012 KB |
ソースコード
package contest200710; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(), K = ni(); int[] ps = new int[m]; int[] qs = new int[m]; int[] cs = new int[m]; for(int i = 0;i < m;i++) { ps[i] = ni()-1; qs[i] = ni()-1; cs[i] = ni(); } long[][] dp = new long[K+1][300]; Arrays.fill(dp[0], 1L); int mod = 1000000007; for(int i = 1;i < n;i++) { long[][] ndp = new long[K+1][300]; for(int k = 0;k < m;k++) { for(int j = 0;j+cs[k] <= K;j++) { int nj = j+cs[k]; ndp[nj][qs[k]] += dp[j][ps[k]]; if(ndp[nj][qs[k]] >= mod)ndp[nj][qs[k]] -= mod; } } dp = ndp; } long ans = 0; for(long v : dp[K])ans += v; out.println(ans%mod); } 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 E().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)); } }