Submission #1443566
Source Code Expand
#include <iostream>
#include <cstdio>
#include <algorithm>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
ll N, A, B, V[50];
ll combination(ll n, ll r) {
static ll comb[51][51];
ll &ret = comb[n][r];
if(ret != 0) return ret;
if(n == 0 || r == 0) return ret = 1;
if(n == r) return ret = 1;
if(r == 1) return ret = n;
return ret = combination(n - 1, r - 1) + combination(n - 1, r);
}
int main(void) {
cin >> N >> A >> B;
REP(i, 0, N) cin >> V[i];
sort(V, V + N);
double ave;
ll sum = 0;
REP(i, 0, A) sum += V[N - i - 1];
ave = (double) sum / A;
ll ans = 0;
ll c = upper_bound(V + (N - A), V + N, V[N - A]) - lower_bound(V + (N - A), V + N, V[N - A]);
ll d = upper_bound(V, V + N, V[N - A]) - lower_bound(V, V + N, V[N - A]);
cout << c << " " << d << endl;
if(V[N - 1] != V[N - A]) ans = combination(d, c);
else REP(i, c, min(B, d) + 1) ans += combination(d, i);
printf("%.8lf\n%lld\n", ave, ans);
}
Submission Info
Submission Time |
|
Task |
D - Maximum Average Sets |
User |
kshinya |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1042 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
WA |
1 ms |
256 KB |
sample_02.txt |
WA |
1 ms |
256 KB |
sample_03.txt |
WA |
1 ms |
256 KB |
sample_04.txt |
WA |
1 ms |
256 KB |
subtask_1_1.txt |
WA |
1 ms |
256 KB |
subtask_1_10.txt |
WA |
1 ms |
256 KB |
subtask_1_11.txt |
WA |
1 ms |
256 KB |
subtask_1_12.txt |
WA |
1 ms |
256 KB |
subtask_1_13.txt |
WA |
1 ms |
256 KB |
subtask_1_14.txt |
WA |
1 ms |
256 KB |
subtask_1_15.txt |
WA |
1 ms |
256 KB |
subtask_1_2.txt |
WA |
1 ms |
256 KB |
subtask_1_3.txt |
WA |
1 ms |
256 KB |
subtask_1_4.txt |
WA |
1 ms |
256 KB |
subtask_1_5.txt |
WA |
1 ms |
256 KB |
subtask_1_6.txt |
WA |
1 ms |
256 KB |
subtask_1_7.txt |
WA |
1 ms |
256 KB |
subtask_1_8.txt |
WA |
1 ms |
256 KB |
subtask_1_9.txt |
WA |
1 ms |
256 KB |