CF980B Marlin 构造 思维 二十四

#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define debug(a) cout << #a << " " << a << endl
using namespace std;
const int maxn = 1e2 + 10;
const int mod = 1e9 + 7;
typedef long long ll;
char mapn[maxn][maxn];
int main(){
    std::ios::sync_with_stdio(false);
    ll n, m;
    cin >> n >> m;
    cout << "YES" << endl;
    for( ll i = 1; i <= 4; i ++ ) {
        for( ll j = 1; j <= n; j ++ ) {
            mapn[i][j] = ‘.‘;
        }
    }
    if( m % 2 == 0 ) {
        for( ll i = 2; i <= 3; i ++ ) {
            for( ll j = 2; j <= 1+m/2; j ++ ) {
                mapn[i][j] = ‘#‘;
            }
        }
    } else {
        ll t = ( n+1 ) / 2, num = m; //奇数对称的中心点纵坐标是t，num不大于1时不用再填充了，大于1时关于t对称填充
        for( ll i = 2; i <= ( (m-1) / (n-2) ) + 2 && num > 1; i ++ ) {
            for( ll j = 1; j <= t-2 && num > 1; j ++ ) {
                mapn[i][t-j] = mapn[i][t+j] = ‘#‘;
                num -= 2;
            }
        }
        mapn[2][t] = ‘#‘;
    }
    for( ll i = 1; i <= 4; i ++ ) {
        for( ll j = 1; j <= n; j ++ ) {
            cout << mapn[i][j];
        }
        cout << endl;
    }
    return 0;
}