結果

問題 No.1259 スイッチ
ユーザー kcvlexkcvlex
提出日時 2020-10-17 22:31:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 7,495 bytes
コンパイル時間 1,478 ms
コンパイル使用メモリ 147,672 KB
実行使用メモリ 26,496 KB
最終ジャッジ日時 2024-07-21 03:12:48
合計ジャッジ時間 5,520 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
18,688 KB
testcase_01 AC 29 ms
18,944 KB
testcase_02 AC 31 ms
18,816 KB
testcase_03 AC 32 ms
18,816 KB
testcase_04 AC 30 ms
18,816 KB
testcase_05 AC 29 ms
18,688 KB
testcase_06 AC 30 ms
18,816 KB
testcase_07 AC 30 ms
18,688 KB
testcase_08 AC 29 ms
18,816 KB
testcase_09 AC 29 ms
18,688 KB
testcase_10 AC 42 ms
23,424 KB
testcase_11 AC 51 ms
26,112 KB
testcase_12 AC 44 ms
23,296 KB
testcase_13 AC 39 ms
21,504 KB
testcase_14 AC 41 ms
22,528 KB
testcase_15 AC 39 ms
21,248 KB
testcase_16 AC 47 ms
24,832 KB
testcase_17 AC 41 ms
22,144 KB
testcase_18 AC 51 ms
25,728 KB
testcase_19 AC 51 ms
25,728 KB
testcase_20 AC 48 ms
23,552 KB
testcase_21 AC 54 ms
26,368 KB
testcase_22 AC 37 ms
20,992 KB
testcase_23 AC 49 ms
25,472 KB
testcase_24 AC 46 ms
23,936 KB
testcase_25 AC 45 ms
23,680 KB
testcase_26 AC 51 ms
26,368 KB
testcase_27 AC 48 ms
24,960 KB
testcase_28 AC 44 ms
23,808 KB
testcase_29 AC 47 ms
24,832 KB
testcase_30 AC 42 ms
22,528 KB
testcase_31 AC 47 ms
24,448 KB
testcase_32 AC 37 ms
21,120 KB
testcase_33 AC 50 ms
26,368 KB
testcase_34 AC 41 ms
22,912 KB
testcase_35 AC 45 ms
24,704 KB
testcase_36 AC 46 ms
24,064 KB
testcase_37 AC 46 ms
23,808 KB
testcase_38 AC 43 ms
23,424 KB
testcase_39 AC 51 ms
25,984 KB
testcase_40 AC 54 ms
26,240 KB
testcase_41 AC 50 ms
24,832 KB
testcase_42 AC 52 ms
26,240 KB
testcase_43 AC 43 ms
23,168 KB
testcase_44 AC 51 ms
25,984 KB
testcase_45 AC 54 ms
26,496 KB
testcase_46 AC 42 ms
22,912 KB
testcase_47 AC 53 ms
26,496 KB
testcase_48 AC 41 ms
22,528 KB
testcase_49 AC 52 ms
26,368 KB
testcase_50 AC 42 ms
23,040 KB
testcase_51 AC 37 ms
20,992 KB
testcase_52 AC 52 ms
25,984 KB
testcase_53 AC 41 ms
22,016 KB
testcase_54 AC 50 ms
26,112 KB
testcase_55 AC 37 ms
20,864 KB
testcase_56 AC 41 ms
22,400 KB
testcase_57 AC 52 ms
25,472 KB
testcase_58 AC 44 ms
23,296 KB
testcase_59 AC 48 ms
24,320 KB
testcase_60 AC 53 ms
26,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }


namespace math {

template <typename T>
T mul_id_ele() {
    if constexpr (std::is_fundamental<T>::value) {
        return T(1);
    } else {
        return T::mul_id_ele();
    }
}

template <typename T>
T add_id_ele() {
    if constexpr (std::is_fundamental<T>::value) {
        return T(0);
    } else {
        return T::add_id_ele();
    }
}

template <typename T>
constexpr T pow(const T &n, ll k) {
    T ret = mul_id_ele<T>();
    T cur = n;
    while (k) {
        if (k & 1) ret *= cur;
        cur *= cur;
        k /= 2;
    }
    return ret;
}


template <typename T>
typename std::enable_if<std::is_integral<T>::value, T>::type
gcd(T a, T b) { return b ? gcd(a % b, b) : a; }

}

namespace math {

template <ll Mod>
struct Modint {

    constexpr Modint(ll x) noexcept : x((Mod + x % Mod) % Mod) { }
    
    constexpr Modint() noexcept : Modint(0) { }
    
    constexpr static Modint add_id_ele() { 
        return Modint(0); 
    }
    
    constexpr static Modint mul_id_ele() {
        return Modint(1); 
    }
    
    constexpr ll& value() noexcept { 
        return x; 
    }
    
    constexpr ll value() const noexcept {
        return x; 
    }

    constexpr Modint& operator+=(const Modint &oth) noexcept {
        x += oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator-=(const Modint &oth) noexcept {
        x += Mod - oth.value();
        if (Mod <= x) x -= Mod;
        return *this;
    }

    constexpr Modint& operator*=(const Modint &oth) noexcept {
        x *= oth.value();
        x %= Mod;
        return *this;
    }

    constexpr Modint& operator/=(const Modint &oth) noexcept {
        x *= oth.inv().value();
        x %= Mod;
        return *this;
    }

    constexpr Modint operator+(const Modint &oth) const noexcept {
        return Modint(x) += oth;
    }

    constexpr Modint operator-(const Modint &oth) const noexcept {
        return Modint(x) -= oth;
    }

    constexpr Modint operator*(const Modint &oth) const noexcept {
        return Modint(x) *= oth;
    }

    constexpr Modint operator/(const Modint &oth) const noexcept {
        return Modint(x) /= oth;
    }

    constexpr Modint operator-() const noexcept {
        return Modint((x != 0) * (Mod - x)); 
    }

    constexpr bool operator==(const Modint &oth) const noexcept {
        return value() == oth.value();
    }

    template <typename T>
    constexpr typename std::enable_if<std::is_integral<T>::value, const Modint&>::type
    operator=(T t) noexcept {
        (*this) = Modint(std::forward<T>(t)); 
        return *this;
    }

    constexpr Modint inv() const noexcept {
        return ::math::pow(*this, Mod - 2);
    }

    constexpr ll mod() const noexcept {
        return Mod;
    }

private:
    ll x;
};

template <ll Mod>
Modint<Mod> inv(Modint<Mod> m) {
    m.inv();
    return m;
}

template <ll Mod>
std::istream& operator>>(std::istream &is, Modint<Mod> &m) {
    ll v;
    is >> v;
    m = v;
    return is;
}

template <ll Mod>
std::ostream& operator<<(std::ostream &os, Modint<Mod> m) {
    os << m.value();
    return os;
}

}


namespace math {

template <typename T>
class Factorial {
    size_type maxv;
    vec<T> factv, ifactv;

public:
    Factorial(ssize_t maxv) : maxv(maxv), factv(maxv + 1), ifactv(maxv + 1) {
        factv[0] = T(1);
        for (ll i = 1; i <= maxv; i++) factv[i] = factv[i - 1] * i;
        ifactv.back() = factv.back().inv();
        for (ll i = maxv - 1; 0 <= i; i--) ifactv[i] = ifactv[i + 1] * (i + 1);
    }

    T fact(size_type n) const {
        return factv[n]; 
    }

    T ifact(size_type n) const {
        return ifactv[n];
    }

    T perm(size_type n, size_type k) const {
        return factv[n] * ifactv[n - k];
    }

    T comb(size_type n, size_type k) const {
        return perm(n, k) * ifactv[k];
    }

    T catalan(size_type n) const {
        return fact[2 * n] * ifact[n + 1] * ifact[n];
    }
};

}

constexpr ll mod = 1e9 + 7;
using mint = math::Modint<mod>;
math::Factorial<mint> fa(1e6 + 10);

mint solve() {
    ll n, k, m;
    std::cin >> n >> k >> m;
    mint ans1 = 0;
    vec<mint> pown(n + 10);
    pown[0] = 1;
    for (ll i = 1; i < n + 10; i++) pown[i] = pown[i - 1] * n;
    
    for (ll i = 1; i <= n; i++) {
        if (k % i) continue;
        ans1 += fa.perm(n - 1, i - 1) * pown[n - i];
    }

    if (m == 1) return ans1;
    mint all = pown[n];
    all -= ans1;
    return all * mint(n - 1).inv();
}

int main() {
    std::cout << solve() << "\n";
    return 0;
}
0