# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286435 | evpipis | Wombats (IOI13_wombats) | C++11 | 20075 ms | 30420 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 len_n = 5005, len_m = 205, inf = 1e9+10;
int hor[len_n][len_m], ver[len_n][len_m], n, m, k;
struct{
struct node{
int to[len_m][len_m];
node(){
for (int a = 0; a < m; a++)
for (int b = 0; b < m; b++)
to[a][b] = inf; // check this
}
node(int i){
for (int a = 0; a < m; a++)
for (int b = 0; b < m; b++)
to[a][b] = inf; // check this
for (int a = 0, suma = 0; a < m; a++){
for (int b = 0, sumb = 0; b < m; b++){
for (int c = 0, cura = suma, curb = sumb; c < m; c++){
to[a][b] = min(to[a][b], cura+ver[i][c]+curb);
if (c < a)
cura -= hor[i][c];
else
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... |