QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#675096 | #8242. V-Diagram | 1ockhart | WA | 107ms | 3936kb | C++20 | 1.2kb | 2024-10-25 17:57:50 | 2024-10-25 17:57:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
using ll = long long;
//using i128 = __int128_t;
#define endl "\n"
#define int long long
#define db cout << "db" << endl;
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 5e5 + 10;
ll inf = 2e18;
void solve() {
int n;
cin >> n;
vector<long double> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int p;
for (int i = 2; i < n; i++) {
if (a[i] < a[i - 1] && a[i] < a[i + 1]) {
p = i;
}
}
long double sum1 = 0;
for (int i = 1; i <= p + 1; i++) {
sum1 += a[i];
}
long double ans = sum1 / (p + 1);
for (int i = p + 2; i <= n; i++) {
sum1 += a[i];
ans = max(ans, sum1 / i);
}
for (int i = 1; i < p; i++) {
sum1 -= a[i];
ans = max(ans, sum1 / (n - i));
}
cout << fixed << setprecision(20) << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int q = 1;
cin >> q;
while (q --) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3788kb
input:
2 4 8 2 7 10 6 9 6 5 3 4 8
output:
6.75000000000000000000 5.83333333333333333348
result:
ok 2 numbers
Test #2:
score: 0
Accepted
time: 107ms
memory: 3880kb
input:
100000 3 948511478 739365502 813471668 3 881046825 27458122 398507422 3 987554257 399092415 924260278 3 984128569 125199021 716360525 3 529589236 45783262 313507287 3 645443456 85994112 226010681 3 914820717 228360911 572267310 3 418958362 56703604 195276041 3 64461646 26764720 26995581 3 914535039 ...
output:
833782882.66666666668606922030 435670789.66666666665696538985 770302316.66666666668606922030 608562705.00000000000000000000 296293261.66666666665696538985 319149416.33333333334303461015 571816312.66666666668606922030 223646002.33333333332848269492 39407315.66666666666787932627 383253737.666666666656...
result:
ok 100000 numbers
Test #3:
score: -100
Wrong Answer
time: 44ms
memory: 3936kb
input:
10000 4 194123849 79274911 191162487 570110764 86 957917218 915359202 914726017 873273226 867724859 867674150 809652204 805531383 745262007 743835491 727071232 714782071 645394643 639432679 594879540 587173904 583418126 560538589 518721836 469558994 427721766 411582333 404948350 402948978 357228675 ...
output:
280182720.66666666665696538985 538557639.95454545452957972884 495489050.35294117647572420537 537734928.64102564100176095963 472025965.70000000001164153218 546154003.12500000000000000000 543366581.51612903224304318428 254833443.19999999999708961695 447343683.31578947367961518466 502458665.38461538462...
result:
wrong answer 1st numbers differ - expected: '258668002.7500000', found: '280182720.6666667', error = '0.0831750'