Codeforces B. Neighbor Grid (思维 / 构造) (Global Round 9)

传送门

题意： 给出一个初始二维数组，将其装换为目标数组(每个数字大小取决于四周不为0的数字个数)；若无法转换成目标数组则输出"No"，反之输出"YES"后再输出目标数组。

思维：

• 首先判断没个数是否超出了他的目标数据，超出了就不能构造成功。
• 既然没有说最简便的方法那就直接暴力，在能达到的情况下让没个数达到其目标数据的max即可。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 305;

int t, n, m;
int mp[N][N];

signed main()
{
    IOS;

    cin >> t;
    while(t --){
        cin >> n >> m;
        me(mp);
        int cnt = 0;
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= m; j ++)
                cin >> mp[i][j];
    
        int ok = 1;
        if(mp[1][1] > 2 || mp[1][m] > 2 || mp[n][1] > 2 || mp[n][m] > 2){
            cout << "NO" << endl;
            continue;
        }

        mp[1][1] = mp[1][m] = mp[n][1] = mp[n][m] = 2;

        for(int i = 2; i < m; i ++){
            if(mp[1][i] > 3 || mp[n][i] > 3){
                ok = 0;
                break;
            }
            mp[1][i] = mp[n][i] = 3;
        }

        for(int i = 2; i < n; i ++){
            if(mp[i][1] > 3 || mp[i][m] > 3){
                ok = 0;
                break;
            }
            mp[i][1] = mp[i][m] = 3;
        }

        for(int i = 2; i < n; i ++){
            for(int j = 2; j < m; j ++){
                if(mp[i][j] > 4){
                    ok = 0;
                    break;
                }
                mp[i][j] = 4;
            }
        }

        if(!ok){
            cout << "NO" << endl;
            continue;
        }

        cout << "YES" << endl;
        for(int i = 1; i <= n; i ++){
            for(int j = 1; j <= m; j ++)
                cout << mp[i][j] << " ";
            cout << endl;
        }
    }

    return 0;
}