#535924 (C++14) No.1181 Product Sum for All Subsets

• 問題: No.1181 Product Sum for All Subsets
• ユーザー: uzzy
• 提出日時: 2020-08-21 23:22:11
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 8 ms / 2,000 ms
• コード長: 1,529 bytes
• コンパイル時間: 2,486 ms
• コンパイル使用メモリ: 184,328 KB
• 実行使用メモリ: 5,888 KB
• 最終ジャッジ日時: 2024-10-15 06:20:42
• 合計ジャッジ時間: 3,582 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	6 ms; 5,760 KB
testcase_01	AC	6 ms; 5,760 KB
testcase_02	AC	6 ms; 5,888 KB
testcase_03	AC	5 ms; 5,888 KB
testcase_04	AC	6 ms; 5,888 KB
testcase_05	AC	6 ms; 5,760 KB
testcase_06	AC	6 ms; 5,760 KB
testcase_07	AC	7 ms; 5,760 KB
testcase_08	AC	6 ms; 5,888 KB
testcase_09	AC	6 ms; 5,760 KB
testcase_10	AC	6 ms; 5,760 KB
testcase_11	AC	6 ms; 5,760 KB
testcase_12	AC	8 ms; 5,888 KB
testcase_13	AC	7 ms; 5,888 KB
testcase_14	AC	8 ms; 5,760 KB
testcase_15	AC	8 ms; 5,760 KB
testcase_16	AC	6 ms; 5,760 KB
testcase_17	AC	6 ms; 5,632 KB
testcase_18	AC	7 ms; 5,888 KB
testcase_19	AC	7 ms; 5,632 KB
testcase_20	AC	8 ms; 5,888 KB
testcase_21	AC	7 ms; 5,760 KB
testcase_22	AC	6 ms; 5,632 KB
testcase_23	AC	6 ms; 5,760 KB
testcase_24	AC	7 ms; 5,888 KB
testcase_25	AC	7 ms; 5,888 KB
testcase_26	AC	7 ms; 5,888 KB
testcase_27	AC	6 ms; 5,632 KB
testcase_28	AC	8 ms; 5,760 KB
testcase_29	AC	8 ms; 5,888 KB

ソースコード

#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 1e9 + 7;
const int IMAX = 200000;
constexpr ll modpow(ll A, ll B) {
	ll kotae = 1;
	while (B > 0) {
		if (B & 1) kotae = kotae * A % mod;
		A = A * A % mod;
		B >>= 1;
	}
	return kotae;
}
class unko {
public:
	int fac[IMAX + 1], ifac[IMAX + 1], inv[IMAX + 1];
	unko() : fac(), ifac(), inv() {
		fac[0] = 1;
		rep1(i, IMAX) fac[i] = ll(fac[i - 1]) * i % mod;
		ifac[IMAX] = modpow(fac[IMAX], mod - 2);
		for (int i = IMAX; i > 0; i--) ifac[i - 1] = ll(ifac[i]) * i % mod;
		inv[0] = 1;
		rep1(i, IMAX) inv[i] = ll(ifac[i]) * fac[i - 1] % mod;
	}
	int comb(int A, int B) {
		return ll(fac[A]) * ifac[B] % mod * ifac[A - B] % mod;
	}
} f;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	ll N, K;
	cin >> N >> K;

	ll kotae = 0;
	ll kari = modpow(K % mod, N);
	ll usiro = (K + 1) % mod;
	usiro = usiro * modpow(2, mod - 2) % mod;
	rep(i, N) {
		ll tmp = f.comb(N, i);
		kotae = (kotae + kari * tmp % mod) % mod;

		kari = kari * usiro % mod;
	}
	co(kotae% mod);




	Would you please return 0;
}