結果

問題 No.1299 Random Array Score
ユーザー parukiparuki
提出日時 2021-07-07 18:59:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 24 ms / 2,000 ms
コード長 2,630 bytes
コンパイル時間 2,170 ms
コンパイル使用メモリ 195,156 KB
最終ジャッジ日時 2025-01-22 18:03:35
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
template<int MOD>
class ModInt {
public:
ModInt() :value(0) {}
ModInt(long long val) :value((int)(val < 0 ? MOD + val % MOD : val % MOD)) { }
ModInt& operator+=(ModInt that) {
value = value + that.value;
if (value >= MOD)value -= MOD;
return *this;
}
ModInt& operator-=(ModInt that) {
value -= that.value;
if (value < 0)value += MOD;
return *this;
}
ModInt& operator*=(ModInt that) {
value = (int)((long long)value * that.value % MOD);
return *this;
}
ModInt& operator/=(ModInt that) {
return *this *= that.inverse();
}
ModInt operator+(ModInt that) const {
return ModInt(*this) += that;
}
ModInt operator-(ModInt that) const {
return ModInt(*this) -= that;
}
ModInt operator*(ModInt that) const {
return ModInt(*this) *= that;
}
ModInt operator/(ModInt that) const {
return ModInt(*this) /= that;
}
ModInt pow(long long k) const {
ModInt n = *this, res = 1;
if (k < 0) {
k = -k;
n = n.inverse();
}
while (k) {
if (k & 1)res *= n;
n *= n;
k >>= 1;
}
return res;
}
ModInt inverse() const {
long long a = value, 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);
}
return ModInt(u);
}
int toi() const { return value; }
private:
int value;
};
typedef ModInt<998244353> mint;
ostream& operator<<(ostream & os, const mint & x) {
os << x.toi();
return os;
}
void solve() {
int N;
ll K;
cin >> N >> K;
mint S = 0;
rep(i, N) {
int A;
cin >> A;
S += A;
}
mint x = 2;
cout << (S + S * (x.pow(K) - 1)) << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0