# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47735 | RezwanArefin01 | Horses (IOI15_horses) | C++17 | 24 ms | 9444 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 "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, x[11], y[11];
int dp[11][1010];
int call(int pos, int cur) {
if(pos == n || !cur) return 0;
int &ret = dp[pos][cur];
if(ret != -1) return ret;
ret = 0;
int tot = cur * x[pos];
for(int i = 0; i <= tot; i++) {
ret = max(ret, call(pos + 1, tot - i) + i * y[pos]);
} return ret;
}
int init(int N, int X[], int Y[]) {
n = N;
for(int i = 0; i < N; i++)
x[i] = X[i], y[i] = Y[i];
memset(dp, -1, sizeof dp);
return call(0, 1);
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 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... |