#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=2500+100;
int all[maxn][maxn],vis[maxn][maxn],tp[maxn][maxn],n,m,dpp[maxn][maxn],dpd[maxn][maxn];
vector<int>alll[maxn][maxn],alld[maxn][maxn];
vector<pair<int,pair<int,int>>>allq[maxn][maxn];
vector<pair<int,int>>addy[maxn][maxn];
long long mainres=0;
struct fenwick{
int fn[maxn];
vector<int>allind;
void clear(){
for(auto x:allind){
while(x<maxn){
fn[x]=0;
x+=((-x)&x);
}
}
allind.clear();
}
void add(int i,int w){
i++;
allind.push_back(i);
while(i<maxn){
fn[i]+=w;
i+=((-i)&i);
}
}
int pors(int l,int r){
int ret=0;
r++;
while(l>0){
ret-=fn[l];
l-=((-l)&l);
}
while(r>0){
ret+=fn[r];
r-=((-r)&r);
}
return ret;
}
}fen;
void pre(){
for(int i=1;i<=n;i++){
vector<pair<int,int>>allv;
for(int j=1;j<=m;j++){
while((int)allv.size()>0&&allv.back().first<all[i][j]){
alll[i][j].push_back(allv.back().second);
allv.pop_back();
}
if((int)allv.size()>0){
alll[i][j].push_back(allv.back().second);
}
if((int)allv.size()>0&&allv.back().first==all[i][j]){
allv.pop_back();
}
allv.push_back(make_pair(all[i][j],j));
}
}
for(int j=1;j<=m;j++){
vector<pair<int,int>>allv;
for(int i=n;i>=1;i--){
while((int)allv.size()>0&&allv.back().first<all[i][j]){
alld[i][j].push_back(allv.back().second);
allv.pop_back();
}
if((int)allv.size()>0){
alld[i][j].push_back(allv.back().second);
}
if((int)allv.size()>0&&allv.back().first==all[i][j]){
allv.pop_back();
}
allv.push_back(make_pair(all[i][j],i));
}
}
}
void solveq(){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
sort(addy[i][j].begin(),addy[i][j].end());
sort(allq[i][j].begin(),allq[i][j].end());
// cout<<i<<" "<<j<<" :"<<endl;
// for(auto x:addy[i][j]){
// cout<<x.first<<" "<<x.second<<endl;
// }
// for(auto x:allq[i][j]){
// cout<<x.first<<" "<<x.second.first<<" "<<x.second.second<<endl;
// }
while((int)addy[i][j].size()>0&&(int)allq[i][j].size()>0){
if(addy[i][j].back().first>=allq[i][j].back().first){
fen.add(addy[i][j].back().second,1);
addy[i][j].pop_back();
}else{
mainres+=fen.pors(allq[i][j].back().second.first,allq[i][j].back().second.second);
allq[i][j].pop_back();
}
}
while((int)allq[i][j].size()>0){
mainres+=fen.pors(allq[i][j].back().second.first,allq[i][j].back().second.second);
allq[i][j].pop_back();
}
fen.clear();
}
}
}
void calq(){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
for(auto x:alld[i][j]){
if(x<=i+1){
continue;
}
dpp[x][j]=dpp[x][j-1]+1;
allq[i+1][j+1].push_back(make_pair((x-i-1),make_pair(j-dpp[x][j],j-1)));
}
}
for(int j=1;j<=m;j++){
for(auto x:alld[i][j]){
if(x<=i+1){
continue;
}
dpp[x][j]=0;
}
}
}
for(int j=1;j<=m;j++){
for(int i=n;i>=1;i--){
for(auto x:alll[i][j]){
if(x+1>=j){
continue;
}
dpp[i][x]=dpp[i+1][x]+1;
addy[i][j].push_back(make_pair(dpp[i][x],x));
}
}
for(int i=n;i>=1;i--){
for(auto x:alll[i][j]){
if(x+1>=j){
continue;
}
dpp[i][x]=0;
}
}
}
}
void solve(){
pre();
calq();
solveq();
}
int count_rectangles(std::vector<std::vector<int> > a) {
n=a.size();
m=a[0].size();
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
all[i][j]=a[i-1][j-1];
}
}
solve();
return mainres;
}
Compilation message
rect.cpp:158:5: error: ambiguating new declaration of 'int count_rectangles(std::vector<std::vector<int> >)'
158 | int count_rectangles(std::vector<std::vector<int> > a) {
| ^~~~~~~~~~~~~~~~
In file included from rect.cpp:1:
rect.h:7:11: note: old declaration 'long long int count_rectangles(std::vector<std::vector<int> >)'
7 | long long count_rectangles(std::vector<std::vector<int> > a);
| ^~~~~~~~~~~~~~~~
