Codeforces 106 C Buns【多重背包】
来源:互联网 发布:sqlserver 分组合计 编辑:程序博客网 时间:2024/05/22 10:23
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.
题目大意:有n克面粉,m种填料,可以用c0克面粉做一个价值为d0的物品,接下来m行,每行四个元素,ai,bi,ci,di,表示有这种填料ai克,可以使用这种填料bi克和ci克面粉做一个价值为di的物品,问最大能够获得多少价值。
思路:
1、多重背包,设定n克面粉为背包容量,设定物品价值为背包价值。
2、剩下的就是裸的多重背包问题。
3、没尝试多重背包转0-1背包会不会超时,不过看起来应该不会超时。
Ac代码:
#include<stdio.h>#include<string.h>#include<iostream>using namespace std;int dp[1000000];int v;void zoreonepack(int val,int cost){ for(int i=v;i>=cost;i--) { if(dp[i-cost]+val>dp[i]) { dp[i]=dp[i-cost]+val; } }}void completepack(int val,int cost){ for(int i=cost;i<=v;i++) { dp[i]=max(dp[i],dp[i-cost]+val); }}void multipack(int val,int cost,int num){ if(num*cost>=v) { completepack(val,cost); } else { int k=1; while(k<num) { zoreonepack(k*val,k*cost); num-=k;k+=k; } zoreonepack(num*val,num*cost); }}int main(){ int n,m,c0,d0; while(~scanf("%d%d%d%d",&n,&m,&c0,&d0)) { v=n; memset(dp,0,sizeof(dp)); multipack(d0,c0,n/c0); for(int i=0;i<m;i++) { int ai,bi,ci,di; scanf("%d%d%d%d",&ai,&bi,&ci,&di); multipack(di,ci,ai/bi); } printf("%d\n",dp[v]); }}*/
- Codeforces 106 C Buns【多重背包】
- codeforces 106C. Buns【多重背包】
- Codeforces 106 C Buns【多重背包】
- CodeForces 106C Buns 多重背包
- CodeForces 106C Buns (多重背包)
- Codeforces 106C Buns 【0-1背包】
- Codeforces--106C--Buns(背包)
- codeforces 106C Buns
- Codeforces 106C Buns
- Codeforces 106C 多重背包
- CodeForces 106C Buns (01beoba)
- CF 106C Buns
- Buns CodeForces
- CF 106C Buns 再解
- Codeforce 106C(多重背包)
- codeforces 148E Porcelain 多重背包
- Codeforces 148E. Porcelain【多重背包】
- Codeforces 577B Modulo Sum 【多重背包】
- spring入门-spring与hibernate整合完成增删改查的操作(封装HibernateTemplate模版类对象)
- Spring jar包介绍
- LeetCode 算法刷题(4)
- WebView---android webview组件如何使用 Webview与js交互
- 转载:solr MoreLikeThis的原理分析
- Codeforces 106 C Buns【多重背包】
- 文件映射
- TCP/IP知识理解(上)
- FastStone Capture 注册码
- iOS App创建桌面快捷方式
- 请输入有效值,两个最接近的有效值分别为1和2.
- 前端与后端分离的架构实例(一)
- new date() 在firefox, IE, google Chrone的兼容工作
- request.getParameterMap值[Ljava.lang.String; cannot be cast to java.lang.String错误