Codeforces Round #260 (Div. 2)A. Laptops
1 second
256 megabytes
standard input
standard output
One day Dima and Alex had an argument about the price and quality of laptops. Dima thinks that the more expensive a laptop is, the better it is. Alex disagrees. Alex thinks that there are two laptops, such that the price of the first laptop is less (strictly
smaller) than the price of the second laptop but the quality of the first laptop is higher (strictly greater) than the quality of the second laptop.
Please, check the guess of Alex. You are given descriptions of
n laptops. Determine whether two described above laptops exist.
The first line contains an integer n (1 ≤ n ≤ 105) — the number of laptops.
Next n lines contain two integers each,
ai and
bi
(1 ≤ ai, bi ≤ n), where
ai is the price of the
i-th laptop, and bi is the number that represents the quality of the
i-th laptop (the larger the number is, the higher is the quality).
All ai are distinct. All
bi are distinct.
If Alex is correct, print "Happy Alex", otherwise print "Poor Alex" (without the quotes).
2
1 2
2 1
Happy Alex
题目告诉。给出n个电脑,每一个电脑一个价钱和价值,问有没有存在价钱更低。价值更高的,sad。。
。。一開始还想要排序神马的,越想越乱。最后发现 输入的ai和bi都是不同的,而且都在1到n的范围内,也就是说每一个数仅仅会出现一次,那么仅仅有 a[1] =1 a[2] = 2 这样时,才不会出现价钱低而价值高的,哈希一次遍历就能够,sad。。
。。15分钟才过。
。。。
#include <cstdio>
#include <cstring>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace std;
int p[110000] ;
int main()
{
int i , n , a , b ;
while(scanf("%d", &n)!=EOF)
{
memset(p,-1,sizeof(p));
for(i = 1 ; i <= n ; i++)
{
scanf("%d %d", &a, &b);
p[a] = b ;
}
for(i = 1 ; i <= n ; i++)
if( p[i] != i )
break;
if(i <= n)
printf("Happy Alex\n");
else
printf("Poor Alex\n"); }
return 0;
}
最新文章
- TortoiseGit:记住用户名和密码
- sqlmap用户手册 | WooYun知识库
- 还记得高中的向量吗?leetcode 335. Self Crossing(判断线段相交)
- Web.Config如何输入特殊字符
- PC端重置
- guacamole 0.8.3 项目部署 桌面虚拟化
- hammer.js中文文档
- UVA 10127题目描述
- 关于 屏幕阅读器 和 sr-only
- android:launchMode的四种方式
- socket模块
- [shell基础]——整数比较;字符串比较;文件测试;逻辑测试符
- Codeforces Round #221 (Div. 1) B. Maximum Submatrix 2 dp排序
- iOS开发——总结篇&;IOS开发基础知识
- 把硬盘格式化成ext格式的cpu占用率就下来了
- socketpair的使用
- shell编程之sed
- 线段树扫描线 HDU 1542
- java内部发送http请求并取得返回结果,修改response的cookie
- [WPF]本地化入门