Berland Crossword

Berland Crossword

本题主要考察点在于判断四个角的状态，也就是分别判断在四个角的十六种状态下，各个边上是否还有其他的空白能存放黑子(判断是否在合理范为内)

题目：//
Berland crossword is a puzzle that is solved on a square grid with n rows and n columns. Initially all the cells are white.

To solve the puzzle one has to color some cells on the border of the grid black in such a way that:

exactly U cells in the top row are black;
exactly R cells in the rightmost column are black;
exactly D cells in the bottom row are black;
exactly L cells in the leftmost column are black.
Note that you can color zero cells black and leave every cell white.

Your task is to check if there exists a solution to the given puzzle.

Input
The first line contains a single integer t (1≤t≤1000) — the number of testcases.

Then the descriptions of t testcases follow.

The only line of each testcase contains 5 integers n,U,R,D,L (2≤n≤100; 0≤U,R,D,L≤n).

Output
For each testcase print “YES” if the solution exists and “NO” otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

输入数据

4
5 2 5 3 1
3 0 0 0 0
4 4 1 4 0
2 1 1 1 1

输出数据

YES
YES
NO
YES

#include<stdio.h>
int a;
bool check(int x)
{
    if(x>=0&&x<=a-2)
        return 1;
    else
        return 0;
}
bool judge(int b,int c,int d,int e)
{
    int flag=0;
    for(int m=0; m<=1; m++)
        for(int y=0; y<=1; y++)
            for(int o=0; o<=1; o++)
                for(int p=0; p<=1; p++)
                {
                    if(check(b-m-y)&&check(c-o-y)&&check(d-o-p)&&check(e-m-p))
                        flag=1;
                }
    return flag;
}
int main()
{
    int b,c,d,e,f,n;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
        if(judge(b,c,d,e))
            printf("YES\n");
        else
            printf("NO\n");
    }
}