HDU 4381
来源:互联网 发布:打车软件涨价 编辑:程序博客网 时间:2024/09/21 08:16
Grid
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 967 Accepted Submission(s): 325
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
题意:
有n个点,m个操作k,a,x。
k=1:表明可以在[1,a]内把x个点涂白。
k=2:表明可以在[a,n]内把x个点涂白。
不足x个点不能涂。
我们假设涂的都是连续的,这没有什么影响。对两种操作分别进行01背包。按照端点靠前的优先
得到dpl[x],dpr[x],代表涂满前x个点最少的操作次数。
然后遍历答案。
#include <string>#include <string.h>#include <iostream>#include <queue>#include <math.h>#include <stdio.h>#include <algorithm>using namespace std;#define LL long longconst int maxn = 1000+55;const int inf = 0x3f3f3f3f;struct node{int a,x;}l[maxn],r[maxn];int dpl[maxn],dpr[maxn];bool cmd(node a,node b){return a.a<b.a;}int main(){int T,cas=1;for(scanf("%d",&T);T--;cas++){int n,m;scanf("%d %d",&n,&m);int lcnt=0,rcnt=0;for(int i=1;i<=m;i++){int s,a,x;scanf("%d %d %d",&s,&a,&x);if(s==1){l[++lcnt].a=a;l[lcnt].x=x;}else{r[++rcnt].a=n-a+1;r[rcnt].x=x;}}sort(l+1,l+1+lcnt,cmd);sort(r+1,r+1+rcnt,cmd);for(int i=1;i<=n;i++) dpl[i]=dpr[i]=inf;dpl[0]=dpr[0]=0;for(int i=1;i<=lcnt;i++){for(int j=l[i].a;j>=l[i].x;j--){dpl[j]=min(dpl[j],dpl[j-l[i].x]+1);}}for(int i=1;i<=rcnt;i++){for(int j=r[i].a;j>=r[i].x;j--){dpr[j]=min(dpr[j],dpr[j-r[i].x]+1);}}int ansnum=0;int ans=0;for(int i=0;i<=n;i++){for(int j=n-i;j>=0;j--){if(dpl[i]+dpr[j]<inf){if(i+j>ansnum){ansnum=i+j;ans=dpl[i]+dpr[j];break;}else if(i+j==ansnum&&ans>dpl[i]+dpr[j]){ans=dpl[i]+dpr[j];}}}}printf("Case %d: %d %d\n",cas,ansnum,ans);}return 0;}
阅读全文
0 0
- HDU 4381
- hdu 4381 背包
- HDU 4381 Grid
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- Ubuntu 14.04下NFS安装配置
- C++矩阵库 Eigen 快速入门
- 五大基础算法
- composer 使用说明笔记
- NodeJs
- HDU 4381
- 2017-06-17-openfire-spark安装
- PHP 七牛云--图片上传
- 利用业余时间做点事吧!!!有没有志同道合的朋友
- 在 Windows 上安装Rabbit MQ 笔记
- Linux在文件中查找字符串
- vue2.0之vue-router的神坑 router-view不显示
- 说说win32 控制台应用程序、win32 项目、mfc项目、空项目那些事儿
- Redux状态管理1