結果

問題 No.496 ワープクリスタル (給料日前編)
ユーザー 37zigen37zigen
提出日時 2016-07-16 13:53:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 88 ms / 2,000 ms
コード長 3,769 bytes
コンパイル時間 2,451 ms
コンパイル使用メモリ 79,848 KB
実行使用メモリ 38,172 KB
最終ジャッジ日時 2024-10-15 13:44:44
合計ジャッジ時間 5,091 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
36,840 KB
testcase_01 AC 50 ms
36,840 KB
testcase_02 AC 49 ms
36,572 KB
testcase_03 AC 47 ms
36,616 KB
testcase_04 AC 46 ms
37,108 KB
testcase_05 AC 45 ms
36,792 KB
testcase_06 AC 46 ms
36,576 KB
testcase_07 AC 46 ms
37,160 KB
testcase_08 AC 88 ms
37,616 KB
testcase_09 AC 57 ms
36,784 KB
testcase_10 AC 77 ms
37,788 KB
testcase_11 AC 57 ms
36,924 KB
testcase_12 AC 56 ms
36,980 KB
testcase_13 AC 58 ms
37,632 KB
testcase_14 AC 54 ms
36,792 KB
testcase_15 AC 56 ms
36,920 KB
testcase_16 AC 63 ms
37,440 KB
testcase_17 AC 63 ms
37,376 KB
testcase_18 AC 57 ms
36,748 KB
testcase_19 AC 51 ms
36,708 KB
testcase_20 AC 50 ms
36,724 KB
testcase_21 AC 47 ms
36,892 KB
testcase_22 AC 80 ms
38,172 KB
testcase_23 AC 81 ms
38,080 KB
testcase_24 AC 81 ms
37,616 KB
testcase_25 AC 81 ms
37,616 KB
testcase_26 AC 80 ms
37,876 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 solver() {
		int INF = Integer.MAX_VALUE / 4;
		int gx = ni();
		int gy = ni();
		int n = ni();
		int f = ni();
		int[] x = new int[n];
		int[] y = new int[n];
		int[] c = new int[n];
		for (int i = 0; i < n; i++) {
			x[i] = ni();
			y[i] = ni();
			c[i] = ni();
		}
		int[][] map = new int[101][101];
		for (int i = 0; i <= 100; i++) {
			for (int j = 0; j <= 100; j++) {
				map[i][j] = INF;
			}
		}
		map[0][0] = 0;
		long ans = f * (gx + gy);
		for (int i = 0; i < n; i++) {
			if (c[i] < (x[i] + y[i]) * f) {
				for (int sum = gx + gy; sum >= 0; sum--) {
					for (int xx = gx; xx >= 0; xx--) {
						int yy = sum - gx;
						if (yy < 0 || yy > gy)
							continue;
						if (map[xx][yy] != INF) {
							if (xx + x[i] <= gx && yy + y[i] <= gy) {
								map[xx + x[i]][yy + y[i]] = Math.min(map[xx][yy] + c[i], map[xx + x[i]][yy + y[i]]);
								ans = Math.min(ans, f * (gx + gy - xx - yy - x[i] - y[i]) + map[xx + x[i]][yy + y[i]]);
							}
						}
					}
				}
			} else {
				continue;
			}
		}
		out.println(ans);
	}
	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);

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