EDU105|codeforces1494B. Berland Crossword

B. Berland Crossword time limit per test2 seconds memory limit per
test256 megabytes inputstandard input outputstandard output 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).

Example inputCopy 4 5 2 5 3 1 3 0 0 0 0 4 4 1 4 0 2 1 1 1 1 outputCopy
YES YES NO YES Note Here are possible solutions to testcases 1, 2 and
4

我们可以观察发现 问题的关键在于上下左右四角的状态，要关注n-2个以外行的情况
然而强行模拟的话边界状态很棘手。(我太菜了）
因为只要考虑4个点的状态，枚举一下就可以了，每次减去对应的两个值
四位数字分别对应 UR DR DL UL

//cyc
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mst(a) memset(a,0,sizeof a)

using namespace std;
typedef pair<int, int> pii;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _;
    cin >> _;
    while(_--)
    {
        int n;
        cin>>n;
        vector<int> a(4), b(4);
        for(int i = 0; i < 4; i++)
        {
            cin >> a[i];
        }
        int flag=1;
        for(int i = 0; i < (1 << 4); i++) //10000
        {
            b=a;
            int cur=i;
            for(int i=0;i<4;i++){
                if((cur>>i)&1){
                    b[i]--;
                    b[(i+1)%4]--;
                }
            }
            flag=1;
            for(int i=0;i<4;i++){
                if(b[i]>n-2)flag=0;
                if(b[i]<0)flag=0;
            }
            if(flag){
                break;
            }
        }
        if(flag)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;

    }
}