結果

問題 No.498 ワープクリスタル (給料日編)
ユーザー uwiuwi
提出日時 2017-03-24 22:40:40
言語 Java21
(openjdk 21)
結果
AC  
実行時間 111 ms / 2,000 ms
コード長 3,995 bytes
コンパイル時間 3,790 ms
コンパイル使用メモリ 80,036 KB
実行使用メモリ 53,060 KB
最終ジャッジ日時 2023-09-20 01:44:07
合計ジャッジ時間 6,983 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
49,380 KB
testcase_01 AC 40 ms
49,328 KB
testcase_02 AC 40 ms
49,484 KB
testcase_03 AC 39 ms
49,280 KB
testcase_04 AC 82 ms
52,004 KB
testcase_05 AC 40 ms
49,292 KB
testcase_06 AC 107 ms
52,104 KB
testcase_07 AC 107 ms
53,060 KB
testcase_08 AC 88 ms
52,400 KB
testcase_09 AC 92 ms
52,312 KB
testcase_10 AC 41 ms
49,336 KB
testcase_11 AC 65 ms
51,504 KB
testcase_12 AC 40 ms
49,172 KB
testcase_13 AC 50 ms
50,208 KB
testcase_14 AC 43 ms
49,320 KB
testcase_15 AC 42 ms
49,356 KB
testcase_16 AC 40 ms
49,448 KB
testcase_17 AC 40 ms
49,384 KB
testcase_18 AC 111 ms
50,380 KB
testcase_19 AC 111 ms
52,408 KB
testcase_20 AC 106 ms
52,712 KB
testcase_21 AC 109 ms
52,384 KB
testcase_22 AC 101 ms
52,312 KB
testcase_23 AC 89 ms
52,264 KB
testcase_24 AC 105 ms
52,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170324;
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 gx = ni(), gy = ni(), K = ni();
		int[][] cs = new int[K][];
		for(int i = 0;i < K;i++){
			cs[i] = na(3);
		}
		int[] lims = new int[K];
		for(int i = 0;i < K;i++)lims[i] = cs[i][2]+1;
		int[] b = new int[K];
		
		long[][] C = new long[200 + 1][200 + 1];
		int mod = 1000000007;
		for (int i = 0; i <= 200; i++) {
			C[i][0] = 1;
			for (int j = 1; j <= i; j++) {
				C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
				if (C[i][j] >= mod)
					C[i][j] -= mod;
			}
		}
		long ret = 0;

		do{
			long x = 0, y = 0;
			for(int i = 0;i < K;i++){
				x += cs[i][0] * b[i];
				y += cs[i][1] * b[i];
			}
			if(x == gx && y == gy){
				long num = 1;
				int s = 0;
				for(int i = 0;i < K;i++){
					num = num * C[s+b[i]][b[i]] % mod;
					s += b[i];
				}
				ret += num;
			}
		}while(inc(b, lims));
		out.println(ret%mod);
	}
	
	public static boolean inc(int[] b, int[] a)
	{
		for(int i = b.length-1;i >= 0;i--){
			if(++b[i] < a[i])return true;
			b[i] = 0;
		}
		return false;
	}

	
	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