| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 398029 | snasibov05 | Rectangles (IOI19_rect) | C++14 | 5090 ms | 45180 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 "rect.h"
using namespace std;
long long count_rectangles(std::vector<std::vector<int> > a) {
int n = a.size();
int m = a[0].size();
long long ans = 0;
for (int r1 = 1; r1 < n-1; ++r1) {
for (int c1 = 1; c1 < m-1; ++c1) {
vector<vector<int>> rmx(n, vector<int>(m)), cmx(m, vector<int>(n));
for (int r2 = r1; r2 < n-1; ++r2) {
for (int c2 = c1; c2 < m-1; ++c2) {
bool flag = true;
for (int i = r1; i <= r2; ++i) {
rmx[i][c2] = max(rmx[i][c2-1], a[i][c2]);
if (rmx[i][c2] >= a[i][c1-1]) flag = false;
if (rmx[i][c2] >= a[i][c2+1]) flag = false;
}
for (int i = c1; i <= c2; ++i) {
cmx[i][r2] = max(cmx[i][r2-1], a[r2][i]);
if (cmx[i][r2] >= a[r1-1][i]) flag = false;
if (cmx[i][r2] >= a[r2+1][i]) flag = false;
}
if (flag) ans++;
}
}
int x = 1;
}
}
return ans;
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
