結果
問題 | No.1102 Remnants |
ユーザー | suta28407928 |
提出日時 | 2020-07-03 23:50:27 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 131 ms / 2,000 ms |
コード長 | 3,725 bytes |
コンパイル時間 | 1,069 ms |
コンパイル使用メモリ | 101,380 KB |
実行使用メモリ | 16,684 KB |
最終ジャッジ日時 | 2024-09-17 05:07:57 |
合計ジャッジ時間 | 3,489 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 20 ms
15,148 KB |
testcase_01 | AC | 20 ms
15,212 KB |
testcase_02 | AC | 19 ms
15,288 KB |
testcase_03 | AC | 19 ms
15,180 KB |
testcase_04 | AC | 20 ms
15,124 KB |
testcase_05 | AC | 81 ms
16,532 KB |
testcase_06 | AC | 35 ms
15,372 KB |
testcase_07 | AC | 131 ms
16,684 KB |
testcase_08 | AC | 22 ms
15,236 KB |
testcase_09 | AC | 24 ms
15,192 KB |
testcase_10 | AC | 21 ms
15,240 KB |
testcase_11 | AC | 23 ms
15,208 KB |
testcase_12 | AC | 24 ms
15,280 KB |
testcase_13 | AC | 24 ms
15,192 KB |
testcase_14 | AC | 61 ms
15,996 KB |
testcase_15 | AC | 53 ms
15,704 KB |
testcase_16 | AC | 99 ms
16,584 KB |
testcase_17 | AC | 95 ms
16,524 KB |
testcase_18 | AC | 114 ms
16,488 KB |
testcase_19 | AC | 54 ms
15,576 KB |
testcase_20 | AC | 30 ms
15,320 KB |
testcase_21 | AC | 77 ms
16,016 KB |
testcase_22 | AC | 101 ms
16,280 KB |
testcase_23 | AC | 82 ms
16,084 KB |
testcase_24 | AC | 66 ms
15,788 KB |
testcase_25 | AC | 118 ms
16,588 KB |
testcase_26 | AC | 26 ms
15,356 KB |
testcase_27 | AC | 45 ms
15,512 KB |
ソースコード
#include <iostream> #include <string> #include <cstdlib> #include <cmath> #include <vector> #include <unordered_map> #include <map> #include <set> #include <algorithm> #include <queue> #include <stack> #include <functional> #include <bitset> #include <assert.h> #include <unordered_map> #include <fstream> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 510000; ll dy[8] = {1,-1,0,0,1,-1,1,-1}; ll dx[8] = {0,0,1,-1,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ rep(i,a.size()) cout << a[i] << " "; cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";} template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } const int mod = 1e9 + 7; //const int mod = 998244353; template <std::uint_fast64_t Modulus> class modint { using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; using mint = modint<mod>; vector<ll> fac(MAX), finv(MAX), inv(MAX); void comInit(){ fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for(ll i=2; i<MAX; i++){ fac[i] = fac[i-1]*i % mod; inv[i] = mod - inv[mod%i] * (mod/i) % mod; finv[i] = finv[i-1] * inv[i] % mod; } } ll com(ll n, ll k){ if(n < k) return 0; if(n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n-k] % mod) % mod; } int main(){ ll n,k; cin >> n >> k; vl a(n); rep(i,n) cin >> a[i]; comInit(); mint c = 1; REP(i,1,n){ c *= n-i+k; c *= inv[i]; } mint d = 1; mint ans = 0; rep(i,n){ ans += d * c * a[i]; d *= k+i+1; d *= inv[i+1]; c *= n-i-1; c /= n-i-1+k; } cout << ans.value() << "\n"; }