# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303039 | Kenzo_1114 | Sure Bet (CEOI17_sure) | C++17 | 51 ms | 768 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int n, m[20];
double a[MAXN], b[MAXN], ans;
void BKT(int id)
{
if(id == n)
{
double sa = 0.0000, sb = 0.0000;
for(int i = 0; i < n; i++)
{
if(m[i] == 0) continue;
if(m[i] == 1 || m[i] == 3) sa += a[i] - 1, sb--;
if(m[i] == 2 || m[i] == 3) sb += b[i] - 1, sa--;
ans = max(ans, min(sa, sb));
}
return;
}
for(int i = 0; i < 4; i++)
{
m[id] = i;
BKT(id + 1);
}
}
int main ()
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%lf %lf", &a[i], &b[i]);
BKT(0);
printf("%.4lf\n", (double) ans);
}
/*
4
1.4 3.7
1.2 2
1.6 1.4
1.9 1.5
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |