#853629 (C++17) No.1299 Random Array Score

• 問題: No.1299 Random Array Score
• ユーザー: 👑 CleyL
• 提出日時: 2023-03-28 16:45:09
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 86 ms / 2,000 ms
• コード長: 2,000 bytes
• コンパイル時間: 609 ms
• コンパイル使用メモリ: 69,228 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-20 06:27:33
• 合計ジャッジ時間: 3,505 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	76 ms; 6,944 KB
testcase_04	AC	74 ms; 6,940 KB
testcase_05	AC	60 ms; 6,940 KB
testcase_06	AC	53 ms; 6,944 KB
testcase_07	AC	54 ms; 6,940 KB
testcase_08	AC	75 ms; 6,944 KB
testcase_09	AC	4 ms; 6,940 KB
testcase_10	AC	29 ms; 6,940 KB
testcase_11	AC	9 ms; 6,944 KB
testcase_12	AC	48 ms; 6,940 KB
testcase_13	AC	70 ms; 6,940 KB
testcase_14	AC	49 ms; 6,940 KB
testcase_15	AC	51 ms; 6,944 KB
testcase_16	AC	52 ms; 6,940 KB
testcase_17	AC	11 ms; 6,944 KB
testcase_18	AC	34 ms; 6,940 KB
testcase_19	AC	39 ms; 6,944 KB
testcase_20	AC	22 ms; 6,940 KB
testcase_21	AC	3 ms; 6,940 KB
testcase_22	AC	13 ms; 6,944 KB
testcase_23	AC	52 ms; 6,940 KB
testcase_24	AC	60 ms; 6,940 KB
testcase_25	AC	52 ms; 6,940 KB
testcase_26	AC	3 ms; 6,940 KB
testcase_27	AC	15 ms; 6,944 KB
testcase_28	AC	11 ms; 6,944 KB
testcase_29	AC	17 ms; 6,940 KB
testcase_30	AC	50 ms; 6,940 KB
testcase_31	AC	19 ms; 6,940 KB
testcase_32	AC	74 ms; 6,944 KB
testcase_33	AC	86 ms; 6,944 KB
testcase_34	AC	30 ms; 6,940 KB
testcase_35	AC	86 ms; 6,940 KB
testcase_36	AC	31 ms; 6,944 KB

ソースコード

#include <iostream>
using namespace std;
const long long MOD = 998244353;
template <int mod>
struct ModInt{
  int n;
  ModInt():n(0){}
  ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}

  ModInt &operator+=(const ModInt &p){
    if((n+=p.n) >= mod)n-=mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p){
    n+=mod-p.n;
    if(n >= mod)n-=mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p){
    n = (int) ((1LL*n*p.n)%mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p){
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const {return ModInt(-n);}
  ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}
  ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}
  ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}
  ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}

  bool operator==(const ModInt &p) const {return n==p.n;}
	bool operator<(const ModInt &p) const {return n<p.n;}
	bool operator>(const ModInt &p) const {return n>p.n;}
	bool operator>=(const ModInt &p) const {return n>=p.n;}
	bool operator<=(const ModInt &p) const {return n<=p.n;}
  bool operator!=(const ModInt &p) const {return n!=p.n;}

  ModInt inverse() const {
    int a = n,b = mod,u = 1,v = 0;
    while(b){
      int t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t z) const {
    ModInt ret(1),mul(n);
    while(z > 0){
      if(z & 1) ret *= mul;
      mul *= mul;
      z >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p){
    return os << p.n;
  }
  friend istream &operator>>(istream &is, ModInt &a){
    int64_t t;
    is >> t;
    a = ModInt<mod> (t);
    return (is);

  }
};
using mint = ModInt<MOD>;
int main(){
  long long n,k;cin>>n>>k;
  mint x = 0;
  for(int i = 0; n > i; i++){
    long long c;cin>>c;
    x = (x+c);
  }
  cout << x*((mint)2).pow(k) << endl;
}