結果
問題 | No.766 金魚すくい |
ユーザー |
|
提出日時 | 2019-03-13 22:37:50 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 160 ms / 1,500 ms |
コード長 | 2,618 bytes |
コンパイル時間 | 1,116 ms |
コンパイル使用メモリ | 117,976 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-24 08:26:05 |
合計ジャッジ時間 | 6,203 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
// includes#include <cstdio>#include <cstdint>#include <iostream>#include <iomanip>#include <string>#include <queue>#include <stack>#include <vector>#include <set>#include <map>#include <unordered_map>#include <algorithm>#include <utility>#include <functional>#include <cmath>#include <climits>#include <bitset>#include <list>#include <random>// macros#define ll long long int#define pb emplace_back#define mk make_pair#define pq priority_queue#define FOR(i, a, b) for(int i=(a);i<(b);++i)#define rep(i, n) FOR(i, 0, n)#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)#define all(x) (x).begin(),(x).end()#define sz(x) ((int)(x).size())#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())using namespace std;// typestypedef pair<int, int> P;typedef pair<ll, int> Pl;typedef pair<ll, ll> Pll;typedef pair<double, double> Pd;// constantsconst int inf = 1e9;const ll linf = 1LL << 50;const double EPS = 1e-10;const int mod = 1e9 + 7;// solvetemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}template <typename T>T power(T a, T n, T mod) {T res = 1;T tmp = n;T curr = a;while(tmp){if(tmp % 2 == 1){res = (T)((ll)res * curr % mod);}curr = (T)((ll)curr * curr % mod);tmp >>= 1;}return res;}ll fac[200001];int main(int argc, char const* argv[]){ios_base::sync_with_stdio(false);cin.tie(0);fac[0] = 1;for(int i = 1; i <= 200000; i++)fac[i] = i * fac[i-1] % mod;int n, m, p;cin >> n >> m >> p;ll res = 0;vector<ll> v(n), vsum(n, 0);rep(i, n)cin >> v[i];sort(all(v), greater<ll>());rep(i, n){vsum[i] = v[i];if(i > 0)vsum[i] = (vsum[i-1] + vsum[i]) % mod;}for(int k = 1; k < n; k++){ll tmp = power<ll>(p, m, mod) * power<ll>(100-p, k, mod) % mod;tmp = tmp * power<ll>(power<ll>(100, m+k, mod), mod-2, mod) % mod;tmp = tmp * fac[m+k-1] % mod;tmp = tmp * power<ll>(fac[k], mod-2, mod) % mod;tmp = tmp * power<ll>(fac[m-1], mod-2, mod) % mod;tmp = tmp * vsum[k-1] % mod;res = (res + tmp) % mod;}for(int l = 0; l < m; l++){ll tmp = power<ll>(p, l, mod) * power<ll>(100-p, n, mod) % mod;tmp = tmp * power<ll>(power<ll>(100, l+n, mod), mod-2, mod) % mod;tmp = tmp * fac[n+l-1] % mod;tmp = tmp * power<ll>(fac[l], mod-2, mod) % mod;tmp = tmp * power<ll>(fac[n-1], mod-2, mod) % mod;tmp = tmp * vsum[n-1] % mod;res = (res + tmp) % mod;}cout << res << endl;return 0;}