Submission #47287424

---

Source Code Expand

#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>>;
}

Num grid[10][10];

void solve(std::istream& is, std::ostream& os) {
    for(Num y{0}; y<9; ++y) {
        for(Num x{0}; x<9; ++x) {
            Num a {0};
            is >> a;
            grid[y][x] = a;
        }
    }

    bool valid {true};

    for(Num y{0}; y<9; ++y) {
        std::set<Num> nums;
        for(Num x{0}; x<9; ++x) {
            const auto a = grid[y][x];
            nums.insert(a);
        }
        valid &= nums.size() == 9;
    }

    for(Num x{0}; x<9; ++x) {
        std::set<Num> nums;
        for(Num y{0}; y<9; ++y) {
            const auto a = grid[y][x];
            nums.insert(a);
        }
        valid &= nums.size() == 9;
    }

    for(Num box_x{0}; box_x<9; box_x+=3) {
        for(Num box_y{0}; box_y<9; box_y+=3) {
            std::set<Num> nums;

            for(Num ofs_x{0}; ofs_x<3; ++ofs_x) {
                for(Num ofs_y{0}; ofs_y<3; ++ofs_y) {
                    const auto x = box_x + ofs_x;
                    const auto y = box_y + ofs_y;
                    const auto a = grid[y][x];
                    nums.insert(a);
                }
            }
            valid &= nums.size() == 9;
        }
    }

    if (valid) {
        os << "Yes\n";
    } else {
        os << "No\n";
    }
}

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

Submission Info

Judge Result