結果
| 問題 | No.895 MESE |
| ユーザー |
 tatyam
|
| 提出日時 | 2019-09-27 21:47:18 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 104 ms / 2,000 ms |
| コード長 | 12,979 bytes |
| コンパイル時間 | 2,194 ms |
| コンパイル使用メモリ | 202,224 KB |
| 最終ジャッジ日時 | 2025-01-07 19:23:05 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
コンパイルメッセージ
main.cpp: In function ‘void scan(long long int&)’:
main.cpp:78:38: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
78 | inline void scan(long long &a){ scanf("%lld", &a); }
| ~~~~~^~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;using ll=long long;using ld=long double;using ull=unsigned long long;using uint=unsigned int;using pcc=pair<char,char>;using pii=pair<int,int>;using pll=pair<ll,ll>;using pdd=pair<double,double>;using tuplis=pair<ll,pll>;using tuplis2=pair<pll,ll>;template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;const ll LINF=0x1fffffffffffffff;const ll MINF=0x7fffffffffff;const int INF=0x3fffffff;const ll MOD=1000000007;const ll MODD=998244353;const ld DINF=numeric_limits<ld>::infinity();const ld EPS=1e-9;const ld PI=3.141592653589793238462643383279;const vector<ll>four{0,1,0,-1,0};#define _overload4(_1,_2,_3,_4,name,...) name#define _overload3(_1,_2,_3,name,...) name#define _rep1(n) for(ll i=0;i<n;++i)#define _rep2(i,n) for(ll i=0;i<n;++i)#define _rep3(i,a,b) for(ll i=a;i<b;++i)#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)#define _rrep1(n) for(ll i=(n)-1;i>=0;i--)#define _rrep2(i,n) for(ll i=(n)-1;i>=0;i--)#define _rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)#define each(i,a) for(auto &i:a)#define sum(...) accumulate(range(__VA_ARGS__),0LL)#define dsum(...) accumulate(range(__VA_ARGS__),double(0))#define _range(i) (i).begin(),(i).end()#define _range2(i,k) (i).begin(),(i).begin()+k#define _range3(i,a,b) (i).begin()+a,(i).begin()+b#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)#define _rrange(i) (i).rbegin(),(i).rend()#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)#define elif else if#define unless(a) if(!(a))#define mp make_pair#define mt make_tuple#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type> name(__VA_ARGS__)#define VEC(type,name,size) vector<type> name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;}inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}template<class T> inline constexpr T min(vector<T> &v){return *min_element(range(v));}inline char min(string &v){return *min_element(range(v));}template<class T> inline constexpr T max(vector<T> &v){return *max_element(range(v));}inline char max(string &v){return *max_element(range(v));}inline constexpr ll intpow(ll a,ll b){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;}a*=a;}return ans;}template<typename T>inline constexpr bool chmin(T &mn,const T &cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}template<typename T>inline constexpr bool chmax(T &mx,const T &cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}template<class T> unordered_map<T,ll> press(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); unordered_map<T,ll> ans;rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }template<class T> map<T,ll> press_map(vector<T> &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); map<T,ll> ans; rep(b.size())ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }inline int scan(){ return getchar(); }inline void scan(int &a){ scanf("%d", &a); }inline void scan(unsigned &a){ scanf("%u", &a); }inline void scan(long &a){ scanf("%ld", &a); }inline void scan(long long &a){ scanf("%lld", &a); }inline void scan(unsigned long long &a){ scanf("%llu", &a); }inline void scan(char &a){ cin >> a; }inline void scan(float &a){ scanf("%f", &a); }inline void scan(double &a){ scanf("%lf", &a); }inline void scan(long double &a){ scanf("%Lf", &a); }inline void scan(vector<bool> &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } }inline void scan(char a[]){ scanf("%s", a); }inline void scan(string &a){ cin >> a; }template<class T> inline void scan(vector<T> &vec);template<class T, size_t size> inline void scan(array<T, size> &vec);template<class T, class L> inline void scan(pair<T, L> &p);template<class T, size_t size> inline void scan(T (&vec)[size]);template<class T> inline void scan(vector<T> &vec){ for(auto &i : vec) scan(i); }template<class T, size_t size> inline void scan(array<T, size> &vec){ for(auto &i : vec) scan(i); }template<class T, class L> inline void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }template<class T, size_t size> inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); }template<class T> inline void scan(T &a){ cin>>a; }inline void in(){}template <class Head, class... Tail> inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); }inline void print(){ putchar(' '); }inline void print(const bool &a){ printf("%d", a); }inline void print(const int &a){ printf("%d", a); }inline void print(const unsigned &a){ printf("%u", a); }inline void print(const long &a){ printf("%ld", a); }inline void print(const long long &a){ printf("%lld", a); }inline void print(const unsigned long long &a){ printf("%llu", a); }inline void print(const char &a){ printf("%c", a); }inline void print(const char a[]){ printf("%s", a); }inline void print(const float &a){ printf("%.15f", a); }inline void print(const double &a){ printf("%.15f", a); }inline void print(const long double &a){ printf("%.15Lf", a); }template<class T> void print(const vector<T> &vec);template<class T, size_t size> void print(const array<T, size> &vec);template<class T, class L> void print(const pair<T, L> &p);template<class T, size_t size> inline void print(const T (&vec)[size]);template<class T> void print(const vector<T> &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } }template<class T, size_t size> void print(const array<T, size> &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' ');print(*i); } }template<class T, class L> void print(const pair<T, L> &p){ print(p.first); putchar(' '); print(p.second); }template<class T, size_t size> inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i);} }template<class T> inline void print(const T &a){ cout << a; }inline int out(){ putchar('\n'); return 0; }template<class T> inline int out(const T &t){ print(t); putchar('\n'); return 0; }template<class Head, class... Tail> inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }template <class T> inline void err(T t){cerr<<t<<'\n';}template<class Head, class... Tail> inline void err(const Head &head, const Tail&... tail){ cerr<<head<<' '; err(tail...); }inline void err(){cerr<<'\n';}inline int first(const bool &i){return out(i?"first":"second");}inline int yes(const bool &i){return out(i?"yes":"no");}inline int Yes(const bool &i){return out(i?"Yes":"No");}inline int YES(const bool &i){return out(i?"YES":"NO");}inline int Yay(const bool &i){return out(i?"Yay!":":(");}inline int Possible(const bool &i){return out(i?"Possible":"Impossible");}inline int POSSIBLE(const bool &i){return out(i?"POSSIBLE":"IMPOSSIBLE");}inline void Case(ll i){printf("Case #%lld: ",i);}constexpr ll mod = MOD;inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y){ ll g = a; x = 1; y = 0; if(b){ g = extgcd(b, a % b, y, x); y -= a / b * x; } return g; }inline constexpr ll invmod(ll a, ll m = mod){ ll x = 0, y = 0; extgcd(a, m, x, y); return (x + m) % m; }struct Modint{ll num;constexpr Modint() : num() { num = 0; }constexpr Modint(ll x) : num() { num = x % mod; if(num < 0) num += mod; }constexpr Modint(const Modint &x) : num(x) {}inline constexpr Modint& operator= (int x){ num = x % mod; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator= (ll x){ num = x % mod; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator= (Modint x){ num = x.num; return *this; }inline constexpr Modint operator+ (int x) const { return Modint(num + x); }inline constexpr Modint operator+ (ll x) const { return Modint(num + x); }inline constexpr Modint operator+ (Modint x) const { ll a = num + x.num; if(a >= mod) a -= mod; return Modint{a}; }inline constexpr Modint& operator+=(int x){ num += x; num %= mod; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator+=(ll x){ num += x; num %= mod; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator+=(Modint x){ num += x.num; if(num >= mod) num -= mod; return *this; }inline constexpr Modint& operator++(){ if(num == mod - 1) num = 0; else num++; return *this; }inline constexpr Modint operator++(int){ Modint ans = *this; if(num == mod - 1) num = 0; else num++; return ans; }inline constexpr Modint operator- () const { if(num == 0) return 0; return Modint(mod - num); }inline constexpr Modint operator- (int x) const { return Modint(num - x); }inline constexpr Modint operator- (ll x) const { return Modint(num - x); }inline constexpr Modint operator- (Modint x) const { ll a = num - x.num; if(a < 0) a += mod; return Modint{a}; }inline constexpr Modint& operator-=(int x){ num -= x; num %= mod; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator-=(ll x){ num -= x; num %= mod; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator-=(Modint x){ num -= x.num; if(num < 0) num += mod; return *this; }inline constexpr Modint& operator--(){ if(num == 0) num = mod - 1; else num--; return *this; }inline constexpr Modint operator--(int){ Modint ans = *this; if(num == 0) num = mod - 1; else num--; return ans; }inline constexpr Modint operator* (int x) const { return Modint(num * (x % mod)); }inline constexpr Modint operator* (ll x) const { return Modint(num * (x % mod)); }inline constexpr Modint operator* (Modint x) const { return Modint{num * x.num % mod}; }inline constexpr Modint& operator*=(int x){ num *= Modint(x); num %= mod; return *this; }inline constexpr Modint& operator*=(ll x){ num *= Modint(x); num %= mod; return *this; }inline constexpr Modint& operator*=(Modint x){ num *= x.num; num %= mod; return *this; }inline constexpr Modint operator/ (int x) const { return Modint(num * invmod(Modint(x), mod)); }inline constexpr Modint operator/ (ll x) const { return Modint(num * invmod(Modint(x), mod)); }inline constexpr Modint operator/ (Modint x) const { return Modint{num * invmod(x.num, mod) % mod}; }inline constexpr Modint& operator/=(int x){ num *= invmod(Modint(x), mod); num %= mod; return *this; }inline constexpr Modint& operator/=(ll x){ num *= invmod(Modint(x), mod); num %= mod; return *this; }inline constexpr Modint& operator/=(Modint x){ num *= invmod(x.num, mod); num %= mod; return *this; }inline constexpr Modint pow(ll x) const { ll i = 1; Modint ans = 1, cnt = *this; while(i <= x){ if(x & i){ ans *= cnt; x ^= i; } cnt *= cnt; i *=2; } return ans; }inline constexpr operator ll() const { return num; }};std::istream& operator>>(std::istream& is, Modint& x) { is >> x.num; x = Modint(x.num); return is; }inline constexpr Modint operator""_M(ull x) { return Modint(x); }std::vector<Modint> fac(1, 1), inv(1, 1);inline void reserve(ll a){if(fac.size() >= a) return;if(a < fac.size() * 2) a = fac.size() * 2;if(a >= mod) a = mod;while(fac.size() < a) fac.push_back(fac.back() * ll(fac.size()));inv.resize(fac.size());inv.back() = Modint(1) / fac.back();for(ll i = inv.size() - 1; !inv[i - 1]; i--) inv[i - 1] = inv[i] * i;}inline Modint fact(ll n){ if(n < 0) return 0; reserve(n + 1); return fac[n]; }inline Modint perm(ll n, ll r){ if(r < 0 || n < r) return 0; reserve(n + 1); return fac[n] * inv[n - r]; }inline Modint comb(ll n, ll r){ if(r < 0 || n < r) return 0; reserve(n + 1); return fac[n] * inv[r] * inv[n - r]; }inline Modint Mcomb(ll n, ll r){ return comb(n + r - 1, n - 1); } // r個をn部屋に分けるsigned main(){LL(a,b,c);Modint ans=0;rep(i,c,a+b+c-1){Modint cnt=comb(i-1,c-1)*comb(a+b-1,b)-comb(i-1,c-1)*comb(i-c,b);ans+=cnt*2_M .pow(i-1)+cnt*(c-1)/(i-1)*(2_M .pow(i-1)-1);}out(ans);}