Submission #1182306
Source Code Expand
#include<iostream> #include<cstdio> #include<algorithm> #include<cmath> #include<cstring> #include<vector> #include<queue> #include<set> #include<map> #include<stack> #include<bitset> #include<ext/pb_ds/priority_queue.hpp> using namespace std; typedef long long LL; typedef double DB; int n,A,B,c1,c2; DB Ans,a[55]; LL C[55][55]; int main() { #ifdef DMC freopen("DMC.txt","r",stdin); #endif cin >> n >> A >> B; for (int i = 1; i <= n; i++) scanf("%lf",&a[i]); C[0][0] = 1; for (int i = 1; i <= 50; i++) { C[i][0] = 1; for (int j = 1; j <= 50; j++) C[i][j] = C[i - 1][j] + C[i - 1][j - 1]; } sort(a + 1,a + n + 1); reverse(a + 1,a + n + 1); bool flag = 1; for (int i = 2; i <= A; i++) if (fabs(a[i] - a[i - 1]) >= 1E-9) flag = 0; if (flag) { LL tot = 0; printf("%.8lf\n",a[1]); for (int i = 1; i <= n; i++) if (fabs(a[i] - a[1]) <= 1E-9) ++c1; for (int i = A; i <= B; i++) tot += C[c1][i]; cout << tot << endl; return 0; } for (int i = 1; i <= A; i++) Ans += a[i]; for (int i = 1; i <= n; i++) if (fabs(a[i] - a[A]) <= 1E-9) ++c1; for (int i = 1; i <= A; i++) if (fabs(a[i] - a[A]) <= 1E-9) ++c2; printf("%.10lf\n",Ans / (DB)(A)); cout << C[c1][c2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Maximum Average Sets |
User | Charming_Chen |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1276 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 1; i <= n; i++) scanf("%lf",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 1 ms | 256 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |
subtask_1_2.txt | AC | 1 ms | 256 KB |
subtask_1_3.txt | AC | 1 ms | 256 KB |
subtask_1_4.txt | AC | 1 ms | 256 KB |
subtask_1_5.txt | AC | 1 ms | 256 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |
subtask_1_8.txt | AC | 1 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |