結果
問題 | No.2111 Sum of Diff |
ユーザー | snow39 |
提出日時 | 2022-10-28 21:38:00 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 30 ms / 2,000 ms |
コード長 | 3,259 bytes |
コンパイル時間 | 923 ms |
コンパイル使用メモリ | 105,612 KB |
実行使用メモリ | 6,188 KB |
最終ジャッジ日時 | 2023-09-20 04:28:11 |
合計ジャッジ時間 | 2,555 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 29 ms
6,068 KB |
testcase_03 | AC | 20 ms
5,004 KB |
testcase_04 | AC | 6 ms
4,380 KB |
testcase_05 | AC | 29 ms
6,068 KB |
testcase_06 | AC | 30 ms
6,064 KB |
testcase_07 | AC | 8 ms
4,376 KB |
testcase_08 | AC | 11 ms
4,380 KB |
testcase_09 | AC | 3 ms
4,376 KB |
testcase_10 | AC | 4 ms
4,376 KB |
testcase_11 | AC | 15 ms
4,568 KB |
testcase_12 | AC | 14 ms
4,668 KB |
testcase_13 | AC | 10 ms
4,380 KB |
testcase_14 | AC | 24 ms
5,512 KB |
testcase_15 | AC | 28 ms
5,852 KB |
testcase_16 | AC | 13 ms
4,564 KB |
testcase_17 | AC | 29 ms
6,188 KB |
testcase_18 | AC | 10 ms
4,376 KB |
testcase_19 | AC | 22 ms
5,540 KB |
testcase_20 | AC | 29 ms
6,152 KB |
testcase_21 | AC | 2 ms
4,380 KB |
ソースコード
#include <algorithm> #include <cmath> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <tuple> #include <vector> #define mkp make_pair #define mkt make_tuple #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define all(v) v.begin(), v.end() using namespace std; typedef long long ll; const ll MOD = 1e9 + 7; // const ll MOD = 998244353; template <class T> void chmin(T& a, const T& b) { if (a > b) a = b; } template <class T> void chmax(T& a, const T& b) { if (a < b) a = b; } template <long long mod> class modint { private: using T = long long; T a; public: constexpr modint(const long long x = 0) noexcept : a((x % mod + mod) % mod) {} constexpr T& value() noexcept { return a; } constexpr const T& value() const noexcept { return a; } constexpr modint operator-() const noexcept { return modint(0) -= *this; } 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 >= mod) a -= mod; return *this; } constexpr modint& operator-=(const modint& rhs) noexcept { if (a < rhs.a) a += mod; a -= rhs.a; return *this; } constexpr modint& operator*=(const modint& rhs) noexcept { a = a * rhs.a % mod; return *this; } constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); } constexpr bool operator==(const modint& rhs) const noexcept { return a == rhs.a; } constexpr bool operator!=(const modint& rhs) const noexcept { return not(*this == rhs); } constexpr modint pow(long long k) const noexcept { modint ret(1); modint x = k > 0 ? *this : this->inv(); k = abs(k); while (k > 0) { if (k & 1) ret *= x; x *= x; k >>= 1; } return ret; } constexpr modint inv() const noexcept { return pow(mod - 2); } friend std::ostream& operator<<(std::ostream& os, const modint& X) noexcept { return os << X.a; } friend std::istream& operator>>(std::istream& is, modint& X) noexcept { is >> X.a; X.a %= mod; if (X.a < 0) X.a += mod; return is; } }; using mint = modint<998244353>; void solve() { int N; cin >> N; vector<mint> A(N); rep(i, N) cin >> A[i]; vector<mint> two(N + 1); two[0] = 1; rep(i, N) two[i + 1] = two[i] * 2; mint ans = 0; rep(i, N - 1) { ans += A[i] * (two[N - i - 1] - 1); } for (int i = 1; i < N; i++) { ans -= A[i] * (two[i] - 1); } cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }