結果

問題 No.1554 array_and_me
ユーザー milanis48663220milanis48663220
提出日時 2021-06-18 22:31:57
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 97 ms / 2,000 ms
コード長 4,982 bytes
コンパイル時間 1,289 ms
コンパイル使用メモリ 129,144 KB
実行使用メモリ 9,764 KB
最終ジャッジ日時 2024-06-22 20:57:14
合計ジャッジ時間 5,127 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 38 ms
5,376 KB
testcase_02 AC 38 ms
5,376 KB
testcase_03 AC 35 ms
5,376 KB
testcase_04 AC 39 ms
5,376 KB
testcase_05 AC 39 ms
5,376 KB
testcase_06 AC 89 ms
9,508 KB
testcase_07 AC 97 ms
9,764 KB
testcase_08 AC 96 ms
9,516 KB
testcase_09 AC 93 ms
9,636 KB
testcase_10 AC 92 ms
9,636 KB
testcase_11 AC 24 ms
9,760 KB
testcase_12 AC 24 ms
9,632 KB
testcase_13 AC 24 ms
9,600 KB
testcase_14 AC 24 ms
9,508 KB
testcase_15 AC 25 ms
9,504 KB
testcase_16 AC 47 ms
5,376 KB
testcase_17 AC 47 ms
5,376 KB
testcase_18 AC 47 ms
5,376 KB
testcase_19 AC 47 ms
5,376 KB
testcase_20 AC 46 ms
5,376 KB
testcase_21 AC 66 ms
5,376 KB
testcase_22 AC 65 ms
5,376 KB
testcase_23 AC 64 ms
5,376 KB
testcase_24 AC 63 ms
5,376 KB
testcase_25 AC 64 ms
5,376 KB
testcase_26 AC 81 ms
5,376 KB
testcase_27 AC 78 ms
5,376 KB
testcase_28 AC 75 ms
5,376 KB
testcase_29 AC 80 ms
5,376 KB
testcase_30 AC 72 ms
5,376 KB
testcase_31 AC 77 ms
5,376 KB
testcase_32 AC 82 ms
5,376 KB
testcase_33 AC 80 ms
5,376 KB
testcase_34 AC 76 ms
5,376 KB
testcase_35 AC 76 ms
5,376 KB
testcase_36 AC 77 ms
5,376 KB
testcase_37 AC 74 ms
5,376 KB
testcase_38 AC 67 ms
5,376 KB
testcase_39 AC 67 ms
5,376 KB
testcase_40 AC 77 ms
5,376 KB
testcase_41 AC 54 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
In constructor 'ModInt::ModInt(ll)',
    inlined from 'ModInt ModInt::operator/(ll)' at main.cpp:44:24,
    inlined from 'void solve()' at main.cpp:217:13:
main.cpp:29:26: warning: '<unnamed>.ModInt::v' may be used uninitialized [-Wmaybe-uninitialized]
   29 |         if(_v < 0) _v = (v%MOD)+MOD;
      |                          ^
main.cpp: In function 'void solve()':
main.cpp:44:32: note: '<anonymous>' declared here
   44 |         return ModInt((ModInt(n).inv()*v).v%MOD);
      |                                ^

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const ll MOD = 998244353;

class ModInt{
    public:
    ll v;
    ModInt(ll _v = 0){
        if(_v < 0) _v = (v%MOD)+MOD;
        if(_v >= MOD) _v %= MOD;
        v = _v;
    }
    ModInt operator+(ll n){
        return ModInt((v+n)%MOD);
    }
    ModInt operator-(ll n){
        return ModInt((v-n+MOD)%MOD);
    }
    ModInt operator*(ll n){
        if(n >= MOD) n %= MOD;
        return ModInt((v*n)%MOD);
    }
    ModInt operator/(ll n){
        return ModInt((ModInt(n).inv()*v).v%MOD);
    }

    void operator+=(ll n){
        v = (v+n)%MOD;
    }
    void operator-=(ll n){
        v = (v-n+MOD)%MOD;
    }
    void operator*=(ll n){
        if(n >= MOD) n %= MOD;
        v = (v*n+MOD)%MOD;
    }
    
    
    ModInt operator+(ModInt n){
        return ModInt((v+n.v)%MOD);
    }
    ModInt operator-(ModInt n){
        return ModInt((v-n.v+MOD)%MOD);
    }
    ModInt operator*(ModInt n){
        return ModInt((v*n.v)%MOD);
    }
    ModInt operator/(ModInt n){
        return ModInt((n.inv()*v).v%MOD);
    }

    void operator+=(ModInt n){
        v = (v+n.v)%MOD;
    }
    void operator-=(ModInt n){
        v = (v-n.v+MOD)%MOD;
    }
    void operator*=(ModInt n){
        v = (v*n.v)%MOD;
    }

    void operator=(ModInt n){
        v = n.v;
    }
    bool operator==(ModInt n){
        return v == n.v;
    }
    bool operator!=(ModInt n){
        return v != n.v;
    }
    void operator=(ll n){
        v = n%MOD;
    }

    ModInt inv(){
        if(v == 1) return ModInt(1);
        else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);
    }
};

ostream& operator<<(ostream& os, const ModInt& m){
    os << m.v;
    return os;
}

istream & operator >> (istream &in,  ModInt &m){
    in >> m.v;
    return in;
}

ModInt pow(ModInt a, ll n) {
    assert(n >= 0);
	ModInt ans = 1;
	ModInt tmp = a;
	for (int i = 0; i <= 60; i++) {
		ll m = (ll)1 << i;
		if (m & n) {
		ans *= tmp;
		}
		tmp *= tmp;
	}
	return ans;
}

template <typename T>
class frac{
    public:
    T n, d;
    frac(T _n, T _d){
        T g = gcd(_n, _d);
        n = _n/g;
        d = _d/g;
        if(d < 0) {
            d *= -1;
            n *= -1;
        }
    }
    frac(){
        n = 1;
        d = 1;
    }
    frac operator+(frac f){
        return frac(n*f.d+d*f.n, f.d*d);
    }
    frac operator-(frac f){
        return frac(n*f.d-d*f.n, f.d*d);
    }
    frac operator*(frac f){
        return frac(f.n*n, f.d*d);
    }
    frac inv(){
        return frac(d, n);
    }
    bool operator<(frac f){
        if(d*f.d < 0) return n*f.d-d*f.n > 0;
        else return n*f.d-d*f.n < 0;
    }
    bool operator>(frac f){
        if(d*f.d < 0) return n*f.d-d*f.n < 0;
        else return n*f.d-d*f.n > 0;
    }
    bool operator==(frac f){
        return n*f.d-d*f.n == 0;
    }
    void operator+=(frac f){
        n = n*f.d+d*f.n, d = f.d*d;
        reduction();
    }
    void operator-=(frac f){
        n = n*f.d-d*f.n, d = f.d*d;
        reduction();
    }
    void reduction(){
        T g = gcd(n, d);
        n /= g, d /= g;
    }
};

template <typename T>
bool operator<(const frac<T> f1, const frac<T> f2){
    if(f1.d*f2.d < 0) return f1.n*f2.d-f1.d*f2.n > 0;
    else return f1.n*f2.d-f1.d*f2.n < 0;
}

template <typename T>
bool operator>(const frac<T> f1, const frac<T> f2){
    if(f1.d*f2.d < 0) return f1.n*f2.d-f1.d*f2.n > 0;
    else return f1.n*f2.d-f1.d*f2.n > 0;
}

template <typename T>
bool operator==(const frac<T> f1, const frac<T> f2){
    return f1.n*f2.d-f1.d*f2.n == 0;
}

using mint = ModInt;
using F = frac<ll>;
using Pfi = pair<F, int>;

void solve(){
    int n, k; cin >> n >> k;
    vector<ll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    ll sum = accumulate(a.begin(), a.end(), 0);
    vector<F> p(n);
    for(int i = 0; i < n; i++) p[i] = F(a[i], sum);
    mint ans = 1;
    for(int i = 1; i <= k; i++) ans *= i;
    priority_queue<Pfi> que;
    vector<ll> cur(n, 1);
    for(int i = 0; i < n; i++){
        que.push(Pfi(p[i], i));
    }
    while(k--){
        auto [p, i] = que.top(); que.pop();
        ans *= p.n;
        ans = ans/p.d;
        cur[i]++;
        que.push(Pfi(F(a[i], sum*cur[i]), i));
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}
0