# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875960 | rainboy | Coins (LMIO19_monetos) | C11 | 2055 ms | 53760 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>
#include <string.h>
#define N 300
#define M (N * N / 2)
#define L 64
#define INF 0x3f3f3f3f
typedef unsigned long long ull;
int main() {
static int cc[N][N], cc_[N][N], dp[N + 1][M + 1];
int n, m, i, i_, j, j_, s, s_, x;
scanf("%*d%d%*d%*d", &n), m = n * n / 2;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
scanf("%d", &cc[i][j]);
for (j = 1; j < n; j++)
cc[i][j] += cc[i][j - 1];
}
for (i = 0; i <= n; i++)
memset(dp[i], 0x3f, (m + 1) * sizeof *dp[i]);
dp[0][0] = 0;
for (j = n - 1; j >= 0; j--)
for (i = 0; i < n; i++) {
i_ = i + 1;
for (s = i * (j + 1); (s_ = s + j + 1) <= m; s++)
if (dp[i][s] != INF) {
s_ = s + j + 1, x = dp[i][s] + cc[i][j];
if (dp[i_][s_] > x)
dp[i_][s_] = x;
}
}
i_ = -1;
for (i = 0; i <= n; i++)
if (i_ == -1 || dp[i_][m] > dp[i][m])
i_ = i;
for (i = i_; i < n; i++)
for (j = 0; j < n; j++)
cc_[i][j] = 1;
#if 1
printf("%d\n", dp[i_][m]);
#else
j_ = 0, s_ = m;
while (i_ > 0) {
while ((dq[i_][s_][j_ / L] & 1ULL << j_ % L) == 0)
j_++;
i_--, s_ -= j_ + 1;
for (j = 0; j < n; j++)
cc_[i_][j] = j <= j_ ? 0 : 1;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
printf("%d ", cc_[i][j]);
printf("\n");
}
#endif
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |