結果
問題 | No.1554 array_and_me |
ユーザー |
![]() |
提出日時 | 2021-06-18 22:11:24 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 88 ms / 2,000 ms |
コード長 | 1,970 bytes |
コンパイル時間 | 2,034 ms |
コンパイル使用メモリ | 179,280 KB |
実行使用メモリ | 9,444 KB |
最終ジャッジ日時 | 2024-06-22 20:34:10 |
合計ジャッジ時間 | 5,607 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>using namespace std;const long long MOD = 998244353;long long modpow(long long a, long long b){long long ans = 1;while (b > 0){if (b % 2 == 1){ans *= a;ans %= MOD;}a *= a;a %= MOD;b /= 2;}return ans;}long long modinv(long long a){return modpow(a, MOD - 2);}vector<long long> mf = {1};vector<long long> mfi = {1};long long modfact(int n){if (mf.size() > n){return mf[n];} else {for (int i = mf.size(); i <= n; i++){long long next = mf.back() * i % MOD;mf.push_back(next);mfi.push_back(modinv(next));}return mf[n];}}long long modfactinv(int n){if (mfi.size() > n){return mfi[n];} else {return modinv(modfact(n));}}long long gcd(long long a, long long b){if (b == 0){return a;} else {return gcd(b, a % b);}}struct fraction{long long num, den;fraction(long long num, long long den): num(num), den(den){long long g = gcd(num, den);num /= g;den /= g;}};bool operator <(fraction a, fraction b){return a.num * b.den < b.num * a.den;}int main(){int T;cin >> T;for (int i = 0; i < T; i++){int N, K;cin >> N >> K;vector<int> A(N);for (int j = 0; j < N; j++){cin >> A[j];}int S = 0;for (int j = 0; j < N; j++){S += A[j];}vector<int> c(N, 0);priority_queue<pair<fraction, int>> pq;for (int j = 0; j < N; j++){pq.push(make_pair(fraction(A[j], 1), j));}for (int j = 0; j < K; j++){int id = pq.top().second;pq.pop();c[id]++;pq.push(make_pair(fraction(A[id], c[id] + 1), id));}long long ans = 1;for (int j = 0; j < N; j++){long long p = A[j] * modinv(S % MOD) % MOD;ans *= modpow(p, c[j]);ans %= MOD;}ans *= modfact(K);ans %= MOD;for (int j = 0; j < N; j++){ans *= modfactinv(c[j]);ans %= MOD;}cout << ans << endl;}}