Code Forces 560B Gerald is into Art

最新推荐文章于 2021-06-20 16:29:37 发布

lizhaowei213

最新推荐文章于 2021-06-20 16:29:37 发布

阅读量867

点赞数

分类专栏：模拟&水

本文链接：https://blog.csdn.net/lizhaowei213/article/details/47361259

版权

模拟&水专栏收录该内容

50 篇文章 0 订阅

订阅专栏

E - E

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 560B

Description

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 an a₁ × b₁ rectangle, the paintings have shape of a a₂ × b₂ and a₃ × b₃ 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 a₁ and b₁ — the sides of the board. Next two lines contain numbers a₂, b₂, a₃ and b₃ — the sides of the paintings. All numbers a_i, b_i in the input are integers and fit into the range from 1 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 Input

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

Hint

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

$\text{[math]}$

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

$\text{[math]}$

水题。

题目大概是说有一个大矩形，两个小矩形，问这两个小矩形能不能不重叠不相交的摆在大矩形上。

直接枚举各种情况，反正我枚举了8种。只要两个小矩形的某一条边之和小于大矩形的某一条变，小矩形各剩下的那条边里最大的小于大矩形里剩下的那条边就行。

#include <stdio.h>
#include <algorithm>
using namespace std;
int a1,b1,a2,b2,a3,b3;
bool isok()
{
        if((a2+a3)<=a1 &&max(b2,b3)<=b1)
                return true;
        if((b2+b3)<=a1 &&max(a2,a3)<=b1)
                return true;
        if((a2+a3)<=b1 &&max(b2,b3)<=a1)
                return true;
        if((b2+b3)<=b1 &&max(a2,a3)<=a1)
                return true;
        if((a2+b3)<=a1 &&max(b2,a3)<=b1)
                return true;
        if((a2+b3)<=b1 &&max(b2,a3)<=a1)
                return true;
        if((b2+a3)<=a1 &&max(a2,b3)<=b1)
                return true;
        if((b2+a3)<=b1 &&max(a2,b3)<=a1)
                return true;
        return false;
}
int main()
{
        scanf("%d%d%d%d%d%d",&a1,&b1,&a2,&b2,&a3,&b3);
        if(isok())
                printf("YES\n");
        else
                 printf("NO\n");
}