bzoj3312: [Usaco2013 Nov]No Change
来源:互联网 发布:vb 大漠插件 编辑:程序博客网 时间:2024/06/07 05:33
3312: [Usaco2013 Nov]No Change
Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 4 Solved: 4
[Submit][Status]
Description
Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 <= K <= 16), each with value in the range 1..100,000,000. FJ would like to make a sequence of N purchases (1 <= N <= 100,000), where the ith purchase costs c(i) units of money (1 <= c(i) <= 10,000). As he makes this sequence of purchases, he can periodically stop and pay, with a single coin, for all the purchases made since his last payment (of course, the single coin he uses must be large enough to pay for all of these). Unfortunately, the vendors at the market are completely out of change, so whenever FJ uses a coin that is larger than the amount of money he owes, he sadly receives no changes in return! Please compute the maximum amount of money FJ can end up with after making his N purchases in sequence. Output -1 if it is impossible for FJ to make all of his purchases.
Input
Line 1: Two integers, K and N.
* Lines 2..1+K: Each line contains the amount of money of one of FJ's coins.
* Lines 2+K..1+N+K: These N lines contain the costs of FJ's intended purchases.
Output
* Line 1: The maximum amount of money FJ can end up with, or -1 if FJ cannot complete all of his purchases.
Sample Input
12
15
10
6
3
3
2
3
7
INPUT DETAILS: FJ has 3 coins of values 12, 15, and 10. He must make purchases in sequence of value 6, 3, 3, 2, 3, and 7.
Sample Output
OUTPUT DETAILS: FJ spends his 10-unit coin on the first two purchases, then the 15-unit coin on the remaining purchases. This leaves him with the 12-unit coin.
HINT
Source
Gold
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>int dp[1<<17];int sum[100010];int coin[17];int N,K;using namespace std;int main(){ scanf("%d%d",&K,&N); for (int i=0; i<K; i++) scanf("%d",&coin[i]); for (int i=0; i<N; i++) { int v; scanf("%d",&v); sum[i+1] =sum[i]+v; } int ans=-1; for (int i=0; i<(1<<K); i++) { int best=0; int rem=0; for (int j=0; j<K; j++) { int p=1<<j; if (i&p) { int q= sum[ dp[ i ^ p] ]; int m=upper_bound(sum+1,sum+N+1,q+coin[j])-sum-1; if (m>best) best=m; } else rem+=coin[j]; } dp[i]=best; if (best==N) ans=max(rem,ans); } printf("%d\n",ans);}
- bzoj3312: [Usaco2013 Nov]No Change
- bzoj3312 [Usaco2013 Nov]No Change
- BZOJ3312: [Usaco2013 Nov]No Change
- bzoj3312[Usaco2013 Nov]No Change不找零
- bzoj3312[Usaco2013 Nov]No Change 状压DP
- [bzoj3312][Usaco2013 Nov][DP]No Change不找零
- 3312: [Usaco2013 Nov]No Change 状压DP
- BZOJ 3312 [Usaco2013 Nov]No Change
- [Usaco2013 Nov]Crowded Cows
- [Usaco2013 Nov]Crowded Cows
- 不设找零 No Change (nochange) usaco2013 题解
- bzoj3315: [Usaco2013 Nov]Pogo-Cow
- BZOJ3315 [Usaco2013 Nov]Pogo-Cow
- bzoj3315 [Usaco2013 Nov]Pogo-Cow
- 【bzoj3315】[Usaco2013 Nov]Pogo-Cow
- USACO2013 Nov. Gold T3,一道集合DP
- bzoj 3310: [Usaco2013 Nov]Empty Stalls
- 【BZOJ】3314 [Usaco2013 Nov]Crowded Cows (多种解法)
- 寻找树根到叶子的权值之和为sum的路径 Path Sum
- TI CC2540/2541 Bluetooth Low Energy Software Developer's Guide第一章
- oracle Linux 6.3 安装 oracle11g安装过程详解
- 我的第一篇文章
- 【四圣龙神录的编程教室】第8章、把按键的对应设置一下吧
- bzoj3312: [Usaco2013 Nov]No Change
- 给计算机科学专业大学生的建议--Joel on Software
- 关于oracle的int能存储的最大最小值
- C#中的事件
- poj2388
- SVN备份教程(二)
- error while loading shared libraries| cannot open shared object file
- struts2表单校验
- struts2拦截器