Description
Alice在餐馆里当服务员,今天是她生日,她请求厨师帮她准备生日晚餐,晚餐由N种原料做成,每道菜所需每种原料的数量是一样的。
厨房里有一些原料,但不够,Alice还需要从旁边的超市中购买一些回来。超市里什么原料都有,每种原料都分大包装和小包装。Alice有M元钱,她想利用这M元钱购买原料使得能做出最多的菜。
Input
第一行包含两个整数N和M(1<=N<=100,1<=M<=100000),接下来N行,每行包含6个正整数,用来描述这种原料的信息,具体如下:
(1) X:10<=X<=100,表示一道菜中必须含有这种原料的数量;
(2) Y:1<=Y<=100,表示这种原料厨房已有的数量;
(3) Sm:1<=Sm<=100,表示超市里小包装中含有这种原料数量;
(4) Pm:10<=Pm<=100,表示小包装的价格;
(5) Sv:1<=Sv<=100,表示超市里大包装中含有这种原料数量;
(6) Pv:10<=Pv<=100,表示大包装的价格。
Output
输出最多能做多少道菜。
Solution
还是不太会做这类题
可以二分答案变成判定性问题,这样每种原料的用量也就知道了。枚举大包的数量可知还需要多少小包,看看够不够钱
Code
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define drp(i, st, ed) for (int i = st; i >= ed; i -= 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define min(x, y) ((x)<(y)?(x):(y))
#define max(x, y) ((x)>(y)?(x):(y))
#define ld long double
#define db double
#define ll long long
#define INF 0x3f3f3f3f
#define N 1001
#define E 1001
#define L 1001
int x[N], y[N], sm[N], pm[N], sv[N], pv[N], n, m;
inline int read() {
int x = 0, v = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; v *= (ch == '-')?(-1):(1), ch = getchar());
for (; ch <= '9' && ch >= '0'; (x *= 10) += ch - '0', ch = getchar());
return x * v;
}
inline int check(int mid) {
int tot = 0;
rep(i, 1, n) {
int S = x[i] * mid - y[i];
int now = INF;
rep(j, 0, S / sm[i] + 2) {
int v1 = j * pm[i];
if (S - sm[i] * j > 0) {
v1 += ((S - sm[i] * j - 1) / sv[i] + 1) * pv[i];
}
now = min(now, v1);
}
tot += now;
}
return tot <= m;
}
int main(void) {
n = read();
m = read();
rep(i, 1, n) {
x[i] = read();
y[i] = read();
sm[i] = read();
pm[i] = read();
sv[i] = read();
pv[i] = read();
}
int l = 0, r = m;
int ans = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid)) {
ans = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
printf("%d\n", ans);
return 0;
}