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;
typedef int ll;
ll n,m,a[2509][2509];
bool b;
long long ans;
long long count_rectangles(vector<vector<int> > v)
{
n=v.size();
m=v[0].size();
for(ll i=0; i<n; i++)
for(ll j=0; j<m; j++)
a[i][j]=v[i][j];
for(ll i=1; i<n-1; i++)
for(ll j=1; j<m-1; j++)
for(ll o=i; o<n-1; o++)
for(ll p=j; p<m-1; p++)
{
b=0;
for(ll r=i; r<=o; r++)
{
for(ll c=j; c<=p; c++)
if(a[r][c]>=min(min(a[i-1][c],a[o+1][c]),min(a[r][j-1],a[r][p+1])))
{
b=1;break;
}
if(b)
break;
}
if(b==0)
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... |