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"
#include <bits/stdc++.h>
using namespace std;
long long count_rectangles(vector<vector<int> > a) {
int n = a.size(), m = a[0].size();
int ans = 0;
for(int r1=1; r1<n-1; ++r1) {
for(int c1=1; c1<m-1; ++c1) {
for(int c2=c1; c2<m-1; ++c2) {
vector<int>mx(m, 0);
for(int r2=r1; r2<n-1; ++r2) {
bool ok = true;
bool dis = true;
for(int j=c1; j<=c2; ++j) {
ok &= a[r2][j]<min({a[r1-1][j], a[r2][c1-1], a[r2][c2+1]});
mx[j] = max(mx[j], a[r2][j]);
dis &= mx[j]<a[r2+1][j];
}
if(!ok) break;
if(dis) ++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... |