QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#327270 | #8242. V-Diagram | Yshanqian | WA | 83ms | 3840kb | C++14 | 1.6kb | 2024-02-14 21:12:40 | 2024-02-14 21:12:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define xx first
#define yy second
#define endl "\n"
#define lowbit(x) x & (-x)
#define int long long
#define ull unsigned long long
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
const double eps = 1e-8;
int n;
int a[N];
void solve()
{
int pos = 0, s = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i], s += a[i];
for (int i = 2; i <= n; i++)
{
if (a[i - 1] > a[i] && a[i + 1] > a[i])
{
pos = i;
break;
}
}
double ave = 1.0 * s / n;
int pre = pos - 1;
int suf = pos + 1;
int l = 0, r = 0;
for (int i = 1; i < pre; i++)
{
if (a[i] >= ave)
{
l = i;
break;
}
}
if (l == 0)
l = pre;
for (int i = n; i >= suf + 1; i--)
{
if (a[i] >= ave)
{
r = i;
break;
}
}
if (r == 0)
r = suf;
int cnt = 0;
double ans = 0;
for (int i = l; i <= r; i++)
{
ans += a[i];
cnt++;
}
cout << LF(20);
cout << 1.0 * ans / cnt << endl;
}
signed main()
{
Yshanqian;
int T;
T = 1;
cin >> T;
for (int cases = 1; cases <= T; ++cases)
{
// cout<<"Case #"<<cases<<": ";
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3832kb
input:
2 4 8 2 7 10 6 9 6 5 3 4 8
output:
6.75000000000000000000 5.83333333333333303727
result:
ok 2 numbers
Test #2:
score: 0
Accepted
time: 83ms
memory: 3696kb
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.66666662693023681641 435670789.66666668653488159180 770302316.66666662693023681641 608562705.00000000000000000000 296293261.66666668653488159180 319149416.33333331346511840820 571816312.66666662693023681641 223646002.33333334326744079590 39407315.66666666418313980103 383253737.666666686534...
result:
ok 100000 numbers
Test #3:
score: -100
Wrong Answer
time: 26ms
memory: 3840kb
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:
258668002.75000000000000000000 499947495.38372093439102172852 495489050.35294115543365478516 511519421.86301368474960327148 472025965.69999998807907104492 543693608.25000000000000000000 543366581.51612901687622070312 254833443.19999998807907104492 395528440.97435897588729858398 502458665.38461536169...
result:
wrong answer 2nd numbers differ - expected: '527118856.7555556', found: '499947495.3837209', error = '0.0515469'