POJ 1742 coins(背包+二进制优化+bitset)
来源:互联网 发布:流星网络电视安卓版vt 编辑:程序博客网 时间:2024/05/16 06:59
coins
Time Limit: 3000MSMemory Limit: 30000KTotal Submissions: 39107Accepted: 13266
Description
People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn’t know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.
You are to write a program which reads n,m,A1,A2,A3…An and C1,C2,C3…Cn corresponding to the number of Tony’s coins of value A1,A2,A3…An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3…An,C1,C2,C3…Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0
Sample Output
8
4
Source
LouTiancheng@POJ
[Submit]
[Go Back] [Status]
[Discuss]
题意
给你n,m,表示有n种硬币,接下来2n个数,前n个数表示n个硬币的价格,后n个数表示每种硬币各有几个。求这n种硬币能组成1~m中多少个价格。
思路
这题显然是个多重背包,但是很显然,直接多重背包肯定会T,所以我们可以用bitset+二进制优化来优化它。二进制优化就是将硬币的个数cnt分成
cnt=20+21+22...+rest ,rest就是剩下的不满二的次方的那部分。因为这样可以将1~cnt的所有方法给组出来。还可以加快速度。对于目前的price,显然如果价格x可以被组出来的话,当且仅当x-price可以被组出来。所以我们可以用bitset的÷32的特性来进行常数优化。
Code
#pragma GCC optimize(3)#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<cctype>#include<climits>#include<cstdlib>#include<cmath>#include<queue>#include<stack>#include<climits>#include<vector>#include<bitset>using namespace std;typedef long long ll;inline void readInt(int &x) { x=0;int f=1;char ch=getchar(); while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();} while(isdigit(ch))x=x*10+ch-'0',ch=getchar(); x*=f;}inline void readLong(ll &x) { x=0;int f=1;char ch=getchar(); while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();} while(isdigit(ch))x=x*10+ch-'0',ch=getchar(); x*=f;}/*================Header Template==============*/bitset<100010> get;int n,m,a[105],c;inline void solve(int x){get|=get<<x;}int main() { while(1) { get.reset(); readInt(n); readInt(m); if(!n&&!m) break; get[0]=1; for(int i=1;i<=n;i++) readInt(a[i]); for(int i=1;i<=n;i++) { readInt(c); for(int p=1;p<c;p<<=1) { solve(a[i]*p); c-=p; } solve(a[i]*c); } int ans=0; for(int i=1;i<=m;i++) if(get[i]) ans++; printf("%d\n",ans); } return 0;}
阅读全文
0 0
- POJ 1742 coins(背包+二进制优化+bitset)
- poj-1742 Coins(多重背包优化)
- POJ-1742:Coins(多重背包二进制求法)
- Coins(多重背包+二进制优化)
- hdu2844 Coins(多重背包+二进制优化)
- (优化的有限背包) poj 1742 Coins(转载)
- poj 1742coins(优化的多重背包)
- POJ 1742 Coins 多重背包(单调队列优化)
- (优化的有限背包) poj 1742 Coins
- poj 1742 Coins dp 多重背包 优化
- POJ 1742 Coins (背包)
- poj 1742 Coins (背包)
- POJ 1742 Coins (背包)
- poj Coins (bitset做法)
- hdu 2844 Coins(多重背包+二进制优化)
- HDU 2844 Coins (多重背包+二进制优化模板)
- hdu 2844 Coins(dp 多重背包 二进制优化)
- HDU 2844 Coins (二进制优化多重背包)
- HBase伪分布式安装和 hbase shell简单命令使用
- MFC单文框的框架颜色的修改
- 浅谈初次做外包项目及背后的思考
- java实现微信小程序支付
- Codevs 2370 小机房的树
- POJ 1742 coins(背包+二进制优化+bitset)
- 深入理解Java异常处理机制
- Session的机制
- JavaScript的变量和作用域
- HTML之旋转
- 无废话ExtJs 入门教程六[按钮:Button]
- 深入浅出UML类图
- block,inline和inline-block概念和区别
- 基于CentOS搭建搭建FTP文件服务