結果
問題 | No.766 金魚すくい |
ユーザー | omochanal |
提出日時 | 2018-12-19 19:09:22 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 30 ms / 1,500 ms |
コード長 | 3,045 bytes |
コンパイル時間 | 1,421 ms |
コンパイル使用メモリ | 164,828 KB |
実行使用メモリ | 13,216 KB |
最終ジャッジ日時 | 2024-09-25 08:06:04 |
合計ジャッジ時間 | 3,690 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
10,716 KB |
testcase_01 | AC | 9 ms
11,744 KB |
testcase_02 | AC | 9 ms
9,952 KB |
testcase_03 | AC | 9 ms
10,712 KB |
testcase_04 | AC | 8 ms
11,744 KB |
testcase_05 | AC | 8 ms
11,740 KB |
testcase_06 | AC | 8 ms
10,460 KB |
testcase_07 | AC | 8 ms
10,460 KB |
testcase_08 | AC | 9 ms
10,460 KB |
testcase_09 | AC | 9 ms
11,744 KB |
testcase_10 | AC | 8 ms
10,076 KB |
testcase_11 | AC | 9 ms
10,204 KB |
testcase_12 | AC | 8 ms
11,612 KB |
testcase_13 | AC | 11 ms
9,956 KB |
testcase_14 | AC | 9 ms
10,592 KB |
testcase_15 | AC | 8 ms
9,948 KB |
testcase_16 | AC | 9 ms
10,208 KB |
testcase_17 | AC | 9 ms
10,464 KB |
testcase_18 | AC | 8 ms
10,468 KB |
testcase_19 | AC | 8 ms
9,952 KB |
testcase_20 | AC | 8 ms
10,204 KB |
testcase_21 | AC | 8 ms
10,080 KB |
testcase_22 | AC | 8 ms
10,848 KB |
testcase_23 | AC | 29 ms
12,132 KB |
testcase_24 | AC | 29 ms
13,028 KB |
testcase_25 | AC | 30 ms
12,896 KB |
testcase_26 | AC | 28 ms
11,872 KB |
testcase_27 | AC | 30 ms
12,388 KB |
testcase_28 | AC | 28 ms
12,784 KB |
testcase_29 | AC | 28 ms
13,024 KB |
testcase_30 | AC | 28 ms
12,784 KB |
testcase_31 | AC | 30 ms
12,252 KB |
testcase_32 | AC | 29 ms
12,128 KB |
testcase_33 | AC | 29 ms
12,000 KB |
testcase_34 | AC | 29 ms
12,260 KB |
testcase_35 | AC | 9 ms
9,944 KB |
testcase_36 | AC | 9 ms
10,592 KB |
testcase_37 | AC | 29 ms
12,768 KB |
testcase_38 | AC | 29 ms
11,876 KB |
testcase_39 | AC | 30 ms
13,216 KB |
testcase_40 | AC | 28 ms
12,256 KB |
testcase_41 | AC | 21 ms
12,256 KB |
testcase_42 | AC | 20 ms
12,260 KB |
testcase_43 | AC | 9 ms
10,328 KB |
testcase_44 | AC | 8 ms
11,740 KB |
ソースコード
#include <bits/stdc++.h> #define ADD(a, b) a = (a + ll(b)) % mod #define MUL(a, b) a = (a * ll(b)) % mod #define MAX(a, b) a = max(a, b) #define MIN(a, b) a = min(a, b) #define rep(i, a, b) for(int i = int(a); i < int(b); i++) #define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--) #define all(a) (a).begin(), (a).end() #define sz(v) (int)(v).size() #define pb push_back #define sec second #define fst first #define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<int, pi> ppi; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<vl> mat; typedef complex<double> comp; void Debug() {cout << '\n'; } template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){ cout<<arg<<" ";Debug(rest...);} template<class T>ostream& operator<<(ostream& out,const vector<T>& v) { out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;} template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){ out<<"("<<v.first<<", "<<v.second<<")";return out;} const int MAX_N = 300010; const int MAX_V = 100010; const double eps = 1e-6; const ll mod = 1000000007; const int inf = 1 << 30; const ll linf = 1LL << 60; const double PI = 3.14159265358979323846; /////////////////////////////////////////////////////////////////////////////////////////////////// ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; //fiv:inv(fac(i)) ll mod_pow(ll a, ll n) { if(n == 0) return 1; ll res = mod_pow(a, n / 2); if(n % 2 == 0) return res * res % mod; else return a * res % mod * res % mod; } ll invf(ll a) { return mod_pow(a, mod - 2); } void C_init(int n) { fac[0] = fac[1] = 1; inv[1] = 1; fiv[0] = fiv[1] = 1; rep(i, 2, n + 1) { fac[i] = fac[i - 1] * i % mod; inv[i] = mod - inv[mod % i] * (mod / i) % mod; fiv[i] = fiv[i - 1] * inv[i] % mod; } } ll C(int a, int b) { //assume a >= b if(a < b || a < 0 || b < 0) return 0; return fac[a] * fiv[b] % mod * fiv[a - b] % mod; } int N, M; ll P; ll prob[MAX_N]; ll V[MAX_N]; void solve() { cin >> N >> M >> P; C_init(200010); P = (100 - P); P = P * inv[100] % mod; ll mult = mod_pow(1 - P + mod, M - 1); rep(i, 0, N) { // debug(mult, C(M - 1 + i, M - 1) * (1 - P + mod) % mod); prob[i + 1] = mult * C(M - 1 + i, M - 1) % mod * (1 - P + mod) % mod; ADD(prob[i + 1], prob[i]); MUL(mult, P); } rep(i, 0, N) cin >> V[i]; sort(V, V + N); reverse(V, V + N); ll res = 0; rep(i, 0, N) { // debug(i, prob[i + 1]); ADD(res, V[i] * (1 - prob[i + 1] + mod) % mod); } cout << res << "\n"; } int main() { #ifndef LOCAL ios::sync_with_stdio(false); cin.tie(0); #endif cout << fixed; cout.precision(20); srand((unsigned int)time(NULL)); #ifdef LOCAL //freopen("in.txt", "wt", stdout); //for tester freopen("in.txt", "rt", stdin); #endif solve(); #ifdef LOCAL cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }