| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 56081 | gabrielsimoes | Sure Bet (CEOI17_sure) | C++17 | 2070 ms | 568 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;
typedef long long ll;
const int MAXN = 1e5+10;
int n;
double pa[MAXN], pb[MAXN];
double ans = 0;
void dfs(int i, double a, double b) {
// printf("i %d a %lf b %lf\n", i, a, b);
if (i == n) {
ans = max(ans, min(a, b));
} else {
dfs(i+1, a, b);
dfs(i+1, a-1.0, b+pb[i]-1.0);
dfs(i+1, a+pa[i]-1.0, b-1.0);
dfs(i+1, a+pa[i]-2.0, b+pb[i]-2.0);
}
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
double a, b;
scanf("%lf %lf", &a, &b);
// pa[i] = 1e4 * a;
// pb[i] = 1e4 * b;
pa[i] = a;
pb[i] = b;
}
dfs(0, 0, 0);
printf("%.4lf\n", ans);
}
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... | ||||
