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));
int mx_r = n-1;
int mx_c = m-1;
for (int r2 = r1; r2 < mx_r; ++r2) {
for (int c2 = c1; c2 < mx_c; ++c2) {
bool flag = true;
rmx[r2][c2] = max(rmx[r2][c2-1], a[r2][c2]);
cmx[c2][r2] = max(cmx[c2][r2-1], a[r2][c2]);
if (rmx[r2][c2] >= a[r2][c1-1]) mx_r = r2 , flag = false;
if (rmx[r2][c2] >= a[r2][c2+1]) flag = false;
if (cmx[c2][r2] >= a[r1-1][c2]) mx_c = c2, flag = false;
if (cmx[c2][r2] >= a[r2+1][c2]) flag = false;
if (flag) ans++;
}
}
}
}
return ans;
}
| # | 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... |