# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437509 | cmwqfcmwqf | Wombats (IOI13_wombats) | C++14 | 3874 ms | 183844 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;
#define ls node << 1
#define rs node << 1 | 1
const int BK = 10, INF = 1.5e9;
int n, m, lim;
int A[5005][205], B[5005][205];
int f[10][205][205], sum[205], p[205][205];
int T[1025][205][205];
void get(int node, int id)
{
int l = (id - 1) * BK + 1, r = min(n, id * BK), now = 0;
for(int i = 1; i <= m; i++)
{
for(int j = i + 1; j <= m; j++)
f[now][i][j] = f[now][i][j - 1] + A[l][j - 1];
for(int j = i - 1; j >= 1; j--)
f[now][i][j] = f[now][i][j + 1] + A[l][j];
}
for(int k = l + 1; k <= r; k++)
{
now ++;
for(int i = 1; i < m; i++) sum[i] = sum[i - 1] + A[k][i];
for(int i = 1; i <= m; i++)
{
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... |