HDU 3177 Crixalis's Equipment 贪心
来源:互联网 发布:皇太子的王子网络剧01 编辑:程序博客网 时间:2024/05/22 21:42
Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3092 Accepted Submission(s): 1255
Problem Description
Crixalis - Sand King used to be a giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, he keeps the living habit of a scorpion like living underground and digging holes.
Someday Crixalis decides to move to another nice place and build a new house for himself (Actually it's just a new hole). As he collected a lot of equipment, he needs to dig a hole beside his new house to store them. This hole has a volume of V units, and Crixalis has N equipment, each of them needs Ai units of space. When dragging his equipment into the hole, Crixalis finds that he needs more space to ensure everything is placed well. Actually, the ith equipment needs Bi units of space during the moving. More precisely Crixalis can not move equipment into the hole unless there are Bi units of space left. After it moved in, the volume of the hole will decrease by Ai. Crixalis wonders if he can move all his equipment into the new hole and he turns to you for help.
Someday Crixalis decides to move to another nice place and build a new house for himself (Actually it's just a new hole). As he collected a lot of equipment, he needs to dig a hole beside his new house to store them. This hole has a volume of V units, and Crixalis has N equipment, each of them needs Ai units of space. When dragging his equipment into the hole, Crixalis finds that he needs more space to ensure everything is placed well. Actually, the ith equipment needs Bi units of space during the moving. More precisely Crixalis can not move equipment into the hole unless there are Bi units of space left. After it moved in, the volume of the hole will decrease by Ai. Crixalis wonders if he can move all his equipment into the new hole and he turns to you for help.
Input
The first line contains an integer T, indicating the number of test cases. Then follows T cases, each one contains N + 1 lines. The first line contains 2 integers: V, volume of a hole and N, number of equipment respectively. The next N lines contain N pairs of integers: Ai and Bi.
0<T<= 10, 0<V<10000, 0<N<1000, 0 <Ai< V, Ai <= Bi < 1000.
0<T<= 10, 0<V<10000, 0<N<1000, 0 <Ai< V, Ai <= Bi < 1000.
Output
For each case output "Yes" if Crixalis can move all his equipment into the new hole or else output "No".
Sample Input
220 310 203 101 710 21 102 11Sample Output
YesNo题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3177
题意:判断 n 件物品是否可以搬进洞里,每件物品有实际体积 v1 和 移动时的额外体积 v2 (V1<=V2);
分析:我们反过来想我把 n 件物品全搬进洞,需要洞的最少体积是多少?
假设有两件物品 a(4,5)、b(6,8)
先搬 a 再搬 b 则需的体积是 max(5,4+8)=12 ,
反过来就是先搬b再a: max(8,6+5)=11
也就是说假设两件物品时a(x1,y1)、b(x2,y2);答案就是 min (max(y1 , x1+y2) , max(y2 , x2+y1))
到这里就很自然的想比较 x1+y2 与 x2+y1 的大小 假设 x1+y2 > x2+y1 则 y2-x2 > y1-x1 ,(b的差值大)于是只要先搬 b 就得到 x2+y1,
同样如果 x1+y2 <= x2+y1 则 y2-x2 <= y1-x1 则需先搬 a;
于是我们的贪心策略是 先搬差值大的,相等就随意!!
/*Crixalis's Equipment 给定一个最大空间和N个数量体积要求放入N个 每个都有实际占有的空间 以及放入最少需要占有的时间*/#include<iostream>#include<algorithm>using namespace std;struct volume{ int vol; int leastvol;};bool cmp(volume a,volume b){ return a.leastvol-a.vol>b.leastvol-b.vol;}int main(){ volume a[1001]; int m,n,i,v; scanf("%d",&m); while(m--) { scanf("%d%d",&v,&n); for(i=0;i<n;i++) scanf("%d%d",&a[i].vol,&a[i].leastvol); sort(a,a+n,cmp); for(i=0;i<n;i++) { if(v>=a[i].leastvol) { v-=a[i].vol; } else { v=-1; break; } } if(v>=0) printf("Yes\n"); else printf("No\n"); } return 0;}
0 0
- HDU 3177 Crixalis's Equipment 贪心
- hdu 3177 Crixalis's Equipment(贪心)
- hdu 3177Crixalis's Equipment(贪心)
- HDU 3177 Crixalis's Equipment 贪心
- hdu 3177 Crixalis's Equipment (贪心)
- HDU 3177 Crixalis's Equipment(贪心)
- HDU 3177 Crixalis's Equipment 贪心
- HDU.3177Crixalis's Equipment(贪心)
- HDU Crixalis's Equipment (贪心)
- hdu 3177 - Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- hdu 3177 Crixalis's Equipment
- hdu 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- hdu 3177 Crixalis's Equipment
- HDU 3177 Crixalis's Equipment
- HDU-3177 Crixalis's Equipment
- Java基础回顾_IO流_File简单操作
- 68_leetcode_Symmetric Tree
- 中断处理程序不能使用printf的本质
- PCI/PCI Express体系结构
- perl函数说明(delete)
- HDU 3177 Crixalis's Equipment 贪心
- 如何编写更棒的代码:11个核心要点
- 【Oracle】使用BBED跳过丢失的归档
- smb.conf 中文man页面(2)
- Java序列化以及java序列化的实现
- tcp为什么要三次握手,而不能二次握手?
- ffmpeg 新老接口问题及对照集锦
- 华为2013-04-26上机题目一
- java 区域表 三级检索 if 判断