結果
| 問題 | No.895 MESE |
| ユーザー |
 Haar
|
| 提出日時 | 2019-09-27 22:08:54 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 243 ms / 2,000 ms |
| コード長 | 7,414 bytes |
| コンパイル時間 | 2,565 ms |
| コンパイル使用メモリ | 204,296 KB |
| 最終ジャッジ日時 | 2025-01-07 19:25:27 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#include <bits/stdc++.h>#define LLI long long int#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)#define REP(v, n) FOR(v, 0, n)#define REPE(v, n) FORE(v, 0, n)#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)#define ALL(x) (x).begin(), (x).end()#define RALL(x) (x).rbegin(), (x).rend()#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)#define EXIST(c,x) ((c).find(x) != (c).end())#define fst first#define snd second#define popcount __builtin_popcount#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())#define bit(i) (1LL<<(i))#ifdef DEBUG#include <misc/C++/Debug.cpp>#else#define dump(...) ((void)0)#endif#define gcd __gcdusing namespace std;template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}struct Init{Init(){cin.tie(0);ios::sync_with_stdio(false);}}init;const LLI mod = 1e9+7;template <uint32_t M> class ModInt{public:uint64_t val;ModInt(): val(0){}ModInt(int64_t n){if(n >= M) val = n % M;else if(n < 0) val = n % M + M;else val = n;}inline constexpr ModInt operator+(const ModInt &a) const {return ModInt((val+a.val)%M);}inline constexpr ModInt operator-(const ModInt &a) const {return ModInt((val-a.val+M)%M);}inline constexpr ModInt operator*(const ModInt &a) const {return ModInt((val*a.val)%M);}inline constexpr ModInt operator/(const ModInt &a) const {return ModInt((val*a.inv().val)%M);}inline constexpr ModInt& operator=(const ModInt &a){val = a.val; return *this;}inline constexpr ModInt& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;}inline constexpr ModInt& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}inline constexpr ModInt& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;}inline constexpr ModInt& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;}inline constexpr bool operator==(const ModInt &a) const {return val==a.val;}inline constexpr bool operator!=(const ModInt &a) const {return val!=a.val;}inline constexpr ModInt& operator++(){*this += 1; return *this;}inline constexpr ModInt& operator--(){*this -= 1; return *this;}inline constexpr ModInt operator++(int){ModInt t = *this; *this += 1; return t;}inline constexpr ModInt operator--(int){ModInt t = *this; *this -= 1; return t;}inline constexpr static ModInt power(int64_t n, int64_t p){ModInt ret = 1, e = n;for(; p; e *= e, p >>= 1) if(p&1) ret *= e;return ret;}inline constexpr ModInt power(int64_t p) const {return power(val,p);}inline constexpr ModInt inv() const {int64_t a = val, b = M, u = 1, v = 0;while(b){int64_t t = a/b;a -= t*b; swap(a,b);u -= t*v; swap(u,v);}u %= M;if(u < 0) u += M;return u;}};template <uint32_t M> ModInt<M> operator-(const ModInt<M> &a){return M-a.val;}template <uint32_t M> ModInt<M> operator+(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)+b.val);}template <uint32_t M> ModInt<M> operator-(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)-b.val);}template <uint32_t M> ModInt<M> operator*(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)*b.val);}template <uint32_t M> ModInt<M> operator/(int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)/b.val);}template <uint32_t M> istream& operator>>(istream &is, ModInt<M> &a){is >> a.val; return is;}template <uint32_t M> ostream& operator<<(ostream &os, const ModInt<M> &a){ os << a.val; return os;}/*** @attention 使用前にinit関数を呼び出す*/template <typename T> class CombUtilsMint{public:static vector<T> facto;static vector<T> ifacto;static void init(int N){facto.assign(N+1, 1);ifacto.assign(N+1, 1);FORE(i,1,N){facto[i] = facto[i-1] * i;}ifacto[N] = facto[N].inv();REV(i,N-1,0){ifacto[i] = ifacto[i+1] * (i+1);}}static T f(int64_t i){assert(i < facto.size());return facto[i];}static T finv(int64_t i){assert(i < ifacto.size());return ifacto[i];}static T P(int64_t n, int64_t k);static T C(int64_t n, int64_t k);static T H(int64_t n, int64_t k);static T stirling_number(int64_t n, int64_t k);static T bell_number(int64_t n, int64_t k);static vector<T> bernoulli_number(int64_t n);static T catalan_number(int64_t n);};template <typename T> vector<T> CombUtilsMint<T>::facto = vector<T>();template <typename T> vector<T> CombUtilsMint<T>::ifacto = vector<T>();template <typename T> T CombUtilsMint<T>::P(int64_t n, int64_t k){if(n < k or n < 0 or k < 0) return 0;return f(n) * finv(n-k);}template <typename T> T CombUtilsMint<T>::C(int64_t n, int64_t k){if(n < k or n < 0 or k < 0) return 0;return P(n,k) * finv(k);}template <typename T> T CombUtilsMint<T>::H(int64_t n, int64_t k){if(n == 0 and k == 0) return 1;return C(n+k-1, k);}using mint = ModInt<mod>;using C = CombUtilsMint<mint>;template <typename T> class LazySegmentTreeRangeAddQuery{private:int size;vector<T> vec;T e;inline void propagate(int i){if(i<size/2){vec[i*2+1] = vec[i] + vec[i*2+1];vec[i*2+2] = vec[i] + vec[i*2+2];vec[i] = e;}}inline void update_aux(int s, int t, int i, int l, int r, const T &x){if(r <= s || t <= l) return;else if(s <= l && r <= t) vec[i] = vec[i] + x;else{propagate(i);update_aux(s,t,i*2+1,l,(l+r)/2,x);update_aux(s,t,i*2+2,(l+r)/2,r,x);}}inline void get_aux(int i){if(i>0) get_aux((i-1)/2);propagate(i);}public:LazySegmentTreeRangeAddQuery(int n, const T &e): e(e){size = 1;while(size < n) size *= 2;size = size*2-1;vec = vector<T>(size, e);}inline void update(int s, int t, const T &x){update_aux(s,t,0,0,size/2+1,x);}inline T get(int i){int j=i+size/2;get_aux((j-1)/2);return vec[j];}};int main(){C::init(500000);int a,b,c;while(cin >> a >> b >> c){int n = a+b+c;LazySegmentTreeRangeAddQuery<mint> seg(n, 0);FORE(i,c,n-2){int m = n-c;auto t = C::f(m-1) * C::finv(a-1) * C::finv(b);if(i-c-b >= 0) t -= C::f(i-c) * C::finv(b) * C::finv(i-c-b);//dump(t);if(c != 1){auto s = C::f(i-2) * C::finv(c-2) * C::finv(i-2-(c-2));seg.update(0, i-1, s*t);}{auto s = C::f(i-1) * C::finv(c-1) * C::finv(i-1-(c-1));seg.update(i-1, i, s*t);}}mint ans = 0;REP(i,n){ans += seg.get(i) * mint::power(2,i);}cout << ans << endl;}return 0;}