結果
| 問題 | No.1325 Subsequence Score |
| ユーザー |
 Pachicobue
|
| 提出日時 | 2020-12-22 15:32:32 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 165 ms / 2,000 ms |
| コード長 | 9,179 bytes |
| コンパイル時間 | 2,515 ms |
| コンパイル使用メモリ | 196,744 KB |
| 最終ジャッジ日時 | 2025-01-17 06:07:51 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
#include <bits/stdc++.h>using ll = long long;using uint = unsigned int;using ull = unsigned long long;using ld = long double;template<typename T> using max_heap = std::priority_queue<T>;template<typename T> using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;constexpr int popcount(const ull v) { return v ? __builtin_popcountll(v) : 0; }constexpr int log2p1(const ull v) { return v ? 64 - __builtin_clzll(v) : 0; }constexpr int lsbp1(const ull v) { return __builtin_ffsll(v); }constexpr int clog(const ull v) { return v ? log2p1(v - 1) : 0; }constexpr ull ceil2(const ull v) { return 1ULL << clog(v); }constexpr ull floor2(const ull v) { return v ? (1ULL << (log2p1(v) - 1)) : 0ULL; }constexpr bool btest(const ull mask, const int ind) { return (mask >> ind) & 1ULL; }template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};template<typename T> constexpr T TEN(const int n) { return n == 0 ? T{1} : TEN<T>(n - 1) * T{10}; }template<typename F> struct fix : F{fix(F&& f) : F{std::forward<F>(f)} {}template<typename... Args> auto operator()(Args&&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }};template<typename T, int n, int i = 0>auto nd_array(int const (&szs)[n], const T x = T{}){if constexpr (i == n) {return x;} else {return std::vector(szs[i], nd_array<T, n, i + 1>(szs, x));}}class printer{public:printer(std::ostream& os_ = std::cout) : m_os{os_} { m_os << std::fixed << std::setprecision(15); }template<typename... Args> int ln(const Args&... args) { return dump(args...), m_os << '\n', 0; }template<typename... Args> int el(const Args&... args) { return dump(args...), m_os << std::endl, 0; }private:template<typename T> void dump(const T& v) { m_os << v; }template<typename T> void dump(const std::vector<T>& vs){for (int i = 0; i < (int)vs.size(); i++) { m_os << (i ? " " : ""), dump(vs[i]); }}template<typename T> void dump(const std::vector<std::vector<T>>& vss){for (int i = 0; i < (int)vss.size(); i++) { m_os << (0 <= i or i + 1 < (int)vss.size() ? "\n" : ""), dump(vss[i]); }}template<typename T, typename... Args> int dump(const T& v, const Args&... args) { return dump(v), m_os << ' ', dump(args...), 0; }std::ostream& m_os;};printer out;class range{private:struct itr{itr(const int start = 0, const int step = 1) : m_cnt{start}, m_step{step} {}bool operator!=(const itr& it) const { return m_cnt != it.m_cnt; }int& operator*() { return m_cnt; }itr& operator++() { return m_cnt += m_step, *this; }int m_cnt, m_step;};int m_start, m_end, m_step;public:range(const int start, const int end, const int step = 1) : m_start{start}, m_end{end}, m_step{step}{assert(m_step != 0);if (m_step > 0) { m_end = m_start + std::max(m_step - 1, m_end - m_start + m_step - 1) / m_step * m_step; }if (m_step < 0) { m_end = m_start - std::max(-m_step - 1, m_start - m_end - m_step - 1) / (-m_step) * (-m_step); }}itr begin() const { return itr{m_start, m_step}; }itr end() const { return itr{m_end, m_step}; }};range rep(const int end, const int step = 1) { return range(0, end, step); }range per(const int rend, const int step = -1) { return range(rend - 1, -1, step); }class scanner{public:scanner(std::istream& is_ = std::cin) : m_is{is_} { m_is.tie(nullptr), std::ios::sync_with_stdio(false); }template<typename T> T val(){T v;return m_is >> v, v;}template<typename T> T val(const T offset) { return val<T>() - offset; }template<typename T> std::vector<T> vec(const int n){return make_v<T>(n, [this]() { return val<T>(); });}template<typename T> std::vector<T> vec(const int n, const T offset){return make_v<T>(n, [this, offset]() { return val<T>(offset); });}template<typename T> std::vector<std::vector<T>> vvec(const int n0, const int n1){return make_v<std::vector<T>>(n0, [this, n1]() { return vec<T>(n1); });}template<typename T> std::vector<std::vector<T>> vvec(const int n0, const int n1, const T offset){return make_v<std::vector<T>>(n0, [this, n1, offset]() { return vec<T>(n1, offset); });}template<typename... Args> auto tup() { return std::tuple<std::decay_t<Args>...>{val<Args>()...}; }template<typename... Args> auto tup(const Args&... offsets) { return std::tuple<std::decay_t<Args>...>{val<Args>(offsets)...}; }private:template<typename T, typename F>std::vector<T> make_v(const int n, F f){std::vector<T> ans;for (int i = 0; i < n; i++) { ans.push_back(f()); }return ans;}std::istream& m_is;};scanner in;template<const uint& mod>class modint{public:modint() : m_val{0} {}modint(const ll v) : m_val{normll(v)} {}modint(const modint& m) = default;modint& operator =(const modint& m) { return m_val = m(), (*this); }modint& operator =(const ll v) { return m_val = normll(v), (*this); }modint operator+() const { return *this; }modint operator-() const { return modint{0} - (*this); }modint& operator+=(const modint& m) { return m_val = norm(m_val + m()), *this; }modint& operator-=(const modint& m) { return m_val = norm(m_val + mod - m()), *this; }modint& operator*=(const modint& m) { return m_val = normll((ll)m_val * (ll)m() % (ll)mod), *this; }modint& operator/=(const modint& m) { return *this *= m.inv(); }modint& operator+=(const ll val) { return *this += modint{val}; }modint& operator-=(const ll val) { return *this -= modint{val}; }modint& operator*=(const ll val) { return *this *= modint{val}; }modint& operator/=(const ll val) { return *this /= modint{val}; }modint operator+(const modint& m) const { return modint{*this} += m; }modint operator-(const modint& m) const { return modint{*this} -= m; }modint operator*(const modint& m) const { return modint{*this} *= m; }modint operator/(const modint& m) const { return modint{*this} /= m; }modint operator+(const ll v) const { return *this + modint{v}; }modint operator-(const ll v) const { return *this - modint{v}; }modint operator*(const ll v) const { return *this * modint{v}; }modint operator/(const ll v) const { return *this / modint{v}; }bool operator==(const modint& m) const { return m_val == m(); }bool operator!=(const modint& m) const { return not(*this == m); }friend modint operator+(const ll v, const modint& m) { return modint{v} + m; }friend modint operator-(const ll v, const modint& m) { return modint{v} - m; }friend modint operator*(const ll v, const modint& m) { return modint{v} * m; }friend modint operator/(const ll v, const modint& m) { return modint{v} / m; }friend std::istream& operator>>(std::istream& is, modint& m){ll v;return is >> v, m = v, is;}friend std::ostream& operator<<(std::ostream& os, const modint& m) { return os << m(); }uint operator()() const { return m_val; }modint pow(ull n) const{modint ans = 1;for (modint x = *this; n > 0; n >>= 1, x *= x) {if (n & 1ULL) { ans *= x; }}return ans;}modint inv() const { return m_val <= 2000000 ? sinv(m_val) : pow(mod - 2); }static modint fact(const uint n){static std::vector<modint> fs{1, 1};for (uint i = (uint)fs.size(); i <= n; i++) { fs.push_back(fs.back() * i); }return fs[n];}static modint ifact(const uint n){static std::vector<modint> ifs{1, 1};for (uint i = (uint)ifs.size(); i <= n; i++) { ifs.push_back(ifs.back() * sinv(i)); }return ifs[n];}static modint perm(const int n, const int k) { return k > n or k < 0 ? modint{0} : fact(n) * ifact(n - k); }static modint comb(const int n, const int k) { return k > n or k < 0 ? modint{0} : fact(n) * ifact(n - k) * ifact(k); }private:static constexpr uint norm(const uint x) { return x < mod ? x : x - mod; }static constexpr uint normll(const ll x) { return norm(uint(x % (ll)mod + (ll)mod)); }static modint sinv(const uint n){static std::vector<modint> is{1, 1};for (uint i = (uint)is.size(); i <= n; i++) { is.push_back(-is[mod % i] * (mod / i)); }return is[n];}uint m_val;};int main(){static constexpr uint mod = 998244353;using mint = modint<mod>;const auto N = in.val<int>();const auto as = in.vec<mint>(N);mint ans = 0;for (int i = 0; i < N; i++) { ans += as[i] * (i == 0 ? mint(1) : mint(2).pow(i - 1) * (i + 2)) * mint(2).pow(N - i - 1); }out.ln(ans);return 0;}