【打CF,学算法——二星级】Codeforces Round #313 (Div. 2) B. Gerald is into Art(水题)

【CF简介】

提交链接:http://codeforces.com/contest/560/problem/B


题面:

B. Gerald is into Art
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Gerald bought two very rare paintings at the Sotheby's auction and he now wants to hang them on the wall. For that he bought a special board to attach it to the wall and place the paintings on the board. The board has shape of ana1 × b1 rectangle, the paintings have shape of aa2 × b2 anda3 × b3 rectangles.

Since the paintings are painted in the style of abstract art, it does not matter exactly how they will be rotated, but still, one side of both the board, and each of the paintings must be parallel to the floor. The paintings can touch each other and the edges of the board, but can not overlap or go beyond the edge of the board. Gerald asks whether it is possible to place the paintings on the board, or is the board he bought not large enough?

Input

The first line contains two space-separated numbers a1 andb1 — the sides of the board. Next two lines contain numbersa2, b2, a3 andb3 — the sides of the paintings. All numbersai, bi in the input are integers and fit into the range from1 to 1000.

Output

If the paintings can be placed on the wall, print "YES" (without the quotes), and if they cannot, print "NO" (without the quotes).

Sample test(s)
Input
3 2
1 3
2 1
Output
YES
Input
5 5
3 3
3 3
Output
NO
Input
4 2
2 3
1 2
Output
YES
Note

That's how we can place the pictures in the first test:

And that's how we can do it in the third one.

解题:

    就是看能不能把两块画,放进板内,要求画必须平行于板。


代码:

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int main()
{
    int l1,w1,l2,w2,l3,w3;
    scanf("%d%d",&l1,&w1);
    scanf("%d%d",&l2,&w2);
    scanf("%d%d",&l3,&w3);
    bool flag=false;
    if((l2+l3)<=l1&&(w2<=w1&&w3<=w1))
      flag=true;
    else if((l2+w3)<=l1&&(w2<=w1)&&(l3<=w1))
      flag=true;
    else if((w2+l3)<=l1&&(l2<=w1)&&(w3<=w1))
      flag=true;
    else if((w2+w3)<=l1&&(l2<=w1&&l3<=w1))
      flag=true;
    else if((w2+w3)<=w1&&(l2<=l1)&&(l3<=l1))
      flag=true;
    else if((w2+l3)<=w1&&(l2<=l1)&&(w3<=l1))
      flag=true;
    else if((l2+w3)<=w1&&(w2<=l1)&&(l3<=l1))
      flag=true;
    else if((l2+l3)<=w1&&(w2<=l1)&&(w3<=l1))
      flag=true;
      if(flag)printf("YES\n");
      else printf("NO\n");
    return 0;
} 



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值