提出 #56158689

---

ソースコード 拡げる

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

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

void solve(std::istream& is, std::ostream& os) {
    Num n,d;
    is >> n >> d;

    if ((n - 1) < (2 * d)) {
        os << "No\n";
        return;
    }

    if ((n - 1) == (2 * d)) {
        os << "Yes\n";
        for(Num i{1}; i<=n; ++i) {
            for(Num j{i+1}; j<=n; ++j) {
                os << i << " " << j << "\n";
            }
        }
        return;
    }

    std::vector<std::pair<Num,Num>> ps;
    for(Num dist{1}; dist<=d; ++dist) {
        const auto len = std::lcm(dist, n) / dist;
        const auto n_cycle = n / len;
        for(Num ofs{0}; ofs<n_cycle; ++ofs) {
            Num from = ofs;
            for(Num i{0}; i<len; ++i) {
                const Num to = (from + dist) % n;
                ps.push_back(std::make_pair(from+1, to+1));
                from = to;
            }
        }
    }

    os << "Yes\n";
    for(const auto& [from, to] : ps) {
        os << from << " " << to << "\n";
    }
}

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

提出情報

ジャッジ結果