結果
問題 | No.1035 Color Box |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:30:29 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 2,457 bytes |
コンパイル時間 | 844 ms |
コンパイル使用メモリ | 98,768 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-15 03:11:57 |
合計ジャッジ時間 | 2,359 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#include <iostream>#include <algorithm>#include <complex>#include <utility>#include <vector>#include <string>#include <queue>#include <tuple>#include <cmath>#include <bitset>#include <cctype>#include <set>#include <map>#include <unordered_map>#include <numeric>#include <functional>#define _overload3(_1,_2,_3,name,...) name#define _rep(i,n) repi(i,0,n)#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()#define PRINT(V) cout << V << "\n"#define SORT(V) sort((V).begin(),(V).end())#define RSORT(V) sort((V).rbegin(), (V).rend())using namespace std;using ll = long long;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }template<class itr> void cins(itr first,itr last){for (auto i = first;i != last;i++){cin >> (*i);}}template<class itr> void array_output(itr start,itr goal){string ans = "",k = " ";for (auto i = start;i != goal;i++) ans += to_string(*i)+k;if (!ans.empty()) ans.pop_back();PRINT(ans);}ll gcd(ll a, ll b) {return a ? gcd(b%a,a) : b;}const ll INF = 1e16;const ll MOD = 1000000007;typedef pair<ll,ll> P;const ll MAX = 100010;constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};ll fac[MAX], finv[MAX], inv[MAX];void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (ll i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}ll COM(ll n, ll k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}ll RepeatSquaring(ll N, ll P, ll M){if(P==0) return 1;if(P%2==0){ll t = RepeatSquaring(N, P/2, M);return t*t % M;}return N * RepeatSquaring(N, P-1, M)%M;}int main(){cin.tie(0);ios::sync_with_stdio(false);ll n,m;cin >> n >> m;ll ans = 0,c = 1;COMinit();rep(i,m){ans += c*(COM(m,i)*RepeatSquaring(m-i,n,MOD)%MOD);if (ans < 0) (ans += MOD)%=MOD;else ans %= MOD;c *= -1;}PRINT(ans%MOD);}