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>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
ll count_rectangles(vector<vector<int> > a) {
int n = a.size(); int m = a[0].size();
ll cmax = 0;
for (int i1 = 1; i1 < n-1; i1++)
{
for (int j1 = 1; j1 < m-1; j1++)
{
for (int i2 = i1; i2 < n-1; i2++)
{
for (int j2 = j1; j2 < m-1; j2++)
{
bool isval = 1;
for (int x = i1; x <= i2; x++)
{
for (int y = j1; y <= j2; y++)
{
if (a[x][y] >= a[i1-1][y] || a[x][y] >= a[i2+1][y] || a[x][y] >= a[x][j1-1] || a[x][y] >= a[x][j2+1]) {
isval = 0;
break;
}
}
if (!isval) break;
}
cmax += isval;
}
}
}
}
return cmax;
}
# | 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... |