結果
問題 | No.1035 Color Box |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:00:15 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 501 ms / 2,000 ms |
コード長 | 5,847 bytes |
コンパイル時間 | 2,198 ms |
コンパイル使用メモリ | 183,552 KB |
実行使用メモリ | 34,688 KB |
最終ジャッジ日時 | 2024-10-15 02:50:05 |
合計ジャッジ時間 | 22,617 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#ifdef LOCAL#define _GLIBCXX_DEBUG#define __clock__#else#pragma GCC optimize("Ofast")#endif#include<bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using VI = vector<ll>;using VV = vector<VI>;using VS = vector<string>;using PII = pair<ll, ll>;// tourist settemplate <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) {return '"' + s + '"';}string to_string(const char* s) {return to_string((string) s);}string to_string(bool b) {return (b ? "true" : "false");}string to_string(vector<bool> v) {bool first = true;string res = "{";for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) {res += ", ";}first = false;res += to_string(v[i]);}res += "}";return res;}template <size_t N>string to_string(bitset<N> v) {string res = "";for (size_t i = 0; i < N; i++) {res += static_cast<char>('0' + v[i]);}return res;}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";}void debug_out() { cerr << '\n'; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}#ifdef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 42#endif// tourist set endtemplate<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; }#define FOR(i,a,b) for(ll i=(a);i<(b);++i)#define rep(i,b) FOR(i, 0, b)#define ALL(v) (v).begin(), (v).end()#define p(s) cout<<(s)<<'\n'#define p2(s, t) cout << (s) << " " << (t) << '\n'#define br() p("")#define pn(s) cout << (#s) << " " << (s) << '\n'#define SZ(x) ((int)(x).size())#define SORT(A) sort(ALL(A))#define RSORT(A) sort(ALL(A), greater<ll>())#define MP make_pair#define p_yes() p("Yes")#define p_no() p("No")ll SUM(VI& V){return accumulate(ALL(V), 0LL);}ll MIN(VI& V){return *min_element(ALL(V));}ll MAX(VI& V){return *max_element(ALL(V));}void print_vector(VI& V){ll n = V.size();rep(i, n){if(i) cout << ' ';cout << V[i];}cout << endl;}ll gcd(ll a,ll b){if(b == 0) return a;return gcd(b,a%b);}ll lcm(ll a,ll b){ll g = gcd(a,b);return a / g * b;}// long doubleusing ld = long double;#define EPS (1e-14)#define equals(a,b) (fabs((a)-(b)) < EPS)void no(){p_no(); exit(0);}void yes(){p_yes(); exit(0);}const ll mod = 1e9 + 7;const ll inf = 1e18;const double PI = acos(-1);// snuke's mint// auto mod int// https://youtu.be/L8grWxBlIZ4?t=9858// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize// https://youtu.be/8uowVvQ_-Mo?t=1329 : division// const int mod = 1000000007;struct mint {ll x; // typedef long long ll;mint(ll x=0):x((x%mod+mod)%mod){}mint operator-() const { return mint(-x);}mint& operator+=(const mint a) {if ((x += a.x) >= mod) x -= mod;return *this;}mint& operator-=(const mint a) {if ((x += mod-a.x) >= mod) x -= mod;return *this;}mint& operator*=(const mint a) {(x *= a.x) %= mod;return *this;}mint operator+(const mint a) const {mint res(*this);return res+=a;}mint operator-(const mint a) const {mint res(*this);return res-=a;}mint operator*(const mint a) const {mint res(*this);return res*=a;}mint pow(ll t) const {if (!t) return 1;mint a = pow(t>>1);a *= a;if (t&1) a *= *this;return a;}// for prime modmint inv() const {return pow(mod-2);}mint& operator/=(const mint a) {return (*this) *= a.inv();}mint operator/(const mint a) const {mint res(*this);return res/=a;}};const int N_MAX = 2000010; // 10^6ll Per[N_MAX] = {}; // n!ll Per_inv[N_MAX] = {}; //(n!)^-1ll nCr(ll n, ll r){if(n<r) return 0;if (n == r || r == 0)return 1;elsereturn Per[n] * Per_inv[n-r] % mod * Per_inv[r] % mod;}// a^b mod pll mod_pow(ll a, ll b){if(b==0) return 1;// 肩が奇数if(b%2==1){return a * mod_pow(a, b-1) % mod;}else{return mod_pow(a*a % mod, b/2) % mod;}}void prepare_nCr(){Per[0] = 1;Per_inv[0] = 1;// nCr高速化準備Per[1] = 1;FOR(i, 2, N_MAX){Per[i] = i * Per[i-1] % mod;}Per_inv[1] = 1;FOR(i, 2, N_MAX){Per_inv[i] = mod_pow(Per[i], mod-2);}}ll nHr(ll n, ll r){return nCr(n-1+r, n-1);}int main(){cin.tie(0);ios::sync_with_stdio(false);// inputll N,M;cin>>N>>M;prepare_nCr();mint ans = 0;rep(i,M){if(i%2==0){ans += nCr(M, i) * mod_pow(M-i, N);}else{ans -= nCr(M, i) * mod_pow(M-i, N);}}p(ans.x);return 0;}