結果
問題 | No.1102 Remnants |
ユーザー | Haar |
提出日時 | 2020-07-04 08:55:53 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,039 ms / 2,000 ms |
コード長 | 4,115 bytes |
コンパイル時間 | 2,874 ms |
コンパイル使用メモリ | 207,184 KB |
実行使用メモリ | 5,684 KB |
最終ジャッジ日時 | 2023-10-17 18:25:15 |
合計ジャッジ時間 | 13,754 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 921 ms
4,348 KB |
testcase_03 | AC | 891 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 72 ms
5,156 KB |
testcase_06 | AC | 17 ms
4,348 KB |
testcase_07 | AC | 1,039 ms
5,684 KB |
testcase_08 | AC | 3 ms
4,348 KB |
testcase_09 | AC | 5 ms
4,348 KB |
testcase_10 | AC | 601 ms
4,348 KB |
testcase_11 | AC | 257 ms
4,348 KB |
testcase_12 | AC | 434 ms
4,348 KB |
testcase_13 | AC | 6 ms
4,348 KB |
testcase_14 | AC | 47 ms
4,364 KB |
testcase_15 | AC | 36 ms
4,348 KB |
testcase_16 | AC | 93 ms
5,420 KB |
testcase_17 | AC | 87 ms
5,420 KB |
testcase_18 | AC | 107 ms
5,420 KB |
testcase_19 | AC | 37 ms
4,348 KB |
testcase_20 | AC | 319 ms
4,348 KB |
testcase_21 | AC | 809 ms
4,628 KB |
testcase_22 | AC | 945 ms
5,156 KB |
testcase_23 | AC | 764 ms
4,628 KB |
testcase_24 | AC | 559 ms
4,364 KB |
testcase_25 | AC | 500 ms
5,420 KB |
testcase_26 | AC | 50 ms
4,348 KB |
testcase_27 | AC | 701 ms
4,348 KB |
ソースコード
#include <bits/stdc++.h> #ifdef DEBUG #include <Mylib/Debug/debug.cpp> #else #define dump(...) #endif /** * @title Modint * @docs mint.md */ template <uint32_t M> class ModInt{ public: constexpr static uint32_t MOD = M; uint64_t val; constexpr ModInt(): val(0){} constexpr ModInt(int64_t n){ if(n >= M) val = n % M; else if(n < 0) val = n % M + M; else val = n; } inline constexpr auto operator+(const ModInt &a) const {return ModInt(val + a.val);} inline constexpr auto operator-(const ModInt &a) const {return ModInt(val - a.val);} inline constexpr auto operator*(const ModInt &a) const {return ModInt(val * a.val);} inline constexpr auto operator/(const ModInt &a) const {return ModInt(val * a.inv().val);} inline constexpr auto& operator=(const ModInt &a){val = a.val; return *this;} inline constexpr auto& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;} inline constexpr auto& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;} inline constexpr auto& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;} inline constexpr auto& 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 auto& operator++(){*this += 1; return *this;} inline constexpr auto& operator--(){*this -= 1; return *this;} inline constexpr auto operator++(int){auto t = *this; *this += 1; return t;} inline constexpr auto operator--(int){auto t = *this; *this -= 1; return t;} inline constexpr static ModInt power(int64_t n, int64_t p){ if(p < 0) return power(n, -p).inv(); int64_t ret = 1, e = n % M; for(; p; (e *= e) %= M, p >>= 1) if(p & 1) (ret *= e) %= M; return ret; } inline constexpr static ModInt inv(int64_t a){ int64_t b = M, u = 1, v = 0; while(b){ int64_t t = a / b; a -= t * b; std::swap(a,b); u -= t * v; std::swap(u,v); } u %= M; if(u < 0) u += M; return u; } inline constexpr static auto frac(int64_t a, int64_t b){return ModInt(a) / ModInt(b);} inline constexpr auto power(int64_t p) const {return power(val, p);} inline constexpr auto inv() const {return inv(val);} friend inline constexpr auto operator-(const ModInt &a){return ModInt(-a.val);} friend inline constexpr auto operator+(int64_t a, const ModInt &b){return ModInt(a) + b;} friend inline constexpr auto operator-(int64_t a, const ModInt &b){return ModInt(a) - b;} friend inline constexpr auto operator*(int64_t a, const ModInt &b){return ModInt(a) * b;} friend inline constexpr auto operator/(int64_t a, const ModInt &b){return ModInt(a) / b;} friend std::istream& operator>>(std::istream &s, ModInt<M> &a){s >> a.val; return s;} friend std::ostream& operator<<(std::ostream &s, const ModInt<M> &a){s << a.val; return s;} template <int N> inline static auto div(){ static auto value = inv(N); return value; } explicit operator int32_t() const noexcept {return val;} explicit operator int64_t() const noexcept {return val;} }; using mint = ModInt<1000000007>; template <typename T> struct BigCombination{ std::vector<T> data; int l; BigCombination(int K, int l, int r): l(l){ const int len = r - l + 1; data.resize(len); data[0] = 1; for(int i = l - K + 1; i <= l; ++i) data[0] *= i; T t = 1; for(int i = 1; i <= K; ++i) t *= i; data[0] /= t; for(int i = l + 1; i <= r; ++i){ data[i - l] = data[i - l - 1] * i / (i - K); } } T operator[](int n) const {return data[n - l];} }; int main(){ int N, K; while(std::cin >> N >> K){ std::vector<int> A(N); for(int i = 0; i < N; ++i) std::cin >> A[i]; BigCombination<mint> bc(K, K, K + N); mint ans = 0; for(int i = 0; i < N; ++i){ ans += bc[K + i] * bc[K + N - i - 1] * A[i]; } std::cout << ans << "\n"; } return 0; }