結果
問題 | No.766 金魚すくい |
ユーザー |
![]() |
提出日時 | 2020-03-30 20:16:58 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 92 ms / 1,500 ms |
コード長 | 3,792 bytes |
コンパイル時間 | 1,085 ms |
コンパイル使用メモリ | 83,724 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-23 01:49:01 |
合計ジャッジ時間 | 4,893 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <string>#include <numeric>#include <utility>#include <tuple>#define REP(i, a, b) for (int i = int(a); i < int(b); i++)using namespace std;using ll = long long int;using P = pair<int, int>;// clang-format off#ifdef _DEBUG_#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)template<typename T> void PPPPP(T t) { cerr << t; }template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }#else#define dump(...) do{ } while(false)#endiftemplate<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 T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }template<typename T> void print(T a) { cout << a << endl; }template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }// clang-format ontemplate<ll MOD = 1000000007>class ModInt {ll n;ModInt constexpr inverse() const {return ModInt::pow(*this, MOD - 2);}public:ModInt(): n(0) {}ModInt(ll _n): n(((_n % MOD) + MOD) % MOD) {}ModInt operator+=(const ModInt &m) {n += m.n;if (n >= MOD) n -= MOD;return *this;}ModInt operator-=(const ModInt &m) {n -= m.n;if (n < 0) n += MOD;return *this;}ModInt operator*=(const ModInt &m) {n *= m.n;if (n >= MOD) n %= MOD;return *this;}ModInt operator/=(const ModInt &m) {(*this) *= m.inverse();return *this;}friend ModInt operator+(ModInt t, const ModInt &m) {return t += m;}friend ModInt operator-(ModInt t, const ModInt &m) {return t -= m;}friend ModInt operator*(ModInt t, const ModInt &m) {return t *= m;}friend ModInt operator/(ModInt t, const ModInt &m) {return t /= m;}ModInt operator=(const ll l) {n = l % MOD;if (n < 0) n += MOD;return *this;}friend ostream &operator<<(ostream &out, const ModInt &m) {out << m.n;return out;}friend istream &operator>>(istream &in, ModInt &m) {ll l;in >> l;m = l;return in;}static constexpr ModInt pow(const ModInt x, ll p) {ModInt<MOD> ans = 1;for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {if (p % 2) ans *= m;}return ans;}};using mint = ModInt<>;mint operator"" _m(unsigned long long m) {return mint(m);}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int n, m;mint p;cin, n, m, p;vector<int> v(n);REP(i, 0, n) {cin, v[i];}sort(v.rbegin(), v.rend());vector<mint> fact(n + m + 1, 1);REP(i, 0, n + m) {fact[i + 1] = (i + 1) * fact[i];}auto nCr = [&fact](int a, int b) {return fact[a] / fact[b] / fact[a - b];};mint ans = 0;mint prob = 0;mint sum = 0;REP(i, 0, n) {mint pp;if (i == 0) {pp = mint::pow(p / 100, m);} else {pp = nCr(m + i - 1, i) * mint::pow(p / 100, m) * mint::pow((100 - p) / 100, i);}ans += pp * sum;prob += pp;sum += v[i];}ans += sum * (1 - prob);cout << ans << endl;return 0;}