結果

問題 No.2111 Sum of Diff
ユーザー tonyu0tonyu0
提出日時 2022-10-28 23:38:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 64 ms / 2,000 ms
コード長 3,139 bytes
コンパイル時間 1,017 ms
コンパイル使用メモリ 100,852 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-06 02:55:41
合計ジャッジ時間 2,662 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 64 ms
6,944 KB
testcase_03 AC 43 ms
6,944 KB
testcase_04 AC 10 ms
6,944 KB
testcase_05 AC 63 ms
6,940 KB
testcase_06 AC 64 ms
6,940 KB
testcase_07 AC 15 ms
6,940 KB
testcase_08 AC 21 ms
6,940 KB
testcase_09 AC 5 ms
6,944 KB
testcase_10 AC 7 ms
6,944 KB
testcase_11 AC 30 ms
6,940 KB
testcase_12 AC 29 ms
6,944 KB
testcase_13 AC 19 ms
6,940 KB
testcase_14 AC 51 ms
6,940 KB
testcase_15 AC 61 ms
6,944 KB
testcase_16 AC 26 ms
6,944 KB
testcase_17 AC 63 ms
6,940 KB
testcase_18 AC 20 ms
6,940 KB
testcase_19 AC 47 ms
6,940 KB
testcase_20 AC 63 ms
6,944 KB
testcase_21 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <chrono>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (ll i = j; i < (n); ++i)
#define rrep(i, j, n) for (ll i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}
[[maybe_unused]] static constexpr long long MOD = 998244353;
//[[maybe_unused]] static constexpr long long MOD = 1e9 + 7;
[[maybe_unused]] static constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] static constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

template <long long mod = 1000000007>
class modint {
public:
  long long x;
  constexpr modint(const long long x = 0) noexcept : x(x % mod) {}
  constexpr long long &value() noexcept { return x; }
  constexpr const long long &value() const noexcept { return x; }
  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 {
    if ((x += rhs.x) >= mod) x -= mod;
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if ((x += mod - rhs.x) >= mod) x -= mod;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    x = x * rhs.x % mod;
    return *this;
  }
  constexpr modint &operator/=(const modint rhs) noexcept {
    *this *= rhs.inverse();
    return *this;
  }
  constexpr bool operator==(const modint &rhs) const { return x == rhs.x; }
  constexpr bool operator!=(const modint &rhs) const { return x != rhs.x; }
  modint inverse() const {
    long long a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return modint(u + mod);
  }

  modint pow(long long exp) const {
    modint res(1), mul(x);
    while (exp > 0) {
      if (exp & 1) res *= mul;
      mul *= mul;
      exp >>= 1;
    }
    return res;
  }
  operator long long() const { return x; }
  friend ostream &operator<<(ostream &os, const modint &rhs) {
    return os << rhs.x;
  }
  friend istream &operator>>(istream &is, modint &a) {
    long long t;
    is >> t;
    a = modint<mod>(t);
    return is;
  }
};

using mint = modint<MOD>;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<mint> a(n);
  cin >> a;
  mint ans;
  rep(i, 0, n) {
    int l = i, r = n - i - 1;
    ans -= a[i] * (mint(2).pow(l) - mint(1));
    ans += a[i] * (mint(2).pow(r) - mint(1));
  }
  cout << ans;
}
0