| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1027264 |
2024-07-19T02:57:53 Z |
coin_ |
Sure Bet (CEOI17_sure) |
C++14 |
|
75 ms |
3556 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
double a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
{
cin >> a[i] >> b[i];
}
sort(a + 1, a + n + 1, greater<double>());
sort(b + 1, b + n + 1, greater<double>());
double prefA[n + 1] = {0}, prefB[n + 1] = {0};
prefA[1] = a[1];
prefB[1] = b[1];
for (int i = 2; i <= n; i++)
{
prefA[i] = prefA[i - 1] + a[i];
prefB[i] = prefB[i - 1] + b[i];
}
double ans = 0;
for (int i = 1; i <= n; i++)
{
int l = 1, r = n;
while (r - l > 1)
{
int mid = l + (r - l) / 2;
double valmid = min(prefA[i] - (double)i - (double)mid, prefB[mid] - (double)i - (double)mid);
double valnxt = min(prefA[i] - (double)i - (double)(mid+1), prefB[mid+1] - (double)i - (double)(mid+1));
if (valmid > valnxt)
{
r = mid;
}
else
{
l = mid;
}
}
double vall = min(prefA[i] - (double)i - (double)l, prefB[l] - (double)i - (double)l);
double valr = min(prefA[i] - (double)i - (double)r, prefB[r] - (double)i - (double)r);
if (vall > valr)
{
ans = max(ans, vall);
}
else
{
ans = max(ans, valr);
}
}
cout << fixed << setprecision(4) << ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
55 ms |
3556 KB |
Output is correct |
| 18 |
Correct |
55 ms |
3408 KB |
Output is correct |
| 19 |
Correct |
55 ms |
3536 KB |
Output is correct |
| 20 |
Correct |
53 ms |
3544 KB |
Output is correct |
| 21 |
Correct |
75 ms |
3532 KB |
Output is correct |
| 22 |
Correct |
63 ms |
3528 KB |
Output is correct |
| 23 |
Correct |
71 ms |
3412 KB |
Output is correct |
| 24 |
Correct |
56 ms |
3540 KB |
Output is correct |
| 25 |
Correct |
54 ms |
3416 KB |
Output is correct |
| 26 |
Correct |
56 ms |
3412 KB |
Output is correct |
