Submission #1178221


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int n, ma, mb, a[40], b[40], c[40], dp[41][401][401];

void init() {
	for (int k = 0; k < 41; k++) {
		for (int i = 0; i < 401; i++) {
			for (int j = 0; j < 401; j++) {
				dp[k][i][j] = -1;
			}
		}
	}
	dp[0][0][0] = 0;
}

int main() {
	cin >> n >> ma >> mb;
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i] >> c[i];
	}
	init();
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 401; j++) {
			for (int k = 0; k < 401; k++) {
				if (dp[i][j][k] != -1) {
					if (dp[i + 1][j + a[i]][k + b[i]] == -1 || dp[i + 1][j + a[i]][k + b[i]] > dp[i][j][k] + c[i])
						dp[i + 1][j + a[i]][k + b[i]] = dp[i][j][k] + c[i];
					/*if (dp[i + 1][j][k] == -1 || dp[i+1][j][k] > dp[i][j][k])
						dp[i + 1][j][k] = dp[i][j][k];*/
					if (dp[i][j][k] == 0)dp[i + 1][j][k] = 0;
					else if (dp[i + 1][j][k] == -1)dp[i + 1][j][k] = c[i];
					else dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k]);
				}
			}
		}
	}
	int ans = -1;
	for (int i = 0; i < 401; i++) {
		for (int j = 0; j < 401; j++) {
			if (dp[n][i][j] != -1 && i*ma == j*mb && dp[n][i][j] != 0) {
				//cout << "a:" << i << " b:" << j << " ma:" << ma << " mb:" << mb << endl;
				//cout << "dp[n][i][j]:" << dp[n][i][j] << endl;
				if (ans == -1)ans = dp[n][i][j];
				else ans = min(ans, dp[n][i][j]);
			}
		}
	}

	cout << ans << endl;
}

Submission Info

Submission Time
Task D - Mixing Experiment
User ZxFkcjgN
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1417 Byte
Status WA
Exec Time 16 ms
Memory 25984 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 6
WA × 14
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt
Case Name Status Exec Time Memory
sample_01.txt AC 10 ms 25984 KB
sample_02.txt AC 10 ms 25984 KB
subtask_1_01.txt AC 10 ms 25984 KB
subtask_1_02.txt AC 10 ms 25984 KB
subtask_1_03.txt AC 10 ms 25984 KB
subtask_1_04.txt AC 11 ms 25984 KB
subtask_1_05.txt WA 11 ms 25984 KB
subtask_1_06.txt WA 12 ms 25984 KB
subtask_1_07.txt WA 12 ms 25984 KB
subtask_1_08.txt WA 13 ms 25984 KB
subtask_1_09.txt WA 14 ms 25984 KB
subtask_1_10.txt WA 14 ms 25984 KB
subtask_1_11.txt WA 16 ms 25984 KB
subtask_1_12.txt WA 16 ms 25984 KB
subtask_1_13.txt WA 16 ms 25984 KB
subtask_1_14.txt WA 16 ms 25984 KB
subtask_1_15.txt WA 16 ms 25984 KB
subtask_1_16.txt WA 16 ms 25984 KB
subtask_1_17.txt WA 16 ms 25984 KB
subtask_1_18.txt WA 16 ms 25984 KB