提出 #47031650

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = 2e5 + 7;
const ll Mod = 998244353;

int cases, n; string s, t;

vector<vector<int>> v;

bool found;

bool check(bool hard) {
    int r[5][3], c[5][3];
    memset(r, 0, sizeof(r));
    memset(c, 0, sizeof(c));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (v[i][j] != -1) {
                if (r[i][v[i][j]] || c[j][v[i][j]]) return 0;
                r[i][v[i][j]] = 1;
                c[j][v[i][j]] = 1;
            }
        }
    }
    if (!hard) return 1;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 3; ++j) {
            if (!r[i][j] || !c[i][j]) return 0;
        }
    }
    for (int i = 0; i < n; ++i) {
        int res = -1;
        for (int j = 0; j < n; ++j) {
            if (v[i][j] != -1) {
                res = v[i][j];
                break;
            }
        }
        if (res != -1 && res != s[i] - 'A') return 0;
    }
    for (int i = 0; i < n; ++i) {
        int res = -1;
        for (int j = 0; j < n; ++j) {
            if (v[j][i] != -1) {
                res = v[j][i];
                break;
            }
        }
        if (res != -1 && res != t[i] - 'A') return 0;
    }
    return 1;
}

void dfs(int x) {
    if (found) return;
    if (x == n) {
        if (!check(1)) return;
        found = 1;
        cout << "Yes" << endl;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                char c = v[i][j] + 'A';
                if (v[i][j] == -1) cout << '.';
                else cout << c;
            }
            cout << endl;
        }
        return;
    }
    for (int i = 0; i < 5; ++i) {
        for (int j = 0; j < 5; ++j) {
            for (int k = 0; k < 5; ++k) {
                if (i == j || i ==k  || j == k) continue;
                v[x][i] = 0, v[x][j] = 1, v[x][k] = 2;
                if (check(0)) {
                    dfs(x + 1);
                }
                v[x][i] = v[x][j] = v[x][k] = -1;
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    cin >> s >> t;
    v.resize(5, vector<int>(5, -1));
    dfs(0);
    if (!found) {
        cout << "No" << endl;
    }
}

提出情報

ジャッジ結果