HDU4381:Grid(类01背包)
来源:互联网 发布:淘宝美工岗位 编辑:程序博客网 时间:2024/05/22 01:59
Grid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 903 Accepted Submission(s): 289
Problem Description
There are n boxes in one line numbered 1 to n, at the beginning, all boxes are black. Two kinds of operations are provided to you:
1 ai xi :You can choose any xi black boxes in interval [1,ai], and color them white;
2 ai xi :You can choose any xi black boxes in interval [ai,n], and color them white;
lcq wants to know if she use these operations in optimal strategy, the maximum number of white boxes she can get, and if she get maximum white boxes, the minimum number of operations she should use.
Tips:
1. It is obvious that sometimes you can choose not to use some operations.
2. If the interval of one operation didn’t have enough black boxes, you can’t use this operation.
1 ai xi :You can choose any xi black boxes in interval [1,ai], and color them white;
2 ai xi :You can choose any xi black boxes in interval [ai,n], and color them white;
lcq wants to know if she use these operations in optimal strategy, the maximum number of white boxes she can get, and if she get maximum white boxes, the minimum number of operations she should use.
Tips:
1. It is obvious that sometimes you can choose not to use some operations.
2. If the interval of one operation didn’t have enough black boxes, you can’t use this operation.
Input
The first line contains one integer T, indicating the number of test case.
The first line of each test case contains two integers N (1 <= N <= 1000) and M (1<=M<=1000), indicating that there are N grids and M operations in total. Then M lines followed, each of which contains three integers si(1<=si<=2) , ai and xi (0 <= xi <= N,1<=ai<=N), si indicating the type of this operation, ai and xi indicating that the interval is [1,ai] or [ai,n](depending on si), and you can choose xi black boxes and color them white.
The first line of each test case contains two integers N (1 <= N <= 1000) and M (1<=M<=1000), indicating that there are N grids and M operations in total. Then M lines followed, each of which contains three integers si(1<=si<=2) , ai and xi (0 <= xi <= N,1<=ai<=N), si indicating the type of this operation, ai and xi indicating that the interval is [1,ai] or [ai,n](depending on si), and you can choose xi black boxes and color them white.
Output
For each test case, output case number first. Then output two integers, the first one is the maximum boxes she can get, the second one is the minimum operations she should use.
Sample Input
15 22 3 31 3 3
Sample Output
Case 1: 3 1
Author
WHU
Source
2012 Multi-University Training Contest 9
题意:略。
思路:背包问题,两边分别处理,dp[i]表示变白前i个格的最小次数,显然有dp[i] = min(dp[i], dp[i-c[k].a]+1),i∈[c[k].a, c[k].x],左右都是这个方程,注意需要先排序,从小的开始计算,最后枚举下结果就行。
# include <stdio.h># include <string.h># define INF 0x3f3f3f3f# include <algorithm>using namespace std;struct node{ int x, a;}l[1001], r[1001];bool cmp(node a, node b) {return a.x < b.x;}int dpr[1001], dpl[1001];int main(){ int t, n, m, x, a, s, cas = 1; scanf("%d",&t); while(t--) { int cntl = 0, cntr = 0; scanf("%d%d",&n,&m); for(int i=0; i<m; ++i) { scanf("%d%d%d",&s,&x,&a); if(s==1) { l[cntl].x = x; l[cntl++].a = a; } else { r[cntr].x = n+1-x; r[cntr++].a = a; } } sort(l, l+cntl, cmp); sort(r, r+cntr, cmp); for(int i=1; i<=n; ++i) dpl[i] = dpr[i] = INF; dpl[0] = dpr[0] = 0; for(int i=0; i<cntr; ++i)//涂左边 for(int j=r[i].x; j>=r[i].a; --j) dpr[j] = min(dpr[j], dpr[j-r[i].a]+1); for(int i=0; i<cntl; ++i)//涂右边 for(int j=l[i].x; j>=l[i].a; --j) dpl[j] = min(dpl[j], dpl[j-l[i].a]+1); int imax=-INF, imin=INF; for(int i=0; i<=n; ++i)//枚举结果 { for(int j=n-i; j>=0; --j) { if(dpl[i]!=INF && dpr[j]!=INF) { if(i+j > imax) { imax = i+j; imin = dpl[i] + dpr[j]; } else if(i+j==imax) imin = min(imin, dpl[i]+dpr[j]); break; } } } printf("Case %d: %d %d\n",cas++, imax, imin); } return 0;}
0 0
- HDU4381:Grid(类01背包)
- hdu 4381 Grid(背包 + 思维)
- hdu4381(排序+dp)
- 背包问题(01背包,完全背包,多重背包)
- 背包问题(01背包,完全背包,多重背包)
- 背包(01背包、完全背包、多重背包)问题总结
- 背包模板(01背包,完全背包,多重背包)
- 背包问题(01背包,完全背包,多重背包)
- 背包问题(01背包 + 完全背包 + 多重背包)
- 背包问题(01背包,完全背包,多重背包)
- 背包问题模板(01背包,完全背包,多重背包)
- 经典背包问题----(01背包、完全背包、多重背包)
- Bottles(类01背包)
- HDU 4381 Grid【0-1背包】
- DP总结(1) 01背包 完全背包 多重背包
- 背包问题(01背包和完全背包)
- 01背包模板、完全背包 and 多重背包(模板)
- 动态规划总结(01背包 完全背包 多重背包)
- Unity 动态加载Animator Event 事件
- 设计模式之单例
- 自定义RPC框架思路整理
- mysql学习笔记(五)索引、视图,导入和导出,备份和恢复
- dell 笔记本 n卡 deepin驱动
- HDU4381:Grid(类01背包)
- 九度OJ-1074-对称平方数
- ArrayList、Vector、HashMap、HashSet的默认初始容量、加载因子、扩容增量
- C语言产生随机数
- Codeforces Round #345 (Div. 2) C
- BZOJ1026: [SCOI2009]windy数(数位dp)
- 讲一讲WiFi快连、SmartConfig、SmartConnect
- $(document)与$(window)的区别
- ARM:嵌入式系统介绍、开发板环境设置、tftp实现文件下载、SecureCRT工具烧写