# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763418 | SanguineChameleon | Wombats (IOI13_wombats) | C++17 | 20031 ms | 115452 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 "wombats.h"
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 20;
const int maxN = 5e3 + 20;
const int maxM = 2e2 + 20;
const int block = 20;
int hor[maxN][maxM];
int ver[maxN][maxM];
int tmp[maxN][maxM];
int dp[maxN][maxM];
int tree[maxN / block * 4][maxM][maxM];
int N, M;
void calc(int id, int lt, int rt) {
for (int X = 0; X < M; X++) {
dp[lt][X] = 0;
for (int i = X - 1; i >= 0; i--) {
dp[lt][i] = dp[lt][i + 1] + hor[lt][i];
}
for (int i = X + 1; i < M; i++) {
dp[lt][i] = dp[lt][i - 1] + hor[lt][i - 1];
}
for (int i = lt + 1; i <= rt; i++) {
for (int j = 0; j < M; j++) {
tmp[i][j] = dp[i - 1][j] + ver[i - 1][j];
dp[i][j] = tmp[i][j];
}
int best = tmp[i][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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |