# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
227180 | urd05 | Wombats (IOI13_wombats) | C++14 | 20035 ms | 24364 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;
struct Node {
int arr[200][200];
};
int r,c;
const int bs=121;
int opt[200][200];
inline Node merge(const Node& l,const Node& r) {
Node ret;
for(int diff=-c+1;diff<=c-1;diff++) {
for(int i=max(-diff,0);i<min(c-diff,c);i++) {
int j=i+diff;
int mini=2e9;
for(int k=(j==0?0:opt[i][j-1]);k<=(i==c-1?c-1:opt[i+1][j]);k++) {
if (l.arr[i][k]+r.arr[k][j]<mini) {
opt[i][j]=k;
mini=l.arr[i][k]+r.arr[k][j];
}
}
ret.arr[i][j]=mini;
}
}
return ret;
}
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... |