TOJ 4108 Hearthstone
2015-07-09 18:36
381 查看
Use 0-1 backpack algorithm can solve this problem . But I use DFS.
I misunderstanding the problem's meaning.My algorithm is Wrong.But the test data is so weak that I can pass this problem.
The portal:4108. Hearthstone 4108. Hearthstone
I misunderstanding the problem's meaning.My algorithm is Wrong.But the test data is so weak that I can pass this problem.
The portal:4108. Hearthstone 4108. Hearthstone
#include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> int monsters[20]; int magic[105]; int N,M,A,B,min_sum; void DFS(int depth,int sum){ if(depth>N)return ; if(sum >= B){ if(sum < min_sum){ min_sum = sum; } return ; } DFS(depth+1,sum+monsters[depth]); DFS(depth+1,sum); } void Find_Mincost(int value){ min_sum = 10000000; DFS(0,0); //printf("%d\n",min_sum); } void Deal_with(){ int T; scanf("%d",&T); while(T--){ scanf("%d %d %d %d",&N,&M,&A,&B); int sum_monsters = 0; for(int i=0;i<N;i++){ scanf("%d",monsters+i); sum_monsters += monsters[i]; } int sum_magic = 0; for(int i=0;i<M;i++){ scanf("%d",magic+i); sum_magic += magic[i]; } Find_Mincost(B); if(min_sum == 10000000)min_sum = sum_monsters; int ans = sum_monsters - min_sum + sum_magic; //printf("%d",min_sum); if(ans < A){ puts("wash your face"); } else { puts("wellplay"); } } } int main(void){ freopen("a.in","r",stdin); Deal_with(); return 0; }
相关文章推荐
- eclipse查看jar源码
- dubbo——管理员指南
- push is not a function
- MongoDB数据库导出导入迁移
- tar命令解压时如何去除目录结构及其解压到指定目录
- c++filt看函数名
- 利用IShellExecuteHook接口对程序监控
- Delphi XE5 安卓手机要求
- tomcat部署Web项目
- C++用纯虚函数实现协议委托的例子
- ubuntu下Android4.4源码导入eclipse
- Android中使用Intent进行叶面的跳转
- C#中的异常处理
- Delphi XE5 常用功具与下载
- 三极管9013 9014 跟8050之间有什么区别,
- Armadillo C++ linear algebra library 学习笔记(3)——矩阵的基本操作(2)
- 有人写了编程建议
- const、define与sizeof
- Activity Fragment完整生命周期
- iOS DeepLinkKit使用简介