# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159746 | PeppaPig | Wombats (IOI13_wombats) | C++14 | 5866 ms | 199092 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 N = 5e3+5;
const int M = 205;
int n, m;
int H[N][M], V[N][M], opt[M][M];
struct item {
int dp[M][M];
item() {}
int* operator[](int x) { return dp[x]; }
const int* operator[](int x) const { return dp[x]; };
friend item operator+(const item &a, const item &b) {
item ret;
fill_n(ret.dp[0], M*M, INT_MAX);
for(int i = 0; i < m; i++) for(int j = 0; j < m; j++) if(ret[0][i] > a[0][j] + b[j][i]) {
ret[0][i] = a[0][j] + b[j][i];
opt[0][i] = j;
}
//Paths don't cross, or else you can replace both paths with the minimum one
//opt[i-1][j] <= opt[i][j] <= opt[i][j+1];
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... |