結果

問題 No.1111 コード進行
ユーザー uwiuwi
提出日時 2020-07-10 21:29:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 362 ms / 2,000 ms
コード長 3,653 bytes
コンパイル時間 4,681 ms
コンパイル使用メモリ 83,960 KB
実行使用メモリ 52,680 KB
最終ジャッジ日時 2024-10-11 07:50:41
合計ジャッジ時間 10,216 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,884 KB
testcase_01 AC 52 ms
36,508 KB
testcase_02 AC 53 ms
36,504 KB
testcase_03 AC 54 ms
36,628 KB
testcase_04 AC 51 ms
37,036 KB
testcase_05 AC 55 ms
38,528 KB
testcase_06 AC 62 ms
41,588 KB
testcase_07 AC 62 ms
41,336 KB
testcase_08 AC 54 ms
38,112 KB
testcase_09 AC 58 ms
39,456 KB
testcase_10 AC 59 ms
41,296 KB
testcase_11 AC 54 ms
37,800 KB
testcase_12 AC 71 ms
41,728 KB
testcase_13 AC 56 ms
40,108 KB
testcase_14 AC 91 ms
42,884 KB
testcase_15 AC 55 ms
37,356 KB
testcase_16 AC 70 ms
41,932 KB
testcase_17 AC 58 ms
41,328 KB
testcase_18 AC 53 ms
37,884 KB
testcase_19 AC 53 ms
37,400 KB
testcase_20 AC 55 ms
39,056 KB
testcase_21 AC 53 ms
37,028 KB
testcase_22 AC 62 ms
42,496 KB
testcase_23 AC 56 ms
39,420 KB
testcase_24 AC 58 ms
40,488 KB
testcase_25 AC 87 ms
43,164 KB
testcase_26 AC 85 ms
42,464 KB
testcase_27 AC 56 ms
37,504 KB
testcase_28 AC 111 ms
52,616 KB
testcase_29 AC 101 ms
42,596 KB
testcase_30 AC 131 ms
51,528 KB
testcase_31 AC 63 ms
42,056 KB
testcase_32 AC 148 ms
43,640 KB
testcase_33 AC 185 ms
47,608 KB
testcase_34 AC 99 ms
48,944 KB
testcase_35 AC 112 ms
46,308 KB
testcase_36 AC 203 ms
52,344 KB
testcase_37 AC 113 ms
43,612 KB
testcase_38 AC 128 ms
43,496 KB
testcase_39 AC 241 ms
52,360 KB
testcase_40 AC 217 ms
51,060 KB
testcase_41 AC 124 ms
52,524 KB
testcase_42 AC 138 ms
43,828 KB
testcase_43 AC 171 ms
44,716 KB
testcase_44 AC 104 ms
43,332 KB
testcase_45 AC 120 ms
46,768 KB
testcase_46 AC 62 ms
37,728 KB
testcase_47 AC 362 ms
52,680 KB
testcase_48 AC 61 ms
37,336 KB
testcase_49 AC 59 ms
37,296 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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