結果
問題 | No.1554 array_and_me |
ユーザー | tokusakurai |
提出日時 | 2021-06-18 22:36:45 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 3,539 bytes |
コンパイル時間 | 1,961 ms |
コンパイル使用メモリ | 210,496 KB |
実行使用メモリ | 6,520 KB |
最終ジャッジ日時 | 2024-06-22 21:00:48 |
合計ジャッジ時間 | 4,592 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 22 ms
5,376 KB |
testcase_02 | AC | 20 ms
5,376 KB |
testcase_03 | AC | 24 ms
5,376 KB |
testcase_04 | AC | 24 ms
5,376 KB |
testcase_05 | AC | 24 ms
5,376 KB |
testcase_06 | AC | 51 ms
6,516 KB |
testcase_07 | AC | 49 ms
6,520 KB |
testcase_08 | AC | 44 ms
6,392 KB |
testcase_09 | AC | 49 ms
6,392 KB |
testcase_10 | AC | 49 ms
6,320 KB |
testcase_11 | AC | 12 ms
6,396 KB |
testcase_12 | AC | 13 ms
6,520 KB |
testcase_13 | AC | 12 ms
6,520 KB |
testcase_14 | AC | 13 ms
6,392 KB |
testcase_15 | AC | 14 ms
6,392 KB |
testcase_16 | AC | 20 ms
5,376 KB |
testcase_17 | AC | 20 ms
5,376 KB |
testcase_18 | AC | 20 ms
5,376 KB |
testcase_19 | AC | 20 ms
5,376 KB |
testcase_20 | AC | 19 ms
5,376 KB |
testcase_21 | AC | 33 ms
5,376 KB |
testcase_22 | AC | 33 ms
5,376 KB |
testcase_23 | AC | 32 ms
5,376 KB |
testcase_24 | AC | 35 ms
5,376 KB |
testcase_25 | AC | 32 ms
5,376 KB |
testcase_26 | AC | 38 ms
5,376 KB |
testcase_27 | AC | 38 ms
5,376 KB |
testcase_28 | AC | 38 ms
5,376 KB |
testcase_29 | AC | 38 ms
5,376 KB |
testcase_30 | AC | 38 ms
5,376 KB |
testcase_31 | AC | 38 ms
5,376 KB |
testcase_32 | AC | 39 ms
5,376 KB |
testcase_33 | AC | 38 ms
5,376 KB |
testcase_34 | AC | 37 ms
5,376 KB |
testcase_35 | AC | 39 ms
5,376 KB |
testcase_36 | AC | 41 ms
5,376 KB |
testcase_37 | AC | 38 ms
5,376 KB |
testcase_38 | AC | 38 ms
5,376 KB |
testcase_39 | AC | 37 ms
5,376 KB |
testcase_40 | AC | 37 ms
5,376 KB |
testcase_41 | AC | 27 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < n; i++)#define rep2(i, x, n) for(int i = x; i <= n; i++)#define rep3(i, x, n) for(int i = x; i >= n; i--)#define each(e, v) for(auto &e: v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;//const int MOD = 1000000007;const int MOD = 998244353;const int inf = (1<<30)-1;const ll INF = (1LL<<60)-1;template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};struct io_setup{io_setup(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;template<int mod>struct Mod_Int{int x;Mod_Int() : x(0) {}Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}Mod_Int &operator += (const Mod_Int &p){if((x += p.x) >= mod) x -= mod;return *this;}Mod_Int &operator -= (const Mod_Int &p){if((x += mod - p.x) >= mod) x -= mod;return *this;}Mod_Int &operator *= (const Mod_Int &p){x = (int) (1LL * x * p.x % mod);return *this;}Mod_Int &operator /= (const Mod_Int &p){*this *= p.inverse();return *this;}Mod_Int &operator ++ () {return *this += Mod_Int(1);}Mod_Int operator ++ (int){Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator -- () {return *this -= Mod_Int(1);}Mod_Int operator -- (int){Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator - () const {return Mod_Int(-x);}Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}bool operator == (const Mod_Int &p) const {return x == p.x;}bool operator != (const Mod_Int &p) const {return x != p.x;}Mod_Int inverse() const{assert(*this != Mod_Int(0));return pow(mod-2);}Mod_Int pow(long long k) const{Mod_Int now = *this, ret = 1;for(; k > 0; k >>= 1, now *= now){if(k&1) ret *= now;}return ret;}friend ostream &operator << (ostream &os, const Mod_Int &p){return os << p.x;}friend istream &operator >> (istream &is, Mod_Int &p){long long a;is >> a;p = Mod_Int<mod>(a);return is;}};using mint = Mod_Int<MOD>;int main(){int T; cin >> T;while(T--){int N, K; cin >> N >> K;vector<ll> A(N);rep(i, N) cin >> A[i];priority_queue<pair<double, int>> que;rep(i, N) que.emplace(A[i], i);mint ans = (mint(accumulate(all(A), 0LL)).pow(K)).inverse();rep2(i, 1, K) ans *= i;vector<ll> P(N, 0);rep(i, K){int j = que.top().second; que.pop();ans *= A[j];ans /= ++P[j];que.emplace(double(A[j])/double(P[j]+1), j);}cout << ans << '\n';}}