#384833 (C++14) No.895 MESE

• 問題: No.895 MESE
• ユーザー: toma
• 提出日時: 2019-09-28 01:10:33
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,572 bytes
• コンパイル時間: 1,781 ms
• コンパイル使用メモリ: 172,680 KB
• 実行使用メモリ: 6,656 KB
• 最終ジャッジ日時: 2024-09-25 04:13:25
• 合計ジャッジ時間: 2,890 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	7 ms; 6,528 KB
testcase_01	AC	7 ms; 6,400 KB
testcase_02	AC	7 ms; 6,400 KB
testcase_03	AC	7 ms; 6,400 KB
testcase_04	AC	7 ms; 6,528 KB
testcase_05	AC	7 ms; 6,400 KB
testcase_06	AC	7 ms; 6,400 KB
testcase_07	AC	7 ms; 6,400 KB
testcase_08	AC	7 ms; 6,528 KB
testcase_09	AC	7 ms; 6,528 KB
testcase_10	AC	7 ms; 6,400 KB
testcase_11	AC	7 ms; 6,400 KB
testcase_12	AC	6 ms; 6,400 KB
testcase_13	AC	11 ms; 6,528 KB
testcase_14	AC	16 ms; 6,528 KB
testcase_15	AC	18 ms; 6,528 KB
testcase_16	AC	13 ms; 6,528 KB
testcase_17	AC	8 ms; 6,400 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-

ソースコード

#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;

struct ModInt {
	static const ll MOD = 1000000007;

	// constructors etc
	ModInt() :num(1ll) {}
	ModInt(ll num_) :num(num_%MOD) {}
	ModInt(const ModInt& modint) :num(modint.num%MOD) {}
	ll get()const { return num; }

	// operator etc
	// operator ll() const { return num; }
	// ll operator*() { return num; }
	ModInt& operator+=(const ModInt& r) { (num += r.num) %= MOD; return *this; }
	ModInt& operator-=(const ModInt& r) { (num += -r.num + MOD) %= MOD; return *this; }
	ModInt& operator*=(const ModInt& r) { (num *= r.num) %= MOD; return *this; }
	ModInt& operator/=(const ModInt& r) { (num *= r.inv().num) %= MOD; return *this; }
	ModInt pow(const ModInt& r)const {
		ll res = 1;
		ll x = num;
		ll n = r.num;
		while (n > 0) {
			if (n & 1)res = (res*x) % MOD;
			x = (x*x) % MOD;
			n >>= 1;
		}
		return res;
	}
	ModInt inv()const { return this->pow(MOD - 2); }

	ModInt operator+(const ModInt& r)const { return ModInt(*this) += r; }
	ModInt operator-(const ModInt& r)const { return ModInt(*this) -= r; }
	ModInt operator*(const ModInt& r)const { return ModInt(*this) *= r; }
	ModInt operator/(const ModInt& r)const { return ModInt(*this) /= r; }
	ModInt operator+(const ll& r)const { return *this + ModInt(r); }
	ModInt operator-(const ll& r)const { return *this - ModInt(r); }
	ModInt operator*(const ll& r)const { return *this * ModInt(r); }
	ModInt operator/(const ll& r)const { return *this / ModInt(r); }

private:
	ll num;
};
ostream& operator<<(ostream& stream, const ModInt& val) { stream << val.get(); return stream; }

struct Comb {
	static constexpr ll LIM = 200000;
	static vector<ModInt> fact, inv;

	static void init() {
		fact.resize(LIM, 1);
		inv.resize(LIM, 1);

		REP(i, 1, LIM)fact[i] = fact[i - 1] * i;
		inv[LIM - 1] = fact[LIM - 1].inv();
		for (ll i = LIM - 2; i > 0; i--)inv[i] = inv[i + 1] * (i + 1);
	}

	static ll comb(ll n, ll k) {
		if (n < k)return 0ll;
		return (fact[n] * inv[k] * inv[n - k]).get();
	}
};
vector<ModInt> Comb::fact;
vector<ModInt> Comb::inv;

int main()
{
	ll a, b, c;
	cin >> a >> b >> c;
	ll total = a + b + c;

	Comb::init();

	ModInt res(0);
	REP(i, 1, a + 1) {
		ll na = a - i;
		ll nb = b - 1;
		ll nc = c;
		ll ntotal = na + nb + nc;
		auto tres = ModInt(2).pow(ntotal) - 1;
		nc--; ntotal--;
		tres *= Comb::fact[ntotal];
		tres *= Comb::inv[na];
		tres *= Comb::inv[nb];
		tres *= Comb::inv[nc];
		res += tres;
	}
	cout << res.get() << endl;
	return 0;
}