Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1350 Accepted Submission(s): 543
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.
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
Output
For each case output "Yes" if Crixalis can move all his equipment into the new hole or else output "No".
Sample Input
2
20 3
10 20
3 10
1 7
10 2
1 10
2 11
Sample Output
Yes
No
Source
HDU3177
这道题采用的是贪心的思路,值得注意的是排序的方法,这道题无论是根据Ai或者Bi来排序得到的结果都是WA,Ai排序就不必说了,如这组测试数据:
20 2
1 1
10 20
先搬占用空间小的,即(1, 1) → (10, 20),结果是No,而正确答案是Yes。
如这组测试数据:
20 2
5 17
1 16
先搬所需空间大的,即(5, 17) → (1, 16),结果是No,而正确答案是Yes。
我们设第一件物品的占用空间和搬运所需空间分别为A1和B1,第二件为A2和B2,则:
先搬第一件物品所需最大临时空间为A1 + B2,先搬第二件物品所需的最大临时空间为A2 + B1,那么很明显应该选择所需最大临时空间较小的方案。
代码如下:
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
struct S{
int a, b;
};
bool cmp(const S &s1, const S &s2){
if(s1.a + s2.b == s2.a + s1.b)
return s1.b < s2.b;
return s1.a + s2.b < s2.a + s1.b;
//return s1.b - s1.a > s2.b - s2.a; 也可
}
int main(){
S s;
vector<S> vec;
int t, v, n, flag;
scanf("%d", &t);
while(t--){
flag = 0;
scanf("%d%d", &v, &n);
while(n--){
scanf("%d%d", &s.a, &s.b);
vec.push_back(s);
}
sort(vec.begin(), vec.end(), cmp);
for(vector<S>::iterator it = vec.begin(); it != vec.end(); ++it){
if(v >= (*it).b && v >= (*it).a){
v -= (*it).a;
}else{
flag = 1;
break;
}
}
if(flag)
printf("No\n");
else
printf("Yes\n");
vec.clear();
}
return 0;
}
=======================签 名 档=======================
原文地址(我的博客):http://www.clanfei.com/2012/07/1560.html
欢迎访问交流,至于我为什么要多弄一个博客,因为我热爱前端,热爱网页,我更希望有一个更加自由、真正属于我自己的小站,或许并不是那么有名气,但至少能够让我为了它而加倍努力。。
=======================签 名 档=======================
分享到:
相关推荐
杭电hdu acm资料所用杭电的acm题
杭电 hdu acm 第1084题的解法,ac过了,是一位学长教我的.内有一些中文说明.
写一个数据结构算法,杭电上一道题目,有关数据结构的题目。
For a positive integer n, let’s denote function f(n,m) as the m-th smallest integer x that x>n and gcd(x,n)=1. For example, f(5,1)=6 and f(5,5)=11. You are given the value of m and (f(n,m)?n)⊕n,...
此程序为hdu的acm2010题,就是解决水仙花数问题
acm经典题、结题报告,对初学者非常用用,我就从中学到了很多东西
ACM比赛解题报告,包括hdu1880、zoj1010、zoj1015,为原创的报告,算法不一定最优的
杭电acm解题报告 详细解析2000-2099 适合acm初学者
杭电acm 一些java语言实现的水题目
杭电的一些acm题目,都是我自己一个一个自己提交的
ACM_算法模板集史上最完整收藏版223页全免费版.pd
ACM_HDU 我的 acm 问题的一部分在 hdoj 中解决了。
HDU_ACM_1002_大数相加C源代码,利用字符串处理
noi试题和解析,对于参加acm非常有帮助
浙江大学ACM题解JU_ACM_All_Anwer,里面一本非常好的chm电子书,浙大的所有ACM题及题解都在了,对学习ACM的朋友非常的好~还等什么呢?
ACM_基础篇
Pascal acm_timus_ural_1148.pas
Pascal acm_timus_ural_1099.pas
ACM__ICPC__重要补充知识.doc
ACM,竞赛题目,我已经在上面测试过了,可以用,题目是ARGUS,希望大家可以喜欢,花了长时间才弄好的