# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102860 | wxh010910 | Wombats (IOI13_wombats) | C++17 | 24 ms | 17316 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;
const int B = 15;
const int inf = 0x3f3f3f3f;
vector<vector<vector<int>>> tree;
vector<vector<int>> ver, hor;
int n, m, q;
vector<vector<int>> brute(int l, int r) {
vector<vector<int>> ans;
r = min(r, n);
for (int i = 0; i < m; ++i) {
vector<int> dist(m, inf);
dist[i] = 0;
for (int j = l; j < r; ++j) {
for (int k = 0; k + 1 < m; ++k) {
dist[k + 1] = min(dist[k + 1], dist[k] + hor[j][k]);
}
for (int k = m - 1; k; --k) {
dist[k - 1] = min(dist[k - 1], dist[k] + hor[j][k - 1]);
}
for (int k = 0; k < m; ++k) {
dist[k] += ver[j][k];
}
}
ans.push_back(dist);
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... |