#469299 (C++17) No.1035 Color Box

提出ソース

結果

問題	No.1035 Color Box
ユーザー	kcvlex
提出日時	2020-04-24 21:45:35
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	35 ms / 2,000 ms
コード長	5,731 bytes
コンパイル時間	1,473 ms
コンパイル使用メモリ	145,240 KB
実行使用メモリ	19,012 KB
最終ジャッジ日時	2024-04-23 03:07:54
合計ジャッジ時間	3,294 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	35 ms 18,900 KB
testcase_01	AC	27 ms 18,972 KB
testcase_02	AC	27 ms 18,836 KB
testcase_03	AC	26 ms 18,800 KB
testcase_04	AC	26 ms 18,864 KB
testcase_05	AC	25 ms 18,956 KB
testcase_06	AC	26 ms 18,936 KB
testcase_07	AC	27 ms 18,856 KB
testcase_08	AC	32 ms 18,952 KB
testcase_09	AC	28 ms 18,844 KB
testcase_10	AC	26 ms 18,892 KB
testcase_11	AC	25 ms 18,832 KB
testcase_12	AC	27 ms 18,896 KB
testcase_13	AC	30 ms 18,956 KB
testcase_14	AC	32 ms 18,996 KB
testcase_15	AC	33 ms 18,928 KB
testcase_16	AC	25 ms 18,924 KB
testcase_17	AC	25 ms 18,808 KB
testcase_18	AC	25 ms 18,904 KB
testcase_19	AC	32 ms 18,844 KB
testcase_20	AC	26 ms 18,948 KB
testcase_21	AC	26 ms 18,832 KB
testcase_22	AC	28 ms 18,840 KB
testcase_23	AC	29 ms 18,872 KB
testcase_24	AC	28 ms 18,892 KB
testcase_25	AC	27 ms 18,784 KB
testcase_26	AC	26 ms 18,840 KB
testcase_27	AC	27 ms 19,012 KB
testcase_28	AC	27 ms 18,804 KB
testcase_29	AC	26 ms 18,924 KB
testcase_30	AC	27 ms 18,968 KB
testcase_31	AC	27 ms 18,860 KB
testcase_32	AC	26 ms 18,808 KB
testcase_33	AC	26 ms 18,840 KB
testcase_34	AC	26 ms 18,800 KB
testcase_35	AC	29 ms 18,924 KB
testcase_36	AC	26 ms 18,836 KB
testcase_37	AC	26 ms 18,948 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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>;
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> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dem_array<T, Args...>::type;
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; }

namespace math {

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

}

namespace math {

template <ll Mod>
struct Modint {

    constexpr Modint(ll x) noexcept : x((Mod + x % Mod) % Mod) { }
    
    constexpr Modint() noexcept : Modint(0) { }
    
    constexpr Modint<Mod> add_id_ele() const noexcept { 
        return Modint<Mod>(0); 
    }
    
    constexpr Modint<Mod> mul_id_ele() const noexcept {
        return Modint<Mod>(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();
        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)); 
    }

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

}

namespace math {

template <ll Mod>
class Factorial {
    using mint = Modint<Mod>;

    ssize_t maxv;
    vec<mint> factv, ifactv;

public:
    Factorial(ssize_t maxv) : maxv(maxv), factv(maxv + 1), ifactv(maxv + 1) {
        factv[0] = mint(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);
    }

    mint fact(ll n) const {
        return factv[n]; 
    }

    mint ifact(ll n) const {
        return ifactv[n];
    }

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

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

}

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

int main() {
    ll n, m;
    std::cin >> n >> m;
    mint ans = 0;
    for (ll i = 0; i < m; i++) {
        mint p = math::pow(mint(m - i), n);
        p *= fa.comb(m, i);
        if (i & 1) p *= -1;
        ans += p;
    }
    std::cout << ans.value() << '\n';
    return 0;
}

yukicoder

結果

テストケース

ソースコード