CodeForces
来源:互联网 发布:如何查看已占用的端口 编辑:程序博客网 时间:2024/06/05 14:25
题目链接:https://vjudge.net/problem/22519/origin点击打开链接
Lavrenty, a baker, is going to make several buns with stuffings and sell them.
Lavrenty has n grams of dough as well as m different stuffing types. The stuffing types are numerated from 1 to m. Lavrenty knows that he has ai grams left of the i-th stuffing. It takes exactly bi grams of stuffing i and ci grams of dough to cook a bun with the i-th stuffing. Such bun can be sold for di tugriks.
Also he can make buns without stuffings. Each of such buns requires c0 grams of dough and it can be sold for d0 tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking.
Find the maximum number of tugriks Lavrenty can earn.
The first line contains 4 integers n, m, c0 and d0 (1 ≤ n ≤ 1000, 1 ≤ m ≤ 10, 1 ≤ c0, d0 ≤ 100). Each of the following m lines contains 4integers. The i-th line contains numbers ai, bi, ci and di (1 ≤ ai, bi, ci, di ≤ 100).
Print the only number — the maximum number of tugriks Lavrenty can earn.
10 2 2 17 3 2 10012 3 1 10
241
100 1 25 5015 5 20 10
200
To get the maximum number of tugriks in the first sample, you need to cook 2 buns with stuffing 1, 4 buns with stuffing 2 and a bun without any stuffing.
In the second sample Lavrenty should cook 4 buns without stuffings.
#include <iostream>#include <algorithm>#include <cstring>#include <vector>#include <stdio.h>#define maxn 2005using namespace std;struct xjy{ int weight; int val;};vector < xjy > s;int main(){ int m; int n; int midweight,midval; scanf("%d%d%d%d",&m,&n,&midweight,&midval); int midm=m/midweight; for(int i=1;i<=midm;i<<=1) { xjy mid; mid.weight=midweight*i; mid.val=midval*i; s.push_back(mid); midm-=i; } if(midm>0) { xjy mid; mid.weight=midweight*midm; mid.val=midval*midm; //cout << "!!" << mid.weight << mid.val << endl; s.push_back(mid); } for(int i=1;i<=n;i++) { int xl; int midxl; scanf("%d%d%d%d",&xl,&midxl,&midweight,&midval); midm=min(m/midweight,xl/midxl); for(int i=1;i<=midm;i<<=1) { xjy mid; mid.weight=midweight*i; mid.val=midval*i; s.push_back(mid); midm-=i; } if(midm>0) { xjy mid; mid.weight=midweight*midm; mid.val=midval*midm; s.push_back(mid); } } int ans=0; int dp[1111]; memset(dp,0,sizeof(dp)); for(int i=0;i<s.size();i++) { //cout << s[i].weight << " " << s[i].val << endl; for(int j=m;j>=s[i].weight;j--) { dp[j]=max(dp[j],dp[j-s[i].weight]+s[i].val); ans=max(ans,dp[j]); } } cout << ans <<endl;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- css清除浮动float总结
- python --- 处理很长的判断语句,多重赋值,联合删除
- Oracle用户和权限
- 二步实现 远程连接 阿里云SqlServer 2012 数据库服务器
- C语言实现的ABCI
- CodeForces
- Struts2-数据验证
- 51Nod 1012 最小公倍数LCM
- 在eclipse中安装jad
- BZOJ-2301-莫比乌斯
- opencv基础之测试质心和圆形度
- console, terminal, tty, pty是啥?
- CodeForces
- python学习笔记