結果
問題 | No.1846 Good Binary Matrix |
ユーザー | milanis48663220 |
提出日時 | 2022-02-18 23:02:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 529 ms / 2,000 ms |
コード長 | 4,109 bytes |
コンパイル時間 | 1,059 ms |
コンパイル使用メモリ | 117,144 KB |
実行使用メモリ | 50,524 KB |
最終ジャッジ日時 | 2023-09-11 19:59:07 |
合計ジャッジ時間 | 10,718 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 111 ms
50,228 KB |
testcase_01 | AC | 110 ms
50,264 KB |
testcase_02 | AC | 110 ms
50,212 KB |
testcase_03 | AC | 102 ms
50,424 KB |
testcase_04 | AC | 106 ms
50,240 KB |
testcase_05 | AC | 104 ms
50,300 KB |
testcase_06 | AC | 106 ms
50,216 KB |
testcase_07 | AC | 104 ms
50,228 KB |
testcase_08 | AC | 107 ms
50,368 KB |
testcase_09 | AC | 107 ms
50,200 KB |
testcase_10 | AC | 109 ms
50,200 KB |
testcase_11 | AC | 110 ms
50,512 KB |
testcase_12 | AC | 109 ms
50,264 KB |
testcase_13 | AC | 109 ms
50,308 KB |
testcase_14 | AC | 111 ms
50,204 KB |
testcase_15 | AC | 118 ms
50,232 KB |
testcase_16 | AC | 525 ms
50,204 KB |
testcase_17 | AC | 525 ms
50,228 KB |
testcase_18 | AC | 510 ms
50,300 KB |
testcase_19 | AC | 499 ms
50,368 KB |
testcase_20 | AC | 529 ms
50,304 KB |
testcase_21 | AC | 235 ms
50,216 KB |
testcase_22 | AC | 247 ms
50,248 KB |
testcase_23 | AC | 115 ms
50,204 KB |
testcase_24 | AC | 110 ms
50,524 KB |
testcase_25 | AC | 410 ms
50,232 KB |
testcase_26 | AC | 301 ms
50,208 KB |
testcase_27 | AC | 110 ms
50,296 KB |
testcase_28 | AC | 143 ms
50,368 KB |
testcase_29 | AC | 219 ms
50,212 KB |
testcase_30 | AC | 417 ms
50,368 KB |
testcase_31 | AC | 383 ms
50,236 KB |
testcase_32 | AC | 446 ms
50,232 KB |
testcase_33 | AC | 484 ms
50,364 KB |
testcase_34 | AC | 112 ms
50,224 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template<typename T> vector<vector<T>> vec2d(int n, int m, T v){ return vector<vector<T>>(n, vector<T>(m, v)); } template<typename T> vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){ return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v))); } template<typename T> void print_vector(vector<T> v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const ll MOD = 1000000007; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v < 0) _v = (_v%MOD)+MOD; if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } ModInt &operator+=(ll n){ v = (v+n)%MOD; return *this; } ModInt &operator-=(ll n){ v = (v-n+MOD)%MOD; return *this; } ModInt &operator*=(ll n){ v = (v*n+MOD)%MOD; return *this; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } ModInt &operator+=(ModInt n){ v = (v+n.v)%MOD; return *this; } ModInt &operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; return *this; } ModInt &operator*=(ModInt n){ v = (v*n.v)%MOD; return *this; } bool operator==(ModInt n){ return v == n.v; } bool operator!=(ModInt n){ return v != n.v; } ModInt &operator=(ll n){ v = n%MOD; return *this; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt pow(ModInt a, ll n) { assert(n >= 0); ModInt ans = 1; while (n > 0) { if (n&1) ans = ans*a; a = a*a; n >>= 1; } return ans; } #define N_MAX 2000002 ModInt inv[N_MAX],fac[N_MAX],finv[N_MAX]; void init(){ fac[0]=1;fac[1]=1; finv[0]=1;finv[1]=1; inv[1]=1; for(int i=2;i<N_MAX;i++){ inv[i]=ModInt(MOD)-inv[MOD%i]*(MOD/i); fac[i]=fac[i-1]*(ll) i; finv[i]=finv[i-1]*inv[i]; } } ModInt comb(ll n, ll r){ if(n < r){ return ModInt(0); }else{ return fac[n]*finv[r]*finv[n-r]; } } using mint = ModInt; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; init(); ll h, w; cin >> h >> w; mint ans = 0; mint p = pow(mint(2), h*w); mint inv2 = mint(2).inv(); for(int i = 0; i <= h; i++){ mint pw = pow(pow(inv2, w)*(-1), i); ans += p*pw*pow(mint(1)-pow(inv2, h-i), w)*comb(h, i); // cout << i << ' ' << p*pw*pow(mint(1)-pow(inv2, h-i), w)*comb(h, i) << endl; } cout << ans << endl; }