結果
問題 | No.1035 Color Box |
ユーザー |
|
提出日時 | 2020-04-24 23:09:33 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 71 ms / 2,000 ms |
コード長 | 2,177 bytes |
コンパイル時間 | 801 ms |
コンパイル使用メモリ | 78,972 KB |
実行使用メモリ | 26,624 KB |
最終ジャッジ日時 | 2024-10-15 03:44:27 |
合計ジャッジ時間 | 4,267 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
ソースコード
#include <iostream>#include <algorithm>#include <vector>#include <map>// #include <bits/stdc++.h>using namespace std;typedef long long ll;int64_t ans;const int64_t MOD = 1e9+7;void add(int64_t& a, int64_t b){a = (a+b) % MOD;}void mul(int64_t& a, int64_t b){a = a*b % MOD;}vector<int64_t> fact, seq_inv, fact_inv;void create_fact_mod(int num){fact[0] = fact[1] = 1;for(int i=2; i<=num; i++) fact[i] = fact[i-1] * i % MOD;}void create_seq_inv_mod(int num){seq_inv[0] = seq_inv[1] = 1;for(int i=2; i<=num; i++) seq_inv[i] = (MOD - MOD/i) * seq_inv[MOD%i] % MOD;}void create_fact_inv_mod(int num){fact_inv[0] = fact_inv[1] = 1;for(int i=2; i<=num; i++) fact_inv[i] = fact_inv[i-1] * seq_inv[i] % MOD;}void create_mod_tables(int num){fact.resize(num+1);seq_inv.resize(num+1);fact_inv.resize(num+1);create_fact_mod(num);create_seq_inv_mod(num);create_fact_inv_mod(num);}int64_t comb_mod(int n, int k){return fact[n] * fact_inv[n-k] % MOD * fact_inv[k] % MOD;}int64_t perm_mod(int n, int k){return fact[n] * fact_inv[n-k] % MOD;}int64_t power_mod(int64_t num, int64_t power){int64_t prod = 1;num %= MOD;while(power > 0){if(power&1) prod = prod * num % MOD;num = num * num % MOD;power >>= 1;}return prod;}int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){int64_t d = a;if(b != 0){d = extgcd(b, a%b, y, x);y -= (a/b) * x;}else{x = 1; y = 0;}return d;}int64_t inv_mod(int64_t a){int64_t x, y;extgcd(a, MOD, x, y);return (MOD + x%MOD) % MOD;}int main(){int n, m;cin >> n >> m;ans = power_mod(m, n);create_mod_tables(1000000);int k = -1;for (int j = m-1; j >= 1; --j) {int64_t xs = 1;mul(xs, k);mul(xs, power_mod(j, n) % MOD);add(xs, MOD);mul(xs, comb_mod(m, j) % MOD);add(xs, MOD);add(ans, xs);add(ans, MOD);k *= -1;}while (ans < 0) {ans = ans;}cout << ans << endl;return 0;}