Submission #1303264
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #define MOD 1000000007 #define INTMAX 0x7fffffff #define INTMIN 0x80000000 #define LLMAX 0x7fffffffffffffffLL #define LLMIN 0x8000000000000000LL #define PRINT_CONTAINER(c) for(auto itr = c.begin(); itr != c.end(); ++itr) {cout << *itr << endl;} using namespace std; using ll = long long; ll combination(ll n, ll k) { ll r = 1; for (ll d = 1; d <= k; ++d) { r *= n--; r /= d; } return r; } int main(){ // input // A <= x <= B int N, A, B; cin >> N >> A >> B; vector<ll> v(N); for (int i = 0; i < N; ++i) { cin >> v[i]; } // sort sort(v.begin(), v.end(), greater<ll>()); // calculate max average long double average = 0; for (int i; i < A; ++i) { average += v[i]; } average /= A; cout << average << endl; // calculate combination ll n = v[A - 1]; int min_i = 0; int max_i = N-1; while(v[min_i] != n){ min_i++; } while(v[max_i] != n){ max_i--; } int w = max_i - min_i + 1; ll comb = 0; for (int k = A - min_i; k <= B - min_i; ++k) { if (v[min_i + k - 1] != n) { break; } comb += combination(w, k); if (min_i != 0) { break; } } cout << comb << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Maximum Average Sets |
User | sidebook37 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1277 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 | 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 | WA | 1 ms | 256 KB |
subtask_1_13.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask_1_8.txt | AC | 1 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |