結果
問題 | No.1299 Random Array Score |
ユーザー | fuppy_kyopro |
提出日時 | 2020-11-27 21:31:54 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 4,004 bytes |
コンパイル時間 | 2,782 ms |
コンパイル使用メモリ | 188,660 KB |
実行使用メモリ | 13,456 KB |
最終ジャッジ日時 | 2024-07-23 22:14:15 |
合計ジャッジ時間 | 4,762 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
//*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")//*/#include <bits/stdc++.h>// #include <atcoder/all>using namespace std;// using namespace atcoder;#define DEBUG(x) cerr<<#x<<": "<<x<<endl;#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}typedef long long ll;#define int ll#define vi vector<int>#define vl vector<ll>#define vii vector< vector<int> >#define vll vector< vector<ll> >#define vs vector<string>#define pii pair<int,int>#define pis pair<int,string>#define psi pair<string,int>#define pll pair<ll,ll>template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }#define X first#define Y second#define rep(i,n) for(int i=0;i<(int)(n);i++)#define rep1(i,n) for(int i=1;i<=(int)(n);i++)#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)#define rrep1(i,n) for(int i=(int)(n);i>0;i--)#define REP(i,a,b) for(int i=a;i<b;i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(),c.end()void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };#define fio() cin.tie(0); ios::sync_with_stdio(false);// const ll MOD = 1000000007;const ll MOD = 998244353;// #define mp make_pair//#define endl '\n'const int MAXN = 555555;vl fact(MAXN);vl rfact(MAXN);ll mod_pow(ll x, ll p, ll M = MOD) {if (p < 0) {x = mod_pow(x, M - 2, M);p = -p;}ll a = 1;while (p) {if (p % 2)a = a*x%M;x = x*x%M;p /= 2;}return a;}ll mod_inverse(ll a, ll M = MOD) {return mod_pow(a, M - 2, M);}void set_fact(ll n, ll M = MOD) {fact[0] = 1;for (ll i = 1; i <= n; i++) {fact[i] = i * fact[i - 1] % M;}rfact[n] = mod_inverse(fact[n], M);for (ll i = n - 1; i >= 0; i--) {rfact[i] = (i + 1) * rfact[i + 1] % M;}}//http://drken1215.hatenablog.com/entry/2018/06/08/210000//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ·��ď����Ă���ll nCr(ll n, ll r, ll M = MOD) {if (r > n) return 0;assert(fact[2] == 2);ll ret = fact[n];if (rfact[r] == 0) {rfact[r] = mod_inverse(fact[r], M);}ret = (ret*rfact[r]) % M;if (rfact[n - r] == 0) {rfact[n - r] = mod_inverse(fact[n - r], M);}ret = (ret*rfact[n - r]) % M;return ret;}ll nHr(ll n, ll r) {return nCr(n+r-1, r);}signed main() {fio();int n, k;cin >> n >> k;vl a(n);ll s = 0;rep (i, n) {cin >> a[i];(s += a[i]) %= MOD;}cout << s * mod_pow(2, k) % MOD << endl;}