提出 #47059318

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    std::string rows;
    std::string cols;
    is >> n >> rows >> cols;

    Vec order(n, 0);
    std::iota(order.begin(), order.end(), 0);

    auto order_a = order;
    auto order_b = order;
    auto order_c = order;

    using Grid = std::array<std::array<char, 5>, 5>;
    Grid zero;
    for(Num y{0}; y<5; ++y) {
        for(Num x{0}; x<5; ++x) {
            zero[y][x] = '.';
        }
    }

    do {
        do {
            do {
                auto grid = zero;
                for(Num ic{0}; ic<n; ++ic) {
                    grid[ic][order_c.at(ic)] = 'C';
                }

                for(Num ib{0}; ib<n; ++ib) {
                    grid[ib][order_b.at(ib)] = 'B';
                }

                for(Num ia{0}; ia<n; ++ia) {
                    grid[ia][order_a.at(ia)] = 'A';
                }

                bool failed {false};
                for(Num y{0}; y<n; ++y) {
                    char first {'.'};
                    std::array<Num, 3> counts {0,0,0};
                    for(Num x{0}; x<n; ++x) {
                        const char c = grid[y][x];
                        if (c != '.') {
                            first = (first != '.') ? first : c;
                            counts[c - 'A'] += 1;
                        }
                    }
                    failed |= (first != rows.at(y)) ||
                        (std::count(counts.begin(), counts.end(), 1LL) != 3);
                }

                for(Num x{0}; x<n; ++x) {
                    char first {'.'};
                    std::array<Num, 3> counts {0,0,0};
                    for(Num y{0}; y<n; ++y) {
                        const char c = grid[y][x];
                        if (c != '.') {
                            first = (first != '.') ? first : c;
                            counts[c - 'A'] += 1;
                        }
                    }
                    failed |= (first != cols.at(x)) ||
                        (std::count(counts.begin(), counts.end(), 1LL) != 3);
                }

                if (!failed) {
                    os << "Yes\n";
                    for(Num y{0}; y<n; ++y) {
                        for(Num x{0}; x<n; ++x) {
                            os << grid[y][x];
                        }
                        os << "\n";
                    }
                    return;
                }
            } while(std::next_permutation(order_a.begin(), order_a.end()));
        } while(std::next_permutation(order_b.begin(), order_b.end()));
    } while(std::next_permutation(order_c.begin(), order_c.end()));

    os << "No\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果