結果
問題 | No.1325 Subsequence Score |
ユーザー | chocopuu |
提出日時 | 2020-12-28 10:20:35 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 314 ms / 2,000 ms |
コード長 | 4,307 bytes |
コンパイル時間 | 2,101 ms |
コンパイル使用メモリ | 205,428 KB |
実行使用メモリ | 7,260 KB |
最終ジャッジ日時 | 2024-10-02 10:29:53 |
合計ジャッジ時間 | 6,399 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,824 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 3 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,820 KB |
testcase_08 | AC | 2 ms
6,820 KB |
testcase_09 | AC | 1 ms
6,820 KB |
testcase_10 | AC | 2 ms
6,820 KB |
testcase_11 | AC | 2 ms
6,820 KB |
testcase_12 | AC | 2 ms
6,824 KB |
testcase_13 | AC | 291 ms
7,068 KB |
testcase_14 | AC | 80 ms
6,816 KB |
testcase_15 | AC | 243 ms
6,820 KB |
testcase_16 | AC | 278 ms
6,876 KB |
testcase_17 | AC | 127 ms
6,816 KB |
testcase_18 | AC | 79 ms
6,820 KB |
testcase_19 | AC | 314 ms
7,116 KB |
testcase_20 | AC | 37 ms
6,820 KB |
testcase_21 | AC | 104 ms
6,820 KB |
testcase_22 | AC | 127 ms
6,820 KB |
testcase_23 | AC | 303 ms
7,084 KB |
testcase_24 | AC | 300 ms
7,060 KB |
testcase_25 | AC | 305 ms
7,088 KB |
testcase_26 | AC | 312 ms
7,260 KB |
testcase_27 | AC | 302 ms
7,060 KB |
testcase_28 | AC | 2 ms
6,820 KB |
testcase_29 | AC | 2 ms
6,820 KB |
testcase_30 | AC | 2 ms
6,820 KB |
ソースコード
#include "bits/stdc++.h"using namespace std;//#include "atcoder/all"//using namespace atcoder;#define int long long#define REP(i, n) for (int i = 0; i < (int)n; ++i)#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)#define ALL(a) a.begin(), a.end()#define IN(a, x, b) (a <= x && x < b)template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}template<class T>inline void out(T t){cout << t << "\n";}template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}constexpr int INF = 1e18;template<int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if (val < 0) val += MOD;}constexpr int getmod() { return MOD; }constexpr Fp operator - () const noexcept {return val ? MOD - val : 0;}constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }constexpr Fp& operator += (const Fp& r) noexcept {val += r.val;if (val >= MOD) val -= MOD;return *this;}constexpr Fp& operator -= (const Fp& r) noexcept {val -= r.val;if (val < 0) val += MOD;return *this;}constexpr Fp& operator *= (const Fp& r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp& operator /= (const Fp& r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while (b) {long long t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}val = val * u % MOD;if (val < 0) val += MOD;return *this;}constexpr bool operator == (const Fp& r) const noexcept {return this->val == r.val;}constexpr bool operator != (const Fp& r) const noexcept {return this->val != r.val;}friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {return os << x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {if (n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if (n & 1) t = t * a;return t;}};template<class T> struct BiCoef {vector<T> fact_, inv_, finv_;constexpr BiCoef() {}constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {init(n);}constexpr void init(int n) noexcept {fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);int MOD = fact_[0].getmod();for(int i = 2; i < n; i++){fact_[i] = fact_[i-1] * i;inv_[i] = -inv_[MOD%i] * (MOD/i);finv_[i] = finv_[i-1] * inv_[i];}}constexpr T com(int n, int k) const noexcept {if (n < k || n < 0 || k < 0) return 0;return fact_[n] * finv_[k] * finv_[n-k];}constexpr T P(int n, int k) const noexcept {if (n < k || n < 0 || k < 0) return 0;return fact_[n] * finv_[n-k];}constexpr T fact(int n) const noexcept {if (n < 0) return 0;return fact_[n];}constexpr T inv(int n) const noexcept {if (n < 0) return 0;return inv_[n];}constexpr T finv(int n) const noexcept {if (n < 0) return 0;return finv_[n];}};// const int MOD = 1000000007;const int MOD = 998244353;using mint = Fp<MOD>;BiCoef<mint> bc;// bc.init(500050);signed main() {int N;cin >> N;vector<int> a(N);cin >> a;if(N == 1) {out(a[0] % MOD);return 0;}mint ans = 0;FOR(i, 1, N + 1) {mint t = a[i - 1];t *= modpow(mint(2), N - 2);t *= i + 1;ans += t;}out(ans);}