# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156761 | Alexa2001 | Wombats (IOI13_wombats) | C++17 | 20102 ms | 19908 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 B = 500, Cmax = 205, Rmax = 5005;
const int inf = 1e8;
int N, M, rm;
int h[Rmax][Cmax], v[Rmax][Cmax];
static void min_to(int &x, int y) { if(x > y) x = y ;}
static void rec(int a[], int p)
{
int i;
for(i=1; i<M; ++i)
min_to(a[i], a[i-1] + h[p][i-1]);
for(i=M-2; i>=0; --i)
min_to(a[i], a[i+1] + h[p][i]);
}
struct matrix
{
int a[Cmax][Cmax];
void combine(matrix &A, matrix &B, int pos)
{
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... |