MUTC 2 A - Hero 状态压缩dp
2013-06-01 16:42
288 查看
HeroTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1869 Accepted Submission(s): 868 Problem Description When playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN. There are two key attributes for the heroes in the game, health point (HP) and damage per shot (DPS). Your hero has almost infinite HP, but only 1 DPS. To simplify the problem, we assume the game is turn-based, but not real-time. In each round, you can choose one enemy hero to attack, and his HP will decrease by 1. While at the same time, all the lived enemy heroes will attack you, and your HP will decrease by the sum of their DPS. If one hero's HP fall equal to (or below) zero, he will die after this round, and cannot attack you in the following rounds. Although your hero is undefeated, you want to choose best strategy to kill all the enemy heroes with minimum HP loss. Input The first line of each test case contains the number of enemy heroes N (1 <= N <= 20). Then N lines followed, each contains two integers DPSi and HPi, which are the DPS and HP for each hero. (1 <= DPSi, HPi <= 1000) Output Output one line for each test, indicates the minimum HP loss. Sample Input 1 10 2 2 100 1 1 100 Sample Output 20 201 Author TJU Source 2012 Multi-University Training Contest 2 Recommend zhuyuanchen520 |
状态压缩dp
f[S]=min(f[S+k]+sum[S+k]*hp[k])
用贪心做的都是异端啊异端!!
---------------
#include <iostream> #include <cstring> #include <cstdio> using namespace std; const int maxn=1<<22; int n; int dps[22],hp[22]; int sum[maxn]; int f[maxn]; int main() { //f[S]=min(f[S+k]+sum[S+k]*hp[k]); while (~scanf("%d",&n)) { memset(f,-1,sizeof(f)); memset(sum,0,sizeof(sum)); //init() for (int i=0;i<n;i++) { scanf("%d%d",&dps[i],&hp[i]); } //prepare() for (int i=0;i<(1<<n);i++) { for (int j=0;j<n;j++) { if (i&(1<<j)) { sum[i]+=dps[j]; } } } //dp f[(1<<n)-1]=0; for (int s=(1<<n)-1;s>=0;s--) { for (int k=0;k<n;k++) { if (!(s&(1<<k))) { if (f[s]==-1||f[s+(1<<k)]+sum[s+(1<<k)]*hp[k]<f[s]) { f[s]=f[s+(1<<k)]+sum[s+(1<<k)]*hp[k]; } } } } printf("%d\n",f[0]); } return 0; }
相关文章推荐
- MUTC 2 A - Hero 状态压缩dp
- HDOJ 4310 - Hero 简单的状态压缩DP
- hdu 4899 Hero meet devil 2014多校联合训练赛 状态压缩dp 最长公共子序列
- hdoj&nbsp;4310&nbsp;Hero&nbsp;(状态压缩DP)
- dp专辑F - Mondriaan's Dream [状态压缩]
- Codevs_P2800 送外卖(状态压缩DP+Floyd)
- (待解决) hdu HDU4539 郑厂长系列故事——排兵布阵 (状态压缩dp~)
- zoj 3471 Most Powerful //状态压缩DP
- ZOJ 2563 Long Dominoes(状态压缩+dp)
- Mega Man's Mission UVA11795(状态压缩dp)
- hdu 4539 郑厂长系列故事——排兵布阵 (状态压缩dp)
- Hdu-1565 方格取数(1) (状态压缩dp入门题
- hdu 4770 13 杭州 现场 A - Lights Against Dudely 暴力 bfs 状态压缩DP 难度:1
- 几道状态压缩DP
- POJ3254 Corn Fields 状态压缩DP
- fzuoj 2218 Simple String Problem(状态压缩dp)
- HDU 1074 Doing Homework (状态压缩 DP)
- 一道状态压缩DP思想题
- hdu3001(三进制状态压缩DP)
- UVA 11795-Mega Man’s Mission(状态压缩DP)