# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941193 | peterandvoi | Let's Win the Election (JOI22_ho_t3) | C++17 | 197 ms | 2648 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;
#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 505;
int n, k;
double dp[N][N];
pair<double, double> a[N];
double get(int mid) {
for (int i = 0; i <= n; ++i) {
for (int j = 0; j <= k - mid; ++j) {
dp[i][j] = 1e9;
}
}
dp[0][0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= k - mid; ++j) {
int x = i - j - 1;
if (j > 0) {
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + 1.0 * a[i].first / (mid + 1));
}
dp[i][j] = min(dp[i][j], dp[i - 1][j] + (x < mid ? 1.0 * a[i].second / (x + 1) : 0));
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |