# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920633 | rainboy | 요리 강좌 (KOI17_cook) | C++17 | 7 ms | 2652 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 <assert.h>
#include <stdio.h>
#define N 3000
#define K 3000
#define INF 1000000000
int min(int a, int b) { return a < b ? a : b; }
int main() {
static int ss[K][N + 1], pp[K], dp[K][N + 1], dq[K][N + 1], qu[K][N + 1], head[K], cnt[K];
int n, k, l, r, t, h, h1, h2, h3, h_, i, j, ans;
scanf("%d%d%d%d%d", &k, &n, &l, &r, &t);
for (h = 0; h < k; h++)
for (i = 1; i <= n; i++)
scanf("%d", &ss[h][i]), ss[h][i] += ss[h][i - 1];
for (h = 0; h < k; h++)
scanf("%d", &pp[h]), pp[h]--;
/*
for (i = 0; i <= n; i++) {
h1 = h2 = h3 = -1;
for (h = 0; h < k; h++) {
dp[h][i] = (i == 0 ? -t : (cnt[h] ? dq[h][qu[h][head[h]]] : INF));
if (dp[h][i] != INF) {
dp[h][i] += ss[h][i];
if (h1 == -1 || dp[h1][i] > dp[h][i])
h3 = h2, h2 = h1, h1 = h;
else if (h2 == -1 || dp[h2][i] > dp[h][i])
h3 = h2, h2 = h;
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... |