# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527877 | rainboy | 코알라 (JOI13_koala) | C11 | 7 ms | 560 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 <stdio.h>
#define N 1000
#define INF 0x3f3f3f3f3f3f3f3fLL
long long max(long long a, long long b) { return a > b ? a : b; }
int main() {
static int xx[N + 2], bb[N + 2];
static long long dp[N + 2];
int n, xl, xr, d, a, i, j;
scanf("%d%d%d%d%d", &xl, &xr, &d, &a, &n);
xx[0] = xl;
for (i = 1; i <= n; i++)
scanf("%d%d", &xx[i], &bb[i]);
xx[n + 1] = xr;
n += 2;
dp[0] = 0;
for (j = 1; j < n; j++) {
dp[j] = -INF;
for (i = 0; i < j; i++)
dp[j] = max(dp[j], dp[i] - (long long) (xx[j] - xx[i] + d - 1) / d * a + bb[j]);
}
printf("%lld\n", dp[n - 1]);
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... |