# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47733 | 2018-05-07T02:19:09 Z | RezwanArefin01 | Horses (IOI15_horses) | C++17 | 15 ms | 10536 KB |
#include "horses.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int mod = 1e9 + 7; int n, x[11]; ll y[11]; ll dp[11][1010]; ll call(int pos, int cur) { if(pos == n - 1) return y[pos] * cur; ll &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) % mod; } int updateX(int pos, int val) { return 0; } int updateY(int pos, int val) { return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 496 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 15 ms | 10536 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 10536 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 10536 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |