結果
問題 | No.1299 Random Array Score |
ユーザー | hedwig100 |
提出日時 | 2020-11-27 21:35:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 24 ms / 2,000 ms |
コード長 | 3,167 bytes |
コンパイル時間 | 1,761 ms |
コンパイル使用メモリ | 170,428 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-26 11:51:12 |
合計ジャッジ時間 | 3,569 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 23 ms
5,376 KB |
testcase_04 | AC | 23 ms
5,376 KB |
testcase_05 | AC | 17 ms
5,376 KB |
testcase_06 | AC | 16 ms
5,376 KB |
testcase_07 | AC | 17 ms
5,376 KB |
testcase_08 | AC | 22 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 10 ms
5,376 KB |
testcase_11 | AC | 4 ms
5,376 KB |
testcase_12 | AC | 16 ms
5,376 KB |
testcase_13 | AC | 22 ms
5,376 KB |
testcase_14 | AC | 16 ms
5,376 KB |
testcase_15 | AC | 16 ms
5,376 KB |
testcase_16 | AC | 16 ms
5,376 KB |
testcase_17 | AC | 5 ms
5,376 KB |
testcase_18 | AC | 11 ms
5,376 KB |
testcase_19 | AC | 12 ms
5,376 KB |
testcase_20 | AC | 7 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 5 ms
5,376 KB |
testcase_23 | AC | 16 ms
5,376 KB |
testcase_24 | AC | 18 ms
5,376 KB |
testcase_25 | AC | 15 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 5 ms
5,376 KB |
testcase_28 | AC | 5 ms
5,376 KB |
testcase_29 | AC | 5 ms
5,376 KB |
testcase_30 | AC | 14 ms
5,376 KB |
testcase_31 | AC | 7 ms
5,376 KB |
testcase_32 | AC | 21 ms
5,376 KB |
testcase_33 | AC | 24 ms
5,376 KB |
testcase_34 | AC | 12 ms
5,376 KB |
testcase_35 | AC | 24 ms
5,376 KB |
testcase_36 | AC | 13 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#ifdef LOCAL_void debug_out() {cerr << endl;}template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl;#else#define debug(...) (void(0))#define dump(x) (void(0))#endif#define rep(i,n) for (int i = 0; i < (int)(n); i ++)#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)using ll = long long;using PL = pair<ll,ll>;using P = pair<int,int>;constexpr int INF = 1000000000;constexpr long long HINF = 100000'00000'00000;constexpr long long MOD = 1000000007;// = 998244353;constexpr double EPS = 1e-4;constexpr double PI = 3.14159265358979;#pragma region Macrostemplate<typename T1,typename T2> ostream &operator<<(ostream &os,const pair<T1,T2> &p) {os << '(' << p.first << ',' << p.second << ')'; return os;}template<typename T> ostream &operator<<(ostream &os,const vector<T> &v) {os << '[';for (auto &e:v) {os << e << ',';}os << ']'; return os;}// grid searhconst int dy[8] = {-1,0,1,0,-1,-1,1,1};const int dx[8] = {0,1,0,-1,-1,1,-1,1};bool IN(int y,int x,int H,int W) {return (0 <= y)&&(y < H)&&(0 <= x)&&(x < W);}#pragma endregiontemplate<int Modulus>struct ModInt {long long x;ModInt(long long x = 0) :x((x%Modulus + Modulus)%Modulus) {}constexpr ModInt &operator+=(const ModInt a) {if ((x += a.x) >= Modulus) x -= Modulus; return *this;}constexpr ModInt &operator-=(const ModInt a) {if ((x += Modulus - a.x) >= Modulus) x -= Modulus; return *this;}constexpr ModInt &operator*=(const ModInt a) {(x *= a.x) %= Modulus; return *this;}constexpr ModInt &operator/=(const ModInt a) {return *this *= a.inverse();}constexpr ModInt operator+(const ModInt a) const {return ModInt(*this) += a.x;}constexpr ModInt operator-(const ModInt a) const {return ModInt(*this) -= a.x;}constexpr ModInt operator*(const ModInt a) const {return ModInt(*this) *= a.x;}constexpr ModInt operator/(const ModInt a) const {return ModInt(*this) /= a.x;}friend constexpr ostream& operator<<(ostream& os,const ModInt<Modulus>& a) {return os << a.x;}friend constexpr istream& operator>>(istream& is,ModInt<Modulus>& a) {return is >> a.x;}ModInt inverse() const {// x ^ (-1)long long a = x,b = Modulus,p = 1,q = 0;while (b) {long long d = a/b; a -= d*b; swap(a,b); p -= d*q; swap(p,q);}return ModInt(p);}ModInt pow(long long N) {// x ^ NModInt a = 1;while (N) {if (N&1) a *= *this;*this *= *this;N >>= 1;}return a;}};using mint = ModInt<998244353>;int main() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(20);int N; cin >> N;ll K; cin >> K;vector<ll> A(N);rep(i,N) cin >> A[i];mint sum = 0;rep(i,N) sum += A[i];mint x = mint(2).pow(K);sum *= x;cout << sum << '\n';return 0;}