結果

問題 No.1554 array_and_me
ユーザー 👑 tute7627tute7627
提出日時 2021-06-18 22:06:47
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 11,535 bytes
コンパイル時間 2,671 ms
コンパイル使用メモリ 211,448 KB
実行使用メモリ 9,656 KB
最終ジャッジ日時 2023-09-04 23:11:33
合計ジャッジ時間 5,795 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
6,416 KB
testcase_01 AC 16 ms
6,788 KB
testcase_02 AC 17 ms
6,396 KB
testcase_03 AC 16 ms
6,392 KB
testcase_04 AC 16 ms
6,412 KB
testcase_05 AC 16 ms
6,392 KB
testcase_06 AC 37 ms
9,572 KB
testcase_07 AC 37 ms
9,376 KB
testcase_08 AC 37 ms
9,656 KB
testcase_09 AC 37 ms
9,364 KB
testcase_10 AC 37 ms
9,620 KB
testcase_11 AC 20 ms
9,412 KB
testcase_12 AC 20 ms
9,568 KB
testcase_13 AC 20 ms
9,524 KB
testcase_14 AC 20 ms
9,516 KB
testcase_15 AC 20 ms
9,452 KB
testcase_16 AC 11 ms
6,592 KB
testcase_17 AC 11 ms
6,540 KB
testcase_18 AC 12 ms
6,396 KB
testcase_19 AC 12 ms
6,548 KB
testcase_20 AC 11 ms
6,424 KB
testcase_21 AC 24 ms
6,400 KB
testcase_22 AC 24 ms
6,416 KB
testcase_23 AC 24 ms
6,804 KB
testcase_24 AC 25 ms
6,396 KB
testcase_25 AC 24 ms
6,828 KB
testcase_26 AC 30 ms
7,152 KB
testcase_27 AC 30 ms
7,156 KB
testcase_28 AC 30 ms
7,284 KB
testcase_29 AC 29 ms
7,240 KB
testcase_30 AC 30 ms
7,212 KB
testcase_31 AC 30 ms
7,304 KB
testcase_32 AC 29 ms
7,152 KB
testcase_33 AC 30 ms
7,164 KB
testcase_34 AC 30 ms
7,164 KB
testcase_35 AC 30 ms
7,232 KB
testcase_36 AC 28 ms
7,192 KB
testcase_37 AC 28 ms
7,192 KB
testcase_38 AC 28 ms
7,144 KB
testcase_39 AC 27 ms
7,444 KB
testcase_40 AC 27 ms
7,288 KB
testcase_41 AC 19 ms
6,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  friend ModInt operator+(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) += rhs;
  }
  friend ModInt operator-(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) -= rhs;
  }
  friend ModInt operator*(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) *= rhs;
  }
  friend ModInt operator/(const ModInt& lhs, const ModInt& rhs) {
        return ModInt(lhs) /= rhs;
  }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

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

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;

  Combination(ll sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(ll i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(ll i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(ll i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }

  inline T fact(ll k) const { return _fact[k]; }

  inline T rfact(ll k) const { return _rfact[k]; }

  inline T inv(ll k) const { return _inv[k]; }

  T P(ll n, ll r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }

  T C(ll p, ll q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
  
  T RC(ll p, ll q) const {
    if(q < 0 || p < q) return 0;
    return rfact(p) * fact(q) * fact(p - q);
  }

  T H(ll n, ll r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
using modint = ModInt< MOD9 >;modint pow(ll n, ll x){return modint(n).pow(x);}modint pow(modint n, ll x){return n.pow(x);}
//using modint=ld;
using Comb=Combination<modint>;

struct RationalNumber{
  using I=ll;
  I a, b;
  RationalNumber(){
    a = 0,b = 1;
  }
  RationalNumber(I p, I q):a(p), b(q){// a / b
    reduction();
  };
  RationalNumber(I p):a(p), b(1){// a / b
  };
  void reduction(){
    I g = gcd(a, b);
    a /= g, b /= g;
    if(b < 0)a *= -1,b *= -1;
  }
  RationalNumber &operator+=(const RationalNumber &x){
    I q = b / gcd(b, x.b) * x.b;
    a = a * (q / b) + x.a * (q / x.b);
    b = q;
    reduction();
    return *this;
  }
  RationalNumber &operator-=(const RationalNumber &x){
    I q = b / gcd(b, x.b) * x.b;
    a = a * (q / b) - x.a * (q / x.b);
    b = q;
    reduction();
    return *this;
  }
  RationalNumber &operator*=(const RationalNumber &x){
    I q1 = gcd(a, x.b), q2 = gcd(b, x.a); 
    a = (a / q1) * (x.a / q2), b = (b / q2) * (x.b / q1); 
    return *this;
  }
  RationalNumber &operator/=(const RationalNumber &x){
    I q1 = gcd(a, x.a), q2 = gcd(b, x.b); 
    a = (a / q1) * (x.b / q2), b = (b / q2) * (x.a / q1); 
    return *this;
  }
  RationalNumber operator+(const RationalNumber &x)const{
    return RationalNumber(*this) += x;
  }
  RationalNumber operator-(const RationalNumber &x)const{
    return RationalNumber(*this) -= x;
  }
  RationalNumber operator*(const RationalNumber &x)const{
    return RationalNumber(*this) *= x;
  }
  RationalNumber operator/(const RationalNumber &x)const{
    return RationalNumber(*this) /= x;
  }
  RationalNumber operator-()const{
    return RationalNumber(-a, b);
  }
  bool operator==(const RationalNumber &x)const{
    return a * x.b == b * x.a;
  };
  bool operator!=(const RationalNumber &x)const{
    return !(*this == x);
  };
  bool operator<(const RationalNumber &x)const{
    return a * x.b < b * x.a;
  }
  bool operator>(const RationalNumber &x)const{
    return a * x.b > b * x.a;
  }
  bool operator<=(const RationalNumber &x)const{
    return *this < x || *this == x;
  }
  bool operator>=(const RationalNumber &x)const{
    return *this > x || *this == x;
  }
  friend ostream &operator<<(ostream &os, RationalNumber x){
    return os << x.a << "/" << x.b;
  }
};
using rat=RationalNumber;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll t;cin>>t;
  Comb comb(300005);
  while(t--){
    ll n,k;cin>>n>>k;
    vector<ll>a(n);
    ll sum=0;
    rep(i,0,n){
      cin>>a[i];
      sum+=a[i];
    }
    PQ<rat>que;
    modint ret=comb.fact(k)/pow(sum,k);
    rep(i,0,n){
      que.emplace(a[i],1);
    }
    rep(_,0,k){
      auto r=poll(que);
      //cout<<ret spa r<<endl;
      ret*=r.a;
      ret*=comb.inv(r.b);
      r.b++;
      que.push(r);
    }
    cout<<ret<<endl;
  }
  return 0;
}
0