結果
問題 | No.1035 Color Box |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:16:29 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 2,710 bytes |
コンパイル時間 | 1,734 ms |
コンパイル使用メモリ | 173,184 KB |
実行使用メモリ | 6,400 KB |
最終ジャッジ日時 | 2024-10-15 03:01:07 |
合計ジャッジ時間 | 2,945 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)#define REP(i,n) rep(i,0,n)#define REP2(i,n) rep2(i,0,n)#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)#define all(hoge) (hoge).begin(),(hoge).end()#define en '\n'using ll = long long;using ull = unsigned long long;template <class T> using vec = vector<T>;template <class T> using vvec = vector<vec<T>>;typedef pair<ll, ll> P;constexpr long long INF = 1LL << 60;constexpr int INF_INT = 1 << 25;constexpr long long MOD = (ll) 1e9 + 7;//constexpr long long MOD = 998244353LL;typedef vector<ll> Array;typedef vector<Array> Matrix;template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}struct Edge {ll to, cap, rev;Edge(ll _to, ll _cap, ll _rev) {to = _to; cap = _cap; rev = _rev;}};using Edges = vector<Edge>;using Graph = vector<Edges>;void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {G[from].push_back(Edge(to, cap, (ll)G[to].size()));if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));}class Combination {public:Array fact;//n!Array inv;//n!の逆元ll mod;Combination(ll n, ll _mod) {mod = _mod;fact.resize(n + 1);fact[0] = 1;REP(i, n) {fact[i + 1] = (fact[i] * (i + 1LL)) % mod;}inv.resize(n + 1);inv[n] = mod_inv(fact[n]);for(int i=n;i>0;i--) {inv[i - 1] = inv[i] * i % mod;}}//modの逆元ll mod_inv(ll x) {ll n = mod - 2;ll res = 1LL;while (n > 0) {if (n & 1) res = res * x % mod;x = x * x % mod;n >>= 1;}return res;}ll nCr(ll n, ll r) {return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;}ll nPr(ll n, ll r) {return (fact[n] * inv[n - r]) % mod;}ll nHr(ll n, ll r) {//重複組み合わせ:n種類のものからr種類選ぶreturn nCr(r + n - 1, r);}};ll mod_pow(ll x, ll n, ll mod) {ll res = 1LL;while (n > 0) {if (n & 1) res = res * x % mod;x = x * x % mod;n >>= 1;}return res;}void solve(){ll n,m;cin>>n>>m;Combination com(n+m,MOD);ll ans=0;REP(i,m){if(i%2==0) (ans += mod_pow(m-i,n,MOD)*com.nCr(m,i)%MOD)%=MOD;else (ans += (MOD-mod_pow(m-i,n,MOD)*com.nCr(m,i)%MOD)%MOD )%=MOD;}cout<<ans<<en;}int main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);solve();//ll t;cin>>t;REP(i,t) solve();return 0;}