結果
問題 | No.1554 array_and_me |
ユーザー |
|
提出日時 | 2021-06-28 22:51:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 63 ms / 2,000 ms |
コード長 | 10,683 bytes |
コンパイル時間 | 2,028 ms |
コンパイル使用メモリ | 210,552 KB |
最終ジャッジ日時 | 2025-01-22 14:48:19 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>using namespace std;/*^ debug */template <typename A, typename B> string to_string(pair<A, B> p);template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);string to_string(const string& s) { return '"' + s + '"'; }string to_string(const char* s) { return to_string((string) s); }string to_string(bool b) { return (b ? "true" : "false"); }string to_string(vector<bool> v) {bool first = true;string res = "{";for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) { res += ", "; }first = false;res += to_string(v[i]);}res += "}";return res;}template <size_t N>string to_string(bitset<N> v) {string res = "";for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); }return res;}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) { res += ", "; }first = false;res += to_string(x);}res += "}";return res;}template <typename A, typename B>string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; }template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " +to_string(get<3>(p)) + ")"; }void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }#ifdef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 42#endif/* debug $*//*^ generic definitions */template<typename F>struct _RecurFun : F {_RecurFun(F&& f) : F(forward<F>(f)) {}template<typename... Args>decltype(auto) operator()(Args&&... args) const { return F::operator()(*this, forward<Args>(args)...); }};template<typename F>decltype(auto) RecurFun(F&& f) { return _RecurFun<F> { forward<F>(f) }; }template<typename D, typename R>vector<R> maps(const vector<D> &&d, function<R(D)> f) {vector<R> r(d.size());for (int i = 0; i < (int) d.size(); ++i) r[i] = f(d[i]);return r;}/* generic definitions $*//* https://codeforces.com/contest/1466/submission/102810637 */template <typename T>T inverse(T a, T m) {T u = 0, v = 1;while (a != 0) {T t = m / a;m -= t * a; swap(a, m);u -= t * v; swap(u, v);}assert(m == 1);return u;}template <typename T>class Modular {public:using Type = typename decay<decltype(T::value)>::type;constexpr Modular() : value() {}template <typename U>Modular(const U& x) {value = normalize(x);}template <typename U>static Type normalize(const U& x) {Type v;if (-mod() <= x && x < mod()) v = static_cast<Type>(x);else v = static_cast<Type>(x % mod());if (v < 0) v += mod();return v;}const Type& operator()() const { return value; }template <typename U>explicit operator U() const { return static_cast<U>(value); }constexpr static Type mod() { return T::value; }Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }Modular& operator++() { return *this += 1; }Modular& operator--() { return *this -= 1; }Modular operator++(int) { Modular result(*this); *this += 1; return result; }Modular operator--(int) { Modular result(*this); *this -= 1; return result; }Modular operator-() const { return Modular(-value); }template <typename U = T>typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {#ifdef _WIN32uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;asm("divl %4; \n\t": "=a" (d), "=d" (m): "d" (xh), "a" (xl), "r" (mod()));value = m;#elsevalue = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));#endifreturn *this;}template <typename U = T>typename enable_if<is_same<typename Modular<U>::Type, long long>::value, Modular>::type& operator*=(const Modular& rhs) {long long q = static_cast<long long>(static_cast<long double>(value) * rhs.value / mod());value = normalize(value * rhs.value - q * mod());return *this;}template <typename U = T>typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {value = normalize(value * rhs.value);return *this;}Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }friend const Type& abs(const Modular& x) { return x.value; }template <typename U>friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);template <typename U>friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);template <typename V, typename U>friend V& operator>>(V& stream, Modular<U>& number);private:Type value;};template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }template<typename T, typename U>Modular<T> power(const Modular<T>& a, const U& b) {assert(b >= 0);Modular<T> x = a, res = 1;U p = b;while (p > 0) {if (p & 1) res *= x;x *= x;p >>= 1;}return res;}template <typename T>bool IsZero(const Modular<T>& number) {return number() == 0;}template <typename T>string to_string(const Modular<T>& number) {return to_string(number());}// U == std::ostream? but done this way because of fastoutputtemplate <typename U, typename T>U& operator<<(U& stream, const Modular<T>& number) {return stream << number();}// U == std::istream? but done this way because of fastinputtemplate <typename U, typename T>U& operator>>(U& stream, Modular<T>& number) {typename common_type<typename Modular<T>::Type, long long>::type x;stream >> x;number.value = Modular<T>::normalize(x);return stream;}/*using ModType = int;struct VarMod { static ModType value; };ModType VarMod::value;ModType& md = VarMod::value;using Mint = Modular<VarMod>;*/constexpr int md = (int) 998244353;using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;/*vector<Mint> fact(1, 1);vector<Mint> inv_fact(1, 1);Mint C(int n, int k) {if (k < 0 || k > n) {return 0;}while ((int) fact.size() < n + 1) {fact.push_back(fact.back() * (int) fact.size());inv_fact.push_back(1 / fact.back());}return fact[n] * inv_fact[k] * inv_fact[n - k];}*/int main() {ios::sync_with_stdio(false);int T; {cin >> T;}while (T--) {int N, K; {cin >> N >> K;}vector<int> A(N); {for (int i = 0; i < N; ++i) {cin >> A[i];}}vector<int> X(N); {auto cmp = [&](tuple<int, int, int> a, tuple<int, int, int> b) {auto [pi, xi, i] = a;auto [pj, xj, j] = b;return pi * (xj+1) < pj * (xi+1);};priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, decltype(cmp)> pq(cmp);for (int i = 0; i < N; ++i) {pq.emplace(A[i], X[i], i);}for (int _ = 0; _ < K; ++_) {auto [p, x, i] = pq.top();pq.pop();pq.emplace(p, X[i]=x+1, i);}}debug(X);vector<Mint> fact(K+1); {fact[0] = 1;for (int i = 1; i <= K; ++i) {fact[i] = fact[i-1] * i;}}Mint suma; {for (int a : A) suma += a;}Mint res = 1; {for (int i = 1; i <= K; ++i) res *= i;for (int i = 0; i < N; ++i) {res *= power(Mint(A[i]) / suma, X[i]);res /= fact[X[i]];}}cout << res << endl;}}