結果

問題 No.498 ワープクリスタル (給料日編)
ユーザー 37zigen37zigen
提出日時 2016-07-13 10:33:11
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,098 bytes
コンパイル時間 2,359 ms
コンパイル使用メモリ 79,236 KB
実行使用メモリ 188,908 KB
最終ジャッジ日時 2024-04-23 19:01:27
合計ジャッジ時間 16,244 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 113 ms
185,536 KB
testcase_01 AC 114 ms
183,860 KB
testcase_02 AC 113 ms
183,804 KB
testcase_03 AC 112 ms
183,896 KB
testcase_04 AC 963 ms
185,768 KB
testcase_05 AC 114 ms
183,828 KB
testcase_06 AC 937 ms
185,788 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 935 ms
186,092 KB
testcase_10 AC 113 ms
183,984 KB
testcase_11 AC 284 ms
185,860 KB
testcase_12 AC 112 ms
183,492 KB
testcase_13 AC 178 ms
185,792 KB
testcase_14 AC 112 ms
183,648 KB
testcase_15 AC 134 ms
185,616 KB
testcase_16 AC 113 ms
183,872 KB
testcase_17 AC 138 ms
185,512 KB
testcase_18 AC 916 ms
185,824 KB
testcase_19 AC 937 ms
185,876 KB
testcase_20 AC 923 ms
186,100 KB
testcase_21 AC 927 ms
185,776 KB
testcase_22 AC 908 ms
185,880 KB
testcase_23 AC 921 ms
185,548 KB
testcase_24 AC 942 ms
185,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
public class Main {


	static void sample() {
		System.out.println(1 + " " + 1 + " " + 5);
		for (int i = 0; i < 5; i++) {
			System.out.println(1 + " " + 1 + " " + 15);
		}
	}

	static long MOD = 1_000_000_000 + 7;

	static void solver() {
		long gx = nl();
		long gy = nl();
		int k = ni();// the number of crystals

		long[] x = new long[k];
		long[] y = new long[k];
		long[] n = new long[k];
		for (int i = 0; i < k; i++) {
			x[i] = nl();
			y[i] = nl();
			n[i] = ni();
		}

		memo = new long[16777233];
		Arrays.fill(memo, -1);
		long ans = dp(0, 0, x, y, n, gx, gy);
		out.println(ans);

	}

	static long[] memo;

	static long dp(long curx, long cury, long[] x, long[] y, long[] n, long gx, long gy) {
		int idx = 0;
		for (int i = 0; i < n.length; i++) {
			idx += Math.pow(16, i) * n[i];
		}
		if (idx == 0)
			return 0;
		if (memo[idx] != -1) {
			return memo[idx];
		} else {
			long sum = 0;
			for (int i = 0; i < n.length; i++) {
				if (n[i] > 0) {
					long[] d = Arrays.copyOf(n, n.length);
					d[i]--;
					long nx = curx + x[i];
					long ny = cury + y[i];
					if (gx == nx && gy == ny) {
						sum += 1;

					}
					sum += dp(nx, ny, x, y, d, gx, gy);
					sum %= MOD;
				}
			}
			memo[idx] = sum % MOD;
			return sum;
		}
	}
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";


	public static void main(String[] args) throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		long cur=System.currentTimeMillis();
		solver();
		out.flush();
		
	}

	static long nl()
	{
		try {
			long num = 0;
			boolean minus = false;
			while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));
			if(num == '-'){
				num = 0;
				minus = true;
			}else{
				num -= '0';
			}

			while(true){
				int b = is.read();
				if(b >= '0' && b <= '9'){
					num = num * 10 + (b - '0');
				}else{
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static char nc()
	{
		try {
			int b = skip();
			if(b == -1)return 0;
			return (char)b;
		} catch (IOException e) {
		}
		return 0;
	}

	static double nd()
	{
		try {
			return Double.parseDouble(ns());
		}catch(Exception e) {
		}
		return 0;
	}

	static String ns()
	{
		try{
			int b = skip();
			StringBuilder sb = new StringBuilder();
			if(b == -1)return "";
			sb.append((char)b);
			while(true){
				b = is.read();
				if(b == -1)return sb.toString();
				if(b <= ' ')return sb.toString();
				sb.append((char)b);
			}
		} catch (IOException e) {
		}
		return "";
	}

	public static char[] ns(int n)
	{
		char[] buf = new char[n];
		try{
			int b = skip(), p = 0;
			if(b == -1)return null;
			buf[p++] = (char)b;
			while(p < n){
				b = is.read();
				if(b == -1 || b <= ' ')break;
				buf[p++] = (char)b;
			}
			return Arrays.copyOf(buf, p);
		} catch (IOException e) {
		}
		return null;
	}

	public static byte[] nse(int n)
	{
		byte[] buf = new byte[n];
		try{
			int b = skip();
			if(b == -1)return null;
			is.read(buf);
			return buf;
		} catch (IOException e) {
		}
		return null;
	}

	static int skip() throws IOException
	{
		int b;
		while((b = is.read()) != -1 && !(b >= 33 && b <= 126));
		return b;
	}

	static boolean eof()
	{
		try {
			is.mark(1000);
			int b = skip();
			is.reset();
			return b == -1;
		} catch (IOException e) {
			return true;
		}
	}

	static int ni()
	{
		try {
			int num = 0;
			boolean minus = false;
			while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));
			if(num == '-'){
				num = 0;
				minus = true;
			}else{
				num -= '0';
			}

			while(true){
				int b = is.read();
				if(b >= '0' && b <= '9'){
					num = num * 10 + (b - '0');
				}else{
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

}
0