# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437529 | He_Ren | Wombats (IOI13_wombats) | C++98 | 10454 ms | 71388 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<bits/stdc++.h>
#include"wombats.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 5e3 + 5;
const int MAXM = 2e2 + 5;
const int B = 32;
const int MAXP = MAXN / B + 1;
int n,m;
int a[MAXN][MAXM], b[MAXN][MAXM];
struct Data
{
int l, r, f[MAXM][MAXM];
inline void rebuild(void)
{
memset(f,0x3f,sizeof(f));
for(int i=1; i<=m; ++i) f[i][i] = 0;
for(int k=l; k<=r; ++k)
{
for(int i=1; i<=m; ++i)
{
for(int j=m-1; j>=1; --j)
f[i][j] = min(f[i][j], f[i][j+1] + a[k][j]);
for(int j=2; j<=m; ++j)
f[i][j] = min(f[i][j], f[i][j-1] + a[k][j-1]);
}
if(k == r) break;
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... |