B - Black and White

题目大意

构造出n个@连通块和m个 . 连通块的规则矩阵

//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast", "inline", "-ffast-math")
//#pragma GCC target("abm,avx,mmx,popcnt,sse,sse2,sse3,ssse3,sse4")
#include <algorithm>
#include <cstring>
#include <iostream>
#define dbg(x) cout << #x << '=' << x << endl
#define dbg1(x, y) cout << #x << '=' << x << ',' << #y << '=' << y << endl
#define FA ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
using namespace std;
const int N = 2e5 + 10, M = 2 * N, mod = 1e9 + 7;
const double eps = 1e-8;
typedef long long LL;
typedef pair<int, int> PII;
int n, m;

void solve() {
    cin >> n >> m;
    if (n == 1) {
        cout << 2 << ' ' << 2 * (m + 1) << endl;
        for (int i = 1; i <= m + 1; i++) cout << "@@";
        cout << endl << '@';
        for (int i = 1; i <= m; i++) cout << ".@";
        cout << '@';
    } else if (m == 1) {
        cout << 2 << ' ' << 2*(n + 1) << endl;
        for (int i = 1; i <= n + 1; i++) cout << "..";
        cout << endl << '.';
        for (int i = 1; i <= n; i++) cout << "@.";
        cout << '.';
    } else {
        cout << 2 << ' ' << (m + n - 2) * 2 << endl;
        for (int i = 1; i <= 2 * (n - 1); i++) cout << '.';
        for (int i = 1; i <= m - 1; i++) cout << "@@";
        cout << endl;
        for (int i = 1; i <= n - 1; i++) cout << ".@";
        for (int i = 1; i <= m - 1; i++) cout << ".@";
    }
}
signed main() {
    freopen("black.in","r",stdin);
    freopen("black.out","w",stdout);
    int T = 1;  // cin>>T;
    while (T--) solve();
}