結果
| 問題 | No.895 MESE |
| ユーザー |
 ningenMe
|
| 提出日時 | 2019-09-27 23:14:04 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 66 ms / 2,000 ms |
| コード長 | 10,316 bytes |
| コンパイル時間 | 1,796 ms |
| コンパイル使用メモリ | 179,448 KB |
| 実行使用メモリ | 30,908 KB |
| 最終ジャッジ日時 | 2024-09-25 01:40:15 |
| 合計ジャッジ時間 | 3,555 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;#define REP(i,n) for(long long i = 0; i < (n); i++)#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)#define ALL(obj) (obj).begin(),(obj).end()#define SPEED cin.tie(0);ios::sync_with_stdio(false);template<class T> using V = vector<T>;template<class T, class U> using P = pair<T, U>;template<class T> using PQ = priority_queue<T>;template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;constexpr long long MOD = (long long)1e9 + 7;constexpr long long MOD2 = 998244353;constexpr long long HIGHINF = (long long)1e18;constexpr long long LOWINF = (long long)1e15;constexpr long double PI = 3.1415926535897932384626433;template <class T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}template <class... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")<< obj[i]; o << "}"; return o;}template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}void print(void) {cout << endl;}template <class Head> void print(Head&& head) {cout << head;print();}template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}template <class T> void chmax(T& a, const T b){a=max(a,b);}template <class T> void chmin(T& a, const T b){a=min(a,b);}void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}template<class T> class LazySegmentTree {size_t length; //セグメント木の最下段の要素の数(vectorの要素の数を超える2べきの数)size_t height; //セグメント木の高さT unitNode; //nodeの単位元T unitLazy; //lazyの単位元vector<T> node; //nodevector<T> lazy; //lazyvector<int> width; //widthfunction<T(T,T)> funcNode; //node同士の演算function<T(T,T)> funcLazy; //lazy同士の演算function<T(T,T,int)> funcMerge; //nodeとlazyの演算public://vectorで初期化LazySegmentTree(const vector<T> & vec, const T unitNode, const T unitLazy, function<T(T,T)> funcNode, function<T(T,T)> funcLazy,function<T(T,T,int)> funcMerge): unitNode(unitNode), unitLazy(unitLazy), funcNode(funcNode),funcLazy(funcLazy),funcMerge(funcMerge) {for (length = 1,height = 0; length < vec.size(); length *= 2, height++);node.resize(2 * length, unitNode);lazy.resize(2 * length, unitLazy);for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i];for (int i = length - 1; i >= 0; --i) node[i] = funcNode(node[(i<<1)+0],node[(i<<1)+1]);width.resize(2 * length, 0);for(int i = length; i < 2*length; ++i) for(int j = i, k = 1; j && !width[j] ; j >>= 1,k <<= 1) width[j] = k;}//同じinitで初期化LazySegmentTree(const size_t num, const T unitNode, const T unitLazy, const T init, function<T(T,T)> funcNode, function<T(T,T)> funcLazy,function<T(T,T,int)> funcMerge): unitNode(unitNode), unitLazy(unitLazy), funcNode(funcNode),funcLazy(funcLazy),funcMerge(funcMerge) {for (length = 1,height = 0; length < num; length *= 2, height++);node.resize(2 * length, unitNode);lazy.resize(2 * length, unitLazy);for (int i = 0; i < num; ++i) node[i + length] = init;for (int i = length - 1; i >= 0; --i) node[i] = funcNode(node[(i<<1)+0],node[(i<<1)+1]);width.resize(2 * length, 0);for(int i = length; i < 2*length; ++i) for(int j = i, k = 1; j && !width[j] ; j >>= 1,k <<= 1) width[j] = k;}//unitだけで初期化LazySegmentTree(const size_t num, const T unitNode, const T unitLazy, function<T(T,T)> funcNode, function<T(T,T)> funcLazy,function<T(T,T,int)>funcMerge): unitNode(unitNode), unitLazy(unitLazy), funcNode(funcNode),funcLazy(funcLazy),funcMerge(funcMerge) {for (length = 1,height = 0; length < num; length *= 2, height++);node.resize(2 * length, unitNode);lazy.resize(2 * length, unitLazy);width.resize(2 * length, 0);for(int i = length; i < 2*length; ++i) for(int j = i, k = 1; j && !width[j] ; j >>= 1,k <<= 1) width[j] = k;}void propagate(int k) {if(lazy[k] == unitLazy) return;node[k] = funcMerge(node[k],lazy[k],width[k]);if(k < length) lazy[2*k+0] = funcLazy(lazy[2*k+0],lazy[k]);if(k < length) lazy[2*k+1] = funcLazy(lazy[2*k+1],lazy[k]);lazy[k] = unitLazy;}//idx : 0-indexedvoid update(int a, int b, T x) {int l = a + length, r = b + length - 1;for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i);for(r++; l < r; l >>=1, r >>=1) {if(l&1) lazy[l] = funcLazy(lazy[l],x), propagate(l),l++;if(r&1) --r,lazy[r] = funcLazy(lazy[r],x), propagate(r);}l = a + length, r = b + length - 1;while ((l>>=1),(r>>=1),l) {if(lazy[l] == unitLazy) node[l] = funcNode(funcMerge(node[(l<<1)+0],lazy[(l<<1)+0],width[(l<<1)+0]),funcMerge(node[(l<<1)+1],lazy[(l<<1)+1],width[(l<<1)+1]));if(lazy[r] == unitLazy) node[r] = funcNode(funcMerge(node[(r<<1)+0],lazy[(r<<1)+0],width[(r<<1)+0]),funcMerge(node[(r<<1)+1],lazy[(r<<1)+1],width[(r<<1)+1]));}}//[l,r)T get(int a, int b) {int l = a + length, r = b + length - 1;for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i);T vl = unitNode, vr = unitNode;for(r++; l < r; l >>=1, r >>=1) {if(l&1) vl = funcNode(vl,funcMerge(node[l],lazy[l],width[l])),l++;if(r&1) r--,vr = funcNode(vr,funcMerge(node[r],lazy[r],width[r]));}return funcNode(vl,vr);}void print(){cout << "height" << " " << height << endl;cout << "node" << endl;for(int i = 1,j = 1; i < 2*length; ++i) {cout << node[i] << " ";if(i==((1<<j)-1) && ++j) cout << endl;}cout << "lazy" << endl;for(int i = 1,j = 1; i < 2*length; ++i) {cout << lazy[i] << " ";if(i==((1<<j)-1) && ++j) cout << endl;}// cout << "width" << endl;// for(int i = 1,j = 1; i < 2*length; ++i) {// cout << width[i] << " ";// if(i==((1<<j)-1) && ++j) cout << endl;// }cout << "vector" << endl;cout << "{ " << get(0,1);for(int i = 1; i < length; ++i) cout << ", " << get(i,i+1);cout << " }" << endl;}};//RUQ + RMQ//verify https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_d//verify https://atcoder.jp/contests/code-festival-2018-final/tasks/code_festival_2018_final_e//RUQ + RMQ//verify https://atcoder.jp/contests/nikkei2019-final/tasks/nikkei2019_final_d// 区間加算 + 区間最小// function<ll(ll,ll)> funcNode = [&](ll l,ll r){return min(l,r);};// function<ll(ll,ll)> funcLazy = [&](ll l,ll r){return l+r;};// function<ll(ll,ll,int)> funcMerge = [&](ll l,ll r,int c){return l+r;};// LazySegmentTree<ll> Seg(N,inf,0,0,funcNode,funcLazy,funcMerge);// 区間加算 + 区間総和// function<ll(ll,ll)> funcNode = [&](ll l,ll r){return l+r;};// function<ll(ll,ll)> funcLazy = [&](ll l,ll r){return l+r;};// function<ll(ll,ll,int)> funcMerge = [&](ll l,ll r,int c){return l+r*c;};// LazySegmentTree<ll> Seg(N,0,0,funcNode,funcLazy,funcMerge);// 区間更新 + 区間総和// function<ll(ll,ll)> funcNode = [&](ll l,ll r){return l+r;};// function<ll(ll,ll)> funcLazy = [&](ll l,ll r){return r;};// function<ll(ll,ll,int)> funcMerge = [&](ll l,ll r,int c){return r!=-2000?r*c:l;};// LazySegmentTree<ll> Seg(N,0,-2000,0,funcNode,funcLazy,funcMerge);// 区間更新 + 区間最大// function<ll(ll,ll)> funcNode = [&](ll l,ll r){return max(l,r);};// function<ll(ll,ll)> funcLazy = [&](ll l,ll r){return r;};// function<ll(ll,ll,int)> funcMerge = [&](ll l,ll r,int c){return r!=0?r:l;};// LazySegmentTree<ll> Seg(N+2,0,0,funcNode,funcLazy,funcMerge);//Pow_Mod O(log(n))long long Pow_Mod(long long x, long long n, long long mod) {long long res = 1;for (; n > 0; n >>= 1, (x *= x) %= mod) if (n & 1) (res *= x) %= mod;return res;}//Inv_Mod O(log(mod))long long Inv_Mod(long long x, long long mod){return Pow_Mod(x,mod-2,mod);}//Factorial_Modvector<long long> Factorial_Mod(long long N, long long mod) {vector<long long> res(N + 1, 1);for (long long i = 1; i <= N; ++i) res[i] = (res[i - 1] * i) % mod;return res;}int main() {ll A,B,C; cin >> A >> B >> C;ll N = A + B + C;auto F = Factorial_Mod(N,MOD);function<ll(ll,ll)> funcNode = [&](ll l,ll r){return (l+r) % MOD;};function<ll(ll,ll)> funcLazy = [&](ll l,ll r){return (l+r) % MOD;};function<ll(ll,ll,int)> funcMerge = [&](ll l,ll r,int c){return (l+r*c) % MOD;};LazySegmentTree<ll> Seg(N,0,0,funcNode,funcLazy,funcMerge);vector<ll> sum(N,0),pow2(N,1);for(ll i = 1; i <= A; ++i) {ll k = i + 2;ll cnt = F[N-k];(cnt *= Inv_Mod(F[A-i],MOD)) %= MOD;(cnt *= Inv_Mod(F[B-1],MOD)) %= MOD;(cnt *= Inv_Mod(F[C-1],MOD)) %= MOD;sum[i+1] += cnt;}for(int i = 1; i < N; ++i) {(sum[i] += sum[i-1]) %= MOD;pow2[i] = (pow2[i-1]*2) % MOD;}ll ans = 0;for(ll i = 0; i < N; ++i) {int j = N-1-i;(ans += (sum[j]*pow2[i]) % MOD ) %= MOD;}cout << ans << endl;return 0;}