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;
const int N=2505;
int n,m,a[5][N],mx[N][N],p[N];
long long count_rectangles(vector<vector<int>> v){
n=v.size();
m=v[0].size();
if (n<=2 || m<=2) return 0LL;
for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) a[i][j]=v[i-1][j-1];
for (int j=2;j<m;j++) p[j]=p[j-1]+bool(a[2][j]<a[1][j] && a[2][j]<a[3][j]);
for (int i=2;i<m;i++){
mx[i][i]=a[2][i];
for (int j=i+1;j<m;j++){
mx[i][j]=max(mx[i][j-1],a[2][j]);
}
}
long long ans=0;
for (int i=2;i<m;i++) for (int j=i;j<m;j++) ans+=bool(p[j]-p[i-1]==j-i+1 && mx[i][j]<a[2][i-1] && mx[i][j]<a[2][j+1]);
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... |