#242734 (C++14) No.665 Bernoulli Bernoulli

提出ソース

結果

問題	No.665 Bernoulli Bernoulli
ユーザー	しらっ亭
提出日時	2018-03-09 23:00:01
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	342 ms / 2,000 ms
コード長	6,899 bytes
コンパイル時間	1,187 ms
コンパイル使用メモリ	120,548 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-04-18 17:52:30
合計ジャッジ時間	7,002 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	342 ms 5,376 KB
testcase_03	AC	328 ms 5,376 KB
testcase_04	AC	317 ms 5,376 KB
testcase_05	AC	287 ms 5,376 KB
testcase_06	AC	289 ms 5,376 KB
testcase_07	AC	278 ms 5,376 KB
testcase_08	AC	280 ms 5,376 KB
testcase_09	AC	320 ms 5,376 KB
testcase_10	AC	280 ms 5,376 KB
testcase_11	AC	323 ms 5,376 KB
testcase_12	AC	318 ms 5,376 KB
testcase_13	AC	323 ms 5,376 KB
testcase_14	AC	332 ms 5,376 KB
testcase_15	AC	285 ms 5,376 KB
testcase_16	AC	296 ms 5,376 KB
testcase_17	AC	292 ms 5,376 KB
testcase_18	AC	282 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <tuple>
#include <cstring>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

const int mod = 1e9+7;

template<int MOD> struct Mint {
	int x;
	Mint() : x(0) {}
	Mint(int y) : x(y >= 0 ? y % MOD : MOD - (-y) % MOD) {}
	Mint(int64_t sll) : x(sll % MOD) { if (x < 0) x += MOD; }
	Mint &operator+=(const Mint &rhs){ if((x += rhs.x) >= MOD) x -= MOD; return *this; }
	Mint &operator-=(const Mint &rhs){ if((x += MOD - rhs.x) >= MOD) x -= MOD; return *this; }
	Mint &operator*=(const Mint &rhs){ x = 1LL*x*rhs.x % MOD; return *this; }
	Mint &operator/=(const Mint &rhs){ x = (1LL*x*rhs.inv().x) % MOD; return *this; }
	Mint operator-() const { return Mint(-x); }
	Mint operator+(const Mint &rhs) const { return Mint(*this) += rhs; }
	Mint operator-(const Mint &rhs) const { return Mint(*this) -= rhs; }
	Mint operator*(const Mint &rhs) const { return Mint(*this) *= rhs; }
	Mint operator/(const Mint &rhs) const { return Mint(*this) /= rhs; }
	bool operator<(const Mint &rhs) const { return x < rhs.x; }
	Mint inv() const {
		assert(x != 0);
		signed a = x, b = MOD, u = 1, v = 0, t;
		while (b) { t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); }
		return Mint(u);
	}
	Mint operator^(uint64_t t) const {
		Mint e = *this, res = 1;
		for(; t; e *= e, t>>=1) if (t & 1) res *= e;
		return res;
	}
};
template<int MOD> ostream &operator<<(ostream &os, const Mint<MOD> &rhs) { return os << rhs.x; }
template<int MOD> istream &operator>>(istream &is, Mint<MOD> &rhs) { int64_t s; is >> s; rhs = Mint<MOD>(s); return is; };

using mint = Mint<mod>;
using vm=vector<mint>;using vvm=vector<vm>;using vvvm=vector<vvm>;

mint naive(ll n, ll k) {
	mint sum = 0;

	rep(i, 1, n+1) {
		mint x = mint(i) ^ k;
		sum += x;
	}
	return sum;
}

const int SET_FACT_MAX = 10004;
mint fact[SET_FACT_MAX];
mint revFact[SET_FACT_MAX];

void setFact() {
	const int N = SET_FACT_MAX;
	fact[0] = 1;
	for (int i = 1; i < N; i++) {
		fact[i] = fact[i - 1] * i;
	}
	revFact[N - 1] = fact[N - 1] ^ (mod - 2);
	for (int i = N - 2; i >= 0; i--) {
		revFact[i] = revFact[i + 1] * (i + 1);
	}
}

mint nPr(int n, int r) { return n >= r ? fact[n] * revFact[n - r] : 0; }
mint nCr(int n, int r) { return nPr(n, r) * revFact[r]; }
mint nHr(int n, int r) { return n == 0 && r == 0 ? 1 : nCr(n + r - 1, r); }

mint solve() {
	ll n = ri(), k = ri();

	setFact();


	vm B(k+1);
	vm C(k+1);

	B[0] = 1;
	rep(i, 1, k+1) {
		rep(j, i) {
			B[i] -= nCr(i+1, j) * B[j];
		}
		B[i] /= (i + 1);
	}

	mint m((int)(n % mod));
	m = m + 1;

	mint ans = 0;

	rep(j, k+1) {
		ans += nCr(k+1, j) * B[j] * (m ^ (k+1-j));
	}
	ans /= (int)(k + 1);

	return ans;

}

void Main() {
	cout << solve() << endl;
}
signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}

yukicoder

結果

テストケース

ソースコード