100543: [AtCoder]ABC054 D - Mixing Experiment

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $400$ points

Problem Statement

Dolphin is planning to generate a small amount of a certain chemical substance C.
In order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of $M_a:M_b$.
He does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.
The pharmacy sells $N$ kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.
The package of chemical $i$ contains $a_i$ grams of the substance A and $b_i$ grams of the substance B, and is sold for $c_i$ yen (the currency of Japan).
Dolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.
Find the minimum amount of money required to generate the substance C.
If it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.

Constraints

  • $1≦N≦40$
  • $1≦a_i,b_i≦10$
  • $1≦c_i≦100$
  • $1≦M_a,M_b≦10$
  • $gcd(M_a,M_b)=1$
  • $a_i$, $b_i$, $c_i$, $M_a$ and $M_b$ are integers.

Input

The input is given from Standard Input in the following format:

$N$ $M_a$ $M_b$  
$a_1$ $b_1$ $c_1$  
$a_2$ $b_2$ $c_2$
$:$  
$a_N$ $b_N$ $c_N$  

Output

Print the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.


Sample Input 1

3 1 1
1 2 1
2 1 2
3 3 10

Sample Output 1

3

The amount of money spent will be minimized by purchasing the packages of chemicals $1$ and $2$.
In this case, the mixture of the purchased chemicals will contain $3$ grams of the substance A and $3$ grams of the substance B, which are in the desired ratio: $3:3=1:1$.
The total price of these packages is $3$ yen.


Sample Input 2

1 1 10
10 10 10

Sample Output 2

-1

The ratio $1:10$ of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.

Input

题意翻译

------------ ## 题目描述: 有 $N$ 个物体,第 $i$ 个物体含有 $a_i$ 质量的 A 元素 和 $b_i$ 质量的 B 元素,代价为 $c_i$ 。 问能否取若干个物体,使 A 元素与 B 元素质量之比为 $M_a : M_b$ ,并使代价最小。 ------------ ## 输入格式: 第一行3个整数 $N ,M_a ,M_b$ 下面 $N$ 行,每行3个整数 $a_i ,b_i ,c_i$ $ N $ $ M_a $ $ M_b $ $ a_1 $ $ b_1 $ $ c_1 $ $ a_2 $ $ b_2 $ $ c_2 $ $ : $ $ a_N $ $ b_N $ $ c_N $ ------------ ## 输出格式: 若能满足条件则输出 **最小代价**。 否则输出 -1 ------------ ## 数据范围: - $1\le N\le 40$ - $1\le a_i,b_i\le 10$ - $1\le c_i\le 100$ - $1\le M_a,M_b\le 10$ - $gcd(M_a,M_b)=1$ - 输入都为整数。 ------------ translated by @君のNOIP。

加入题单

算法标签: