# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95543 | tincamatei | Horses (IOI15_horses) | C++14 | 23 ms | 10616 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 MAX_N = 10;
const int MAX_VAL = 1000;
int dp[1+MAX_N][1+MAX_VAL];
int init(int N, int X[], int Y[]) {
for(int i = 0; i <= MAX_VAL; ++i)
dp[0][i] = -1000000000;
dp[0][1] = 0;
for(int i = 0; i < N; ++i) {
for(int j = 0; j <= MAX_VAL; ++j)
dp[i + 1][j] = -1000000000;
for(int j = 0; j <= MAX_VAL; ++j) {
int j2 = j * X[i];
if(j2 <= MAX_VAL) {
for(int sold = 0; sold <= j2; ++sold) {
dp[i + 1][j2 - sold] = max(dp[i + 1][j2 - sold], dp[i][j] + sold * Y[i]);
}
}
}
}
return dp[N][0];
}
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... |