hdu 3946
来源:互联网 发布:手机兼职淘宝刷好评 编辑:程序博客网 时间:2024/06/05 04:55
Philosophy Girl’s Trail
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 719 Accepted Submission(s): 208
Problem Description
Philosophy Girl Krolia was always on the go. No one could figure out where she was. It’s said that she traveled all over the world with only two kinds of items:books and staffs.
Krolia had a knapsack which is composed of n*m grids, and every item can be fit into grids. All the books’ size is 1*2(2*1), and the staffs’ is 1*3(3*1) and each of them can be rotated 90, 180 or 270 degrees. Every item is assigned a value and Krolia wanted to go with the maximal value.
Krolia had a knapsack which is composed of n*m grids, and every item can be fit into grids. All the books’ size is 1*2(2*1), and the staffs’ is 1*3(3*1) and each of them can be rotated 90, 180 or 270 degrees. Every item is assigned a value and Krolia wanted to go with the maximal value.
Input
The first line comes with one integer T (T=100) which denotes the test cases.
In the first line of each case, there is four integers n (1<=n<=500), m (1<=m<=500), n1 (1<=n1<=10000) and n2 (1<=n2<=10000) which indicates the size of the knapsack, the number of the optional books and staffs.
The next line contains n1 integers which indicate the value bi (0<=bi<=1000) of every book.
The last line contains n2 integers si (0<=si<=1000) which indicate the value of every staff.
In the first line of each case, there is four integers n (1<=n<=500), m (1<=m<=500), n1 (1<=n1<=10000) and n2 (1<=n2<=10000) which indicates the size of the knapsack, the number of the optional books and staffs.
The next line contains n1 integers which indicate the value bi (0<=bi<=1000) of every book.
The last line contains n2 integers si (0<=si<=1000) which indicate the value of every staff.
Output
For each test case, output one line.
First, output "Case #C: ", where C is the number of test case, from 1 to T. Then output the maximal value.
First, output "Case #C: ", where C is the number of test case, from 1 to T. Then output the maximal value.
Sample Input
22 3 2 21 21 24 4 4 41 1 2 210 10 10 10
Sample Output
Case #1: 4Case #2: 44Hintn,m,n1 and n2 <=100 in 20 cases.50<=n,m<=500 and 1000<=n1,n2<=2000 in 50 cases.100<=n,m<=200 and 9000<=n1,n2<=10000 in 30 cases.
Author
哲学少女系列@Krolia Fans Club
Source
2011 Multi-University Training Contest 11 - Host by UESTC
贪心证明见:http://acm.hdu.edu.cn/discuss/problem/post/reply.php?postid=4547&messageid=1&deep=0
AC代码:
#include<algorithm>#include<iostream>#include<cstdio>using namespace std;#define maxn 10010int m,n,n1,n2;int mb,ms;int b[maxn],s[maxn];int cmp(int t1,int t2){ return t1>t2;}int main(){ int T; scanf("%d",&T); for(int cas=1;cas<=T;cas++){ scanf("%d%d%d%d",&n,&m,&n1,&n2); s[0]=b[0]=0; for(int i=1;i<=n1;i++) scanf("%d",&b[i]); sort(b+1,b+1+n1,cmp); for(int i=1;i<=n2;i++) scanf("%d",&s[i]); sort(s+1,s+1+n2,cmp); for(int i=1;i<=n1;i++) b[i]+=b[i-1]; for(int i=1;i<=n2;i++) s[i]+=s[i-1]; if(n<=1 && m<=1){ printf("Case #%d: 0\n",cas); } else{ if(n>m) swap(n,m); int ans=0; mb=min(n1,n*m/2); if(n==1) ms=min(n2,n*m/3); else if(n==2 && m%3==2) ms=min(n2,n*m/3-1); else ms=min(n2,n*m/3); int msize=n*m; for(int i=0;i<=ms;i++){ int tmp=0; int j=(msize-i*3)/2; tmp+=s[i]; if(j<=mb) tmp+=b[j]; else tmp+=b[mb]; if(tmp>ans) ans=tmp; } printf("Case #%d: %d\n",cas,ans); } } return 0;}
0 0
- hdu 3946
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU_ACM-2040 亲和数
- Linux netstat命令详解
- tar 压缩与解压缩
- 账户别名杂出事务处理
- easyui iframe方式打开tab的引用文件下载问题
- hdu 3946
- Android AudioFlinger
- 动态规划--背包问题、比值问题转背包问题
- AudioPolicyService 和 AudioPolicyManager
- 二叉搜索树 实现 算法摘记
- 账户别名接收事务处理
- 13、Android之ListView学习·
- 【HBase】HBase笔记:HBase的Region机制
- 环境标号书写