#include "rect.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<int(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
struct BIT{
vector<int>bit;
BIT(int n){
bit=vector<int>(n+10);
}
void add(int k,int x){
k++;
while(k<bit.size()){
bit[k]+=x;
k+=k&-k;
}
}
int sum(int k){
k++;
int res=0;
while(k){
res+=bit[k];
k-=k&-k;
}
return res;
}
};
struct st{
int a,b,c;
};
struct Segtree{
int N;
vector<int>dat;
function<int(int,int)>f;
int I;
Segtree(){}
Segtree(int n,int ini,function<int(int,int)>f):f(f),I(ini){
N=1;while(N<n)N<<=1;
dat=vector<int>(2*N,ini);
}
void update(int k,int x){
k+=N;dat[k]=x;
while(k>1){
k>>=1;
dat[k]=f(dat[k*2],dat[k*2+1]);
}
}
int query(int l,int r){ // [l,r]
r++;
int res=I;
for(l+=N,r+=N;l<r;l>>=1,r>>=1){
if(l&1)res=f(res,dat[l++]);
if(r&1)res=f(res,dat[--r]);
}
return res;
}
};
static int r[3000][3000],l[3000][3000];
Segtree L[3000],R[3000],M[3000];
long long count_rectangles(std::vector<std::vector<int>> a) {
int n=a.size(),m=a[0].size();
rep(i,n){
stack<P>sa;
for(int j=m-1;j>=0;j--){
while(!sa.empty()&&sa.top().first<a[i][j])sa.pop();
r[i][j]=(sa.empty()?m:sa.top().second)-1;
sa.push(P(a[i][j],j));
}
while(!sa.empty())sa.pop();
rep(j,m){
while(!sa.empty()&&sa.top().first<a[i][j])sa.pop();
l[i][j]=(sa.empty()?-1:sa.top().second)+1;
sa.push(P(a[i][j],j));
}
}
rep(i,m){
R[i]=Segtree(n,m-1,[](int a,int b){return min(a,b);});
L[i]=Segtree(n,0,[](int a,int b){return max(a,b);});
M[i]=Segtree(n,0,[](int a,int b){return max(a,b);});
}
rep(i,m){
rep(j,n){
R[i].update(j,r[j][i]);
L[i].update(j,l[j][i]);
M[i].update(j,a[j][i]);
}
}
ll ans=0;
for(int sx=0;sx<n;sx++){
for(int gx=sx+2;gx<n;gx++){
BIT bit(m);
vector<st>v;
int K=0;
rep(j,m){
int end=max(L[j].query(sx+1,gx-1)-1,K);
if(end<=j-2){
v.push_back({j-2,j,1});
v.push_back({end-1,j,-1});
}
if(M[j].query(sx+1,gx-1)>=min(a[sx][j],a[gx][j])){
K=j;
}
}
sort(v.begin(),v.end(),[](st a,st b){return a.a>b.a;});
int s=0;
for(int j=m-1;j>=0;j--){
while(s<v.size()&&v[s].a>=j){
bit.add(v[s].b,v[s].c);
s++;
}
ans+=bit.sum(R[j].query(sx+1,gx-1)+1);
}
}
}
return ans;
}
Compilation message
rect.cpp: In member function 'void BIT::add(int, int)':
rect.cpp:17:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
17 | while(k<bit.size()){
| ~^~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:122:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<st>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
122 | while(s<v.size()&&v[s].a>=j){
| ~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1004 KB |
Output is correct |
2 |
Correct |
2 ms |
1260 KB |
Output is correct |
3 |
Correct |
2 ms |
1260 KB |
Output is correct |
4 |
Correct |
2 ms |
1260 KB |
Output is correct |
5 |
Correct |
2 ms |
1260 KB |
Output is correct |
6 |
Correct |
2 ms |
1260 KB |
Output is correct |
7 |
Correct |
2 ms |
1260 KB |
Output is correct |
8 |
Correct |
1 ms |
1132 KB |
Output is correct |
9 |
Correct |
2 ms |
1260 KB |
Output is correct |
10 |
Correct |
2 ms |
1260 KB |
Output is correct |
11 |
Correct |
2 ms |
1260 KB |
Output is correct |
12 |
Correct |
2 ms |
1260 KB |
Output is correct |
13 |
Correct |
1 ms |
1004 KB |
Output is correct |
14 |
Correct |
1 ms |
1004 KB |
Output is correct |
15 |
Correct |
1 ms |
1004 KB |
Output is correct |
16 |
Correct |
1 ms |
1004 KB |
Output is correct |
17 |
Correct |
1 ms |
1004 KB |
Output is correct |
18 |
Correct |
1 ms |
1004 KB |
Output is correct |
19 |
Correct |
2 ms |
1260 KB |
Output is correct |
20 |
Correct |
2 ms |
1260 KB |
Output is correct |
21 |
Correct |
1 ms |
1004 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1004 KB |
Output is correct |
2 |
Correct |
2 ms |
1260 KB |
Output is correct |
3 |
Correct |
2 ms |
1260 KB |
Output is correct |
4 |
Correct |
2 ms |
1260 KB |
Output is correct |
5 |
Correct |
2 ms |
1260 KB |
Output is correct |
6 |
Correct |
2 ms |
1260 KB |
Output is correct |
7 |
Correct |
2 ms |
1260 KB |
Output is correct |
8 |
Correct |
1 ms |
1132 KB |
Output is correct |
9 |
Correct |
2 ms |
1260 KB |
Output is correct |
10 |
Correct |
2 ms |
1260 KB |
Output is correct |
11 |
Correct |
2 ms |
1260 KB |
Output is correct |
12 |
Correct |
2 ms |
1260 KB |
Output is correct |
13 |
Correct |
1 ms |
1004 KB |
Output is correct |
14 |
Correct |
1 ms |
1004 KB |
Output is correct |
15 |
Correct |
1 ms |
1004 KB |
Output is correct |
16 |
Correct |
1 ms |
1004 KB |
Output is correct |
17 |
Correct |
1 ms |
1004 KB |
Output is correct |
18 |
Correct |
1 ms |
1004 KB |
Output is correct |
19 |
Correct |
2 ms |
1260 KB |
Output is correct |
20 |
Correct |
2 ms |
1260 KB |
Output is correct |
21 |
Correct |
1 ms |
1004 KB |
Output is correct |
22 |
Correct |
20 ms |
1900 KB |
Output is correct |
23 |
Correct |
21 ms |
2028 KB |
Output is correct |
24 |
Correct |
21 ms |
2028 KB |
Output is correct |
25 |
Correct |
23 ms |
1900 KB |
Output is correct |
26 |
Correct |
23 ms |
1900 KB |
Output is correct |
27 |
Correct |
24 ms |
2028 KB |
Output is correct |
28 |
Correct |
23 ms |
1900 KB |
Output is correct |
29 |
Correct |
13 ms |
1772 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1004 KB |
Output is correct |
2 |
Correct |
2 ms |
1260 KB |
Output is correct |
3 |
Correct |
2 ms |
1260 KB |
Output is correct |
4 |
Correct |
2 ms |
1260 KB |
Output is correct |
5 |
Correct |
2 ms |
1260 KB |
Output is correct |
6 |
Correct |
2 ms |
1260 KB |
Output is correct |
7 |
Correct |
2 ms |
1260 KB |
Output is correct |
8 |
Correct |
1 ms |
1132 KB |
Output is correct |
9 |
Correct |
2 ms |
1260 KB |
Output is correct |
10 |
Correct |
2 ms |
1260 KB |
Output is correct |
11 |
Correct |
2 ms |
1260 KB |
Output is correct |
12 |
Correct |
2 ms |
1260 KB |
Output is correct |
13 |
Correct |
1 ms |
1004 KB |
Output is correct |
14 |
Correct |
1 ms |
1004 KB |
Output is correct |
15 |
Correct |
1 ms |
1004 KB |
Output is correct |
16 |
Correct |
1 ms |
1004 KB |
Output is correct |
17 |
Correct |
20 ms |
1900 KB |
Output is correct |
18 |
Correct |
21 ms |
2028 KB |
Output is correct |
19 |
Correct |
21 ms |
2028 KB |
Output is correct |
20 |
Correct |
23 ms |
1900 KB |
Output is correct |
21 |
Correct |
23 ms |
1900 KB |
Output is correct |
22 |
Correct |
24 ms |
2028 KB |
Output is correct |
23 |
Correct |
23 ms |
1900 KB |
Output is correct |
24 |
Correct |
13 ms |
1772 KB |
Output is correct |
25 |
Correct |
1 ms |
1004 KB |
Output is correct |
26 |
Correct |
1 ms |
1004 KB |
Output is correct |
27 |
Correct |
2 ms |
1260 KB |
Output is correct |
28 |
Correct |
2 ms |
1260 KB |
Output is correct |
29 |
Correct |
1 ms |
1004 KB |
Output is correct |
30 |
Correct |
440 ms |
4716 KB |
Output is correct |
31 |
Correct |
426 ms |
4688 KB |
Output is correct |
32 |
Correct |
441 ms |
4844 KB |
Output is correct |
33 |
Correct |
463 ms |
4592 KB |
Output is correct |
34 |
Correct |
469 ms |
4588 KB |
Output is correct |
35 |
Correct |
466 ms |
4844 KB |
Output is correct |
36 |
Correct |
494 ms |
4844 KB |
Output is correct |
37 |
Correct |
472 ms |
4844 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1004 KB |
Output is correct |
2 |
Correct |
2 ms |
1260 KB |
Output is correct |
3 |
Correct |
2 ms |
1260 KB |
Output is correct |
4 |
Correct |
2 ms |
1260 KB |
Output is correct |
5 |
Correct |
2 ms |
1260 KB |
Output is correct |
6 |
Correct |
2 ms |
1260 KB |
Output is correct |
7 |
Correct |
2 ms |
1260 KB |
Output is correct |
8 |
Correct |
1 ms |
1132 KB |
Output is correct |
9 |
Correct |
2 ms |
1260 KB |
Output is correct |
10 |
Correct |
2 ms |
1260 KB |
Output is correct |
11 |
Correct |
2 ms |
1260 KB |
Output is correct |
12 |
Correct |
2 ms |
1260 KB |
Output is correct |
13 |
Correct |
1 ms |
1004 KB |
Output is correct |
14 |
Correct |
1 ms |
1004 KB |
Output is correct |
15 |
Correct |
1 ms |
1004 KB |
Output is correct |
16 |
Correct |
1 ms |
1004 KB |
Output is correct |
17 |
Correct |
20 ms |
1900 KB |
Output is correct |
18 |
Correct |
21 ms |
2028 KB |
Output is correct |
19 |
Correct |
21 ms |
2028 KB |
Output is correct |
20 |
Correct |
23 ms |
1900 KB |
Output is correct |
21 |
Correct |
23 ms |
1900 KB |
Output is correct |
22 |
Correct |
24 ms |
2028 KB |
Output is correct |
23 |
Correct |
23 ms |
1900 KB |
Output is correct |
24 |
Correct |
13 ms |
1772 KB |
Output is correct |
25 |
Correct |
440 ms |
4716 KB |
Output is correct |
26 |
Correct |
426 ms |
4688 KB |
Output is correct |
27 |
Correct |
441 ms |
4844 KB |
Output is correct |
28 |
Correct |
463 ms |
4592 KB |
Output is correct |
29 |
Correct |
469 ms |
4588 KB |
Output is correct |
30 |
Correct |
466 ms |
4844 KB |
Output is correct |
31 |
Correct |
494 ms |
4844 KB |
Output is correct |
32 |
Correct |
472 ms |
4844 KB |
Output is correct |
33 |
Correct |
1 ms |
1004 KB |
Output is correct |
34 |
Correct |
1 ms |
1004 KB |
Output is correct |
35 |
Correct |
2 ms |
1260 KB |
Output is correct |
36 |
Correct |
2 ms |
1260 KB |
Output is correct |
37 |
Correct |
1 ms |
1004 KB |
Output is correct |
38 |
Execution timed out |
5038 ms |
31596 KB |
Time limit exceeded |
39 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1388 KB |
Output is correct |
2 |
Correct |
2 ms |
1388 KB |
Output is correct |
3 |
Correct |
2 ms |
1516 KB |
Output is correct |
4 |
Correct |
1 ms |
1004 KB |
Output is correct |
5 |
Correct |
3 ms |
1516 KB |
Output is correct |
6 |
Correct |
3 ms |
1516 KB |
Output is correct |
7 |
Correct |
4 ms |
1772 KB |
Output is correct |
8 |
Correct |
3 ms |
1516 KB |
Output is correct |
9 |
Correct |
3 ms |
1516 KB |
Output is correct |
10 |
Correct |
2 ms |
1260 KB |
Output is correct |
11 |
Correct |
2 ms |
1260 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1004 KB |
Output is correct |
2 |
Correct |
1 ms |
1004 KB |
Output is correct |
3 |
Correct |
2 ms |
1260 KB |
Output is correct |
4 |
Correct |
2 ms |
1260 KB |
Output is correct |
5 |
Correct |
1 ms |
1004 KB |
Output is correct |
6 |
Correct |
1 ms |
1004 KB |
Output is correct |
7 |
Execution timed out |
5110 ms |
164204 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1004 KB |
Output is correct |
2 |
Correct |
2 ms |
1260 KB |
Output is correct |
3 |
Correct |
2 ms |
1260 KB |
Output is correct |
4 |
Correct |
2 ms |
1260 KB |
Output is correct |
5 |
Correct |
2 ms |
1260 KB |
Output is correct |
6 |
Correct |
2 ms |
1260 KB |
Output is correct |
7 |
Correct |
2 ms |
1260 KB |
Output is correct |
8 |
Correct |
1 ms |
1132 KB |
Output is correct |
9 |
Correct |
2 ms |
1260 KB |
Output is correct |
10 |
Correct |
2 ms |
1260 KB |
Output is correct |
11 |
Correct |
2 ms |
1260 KB |
Output is correct |
12 |
Correct |
2 ms |
1260 KB |
Output is correct |
13 |
Correct |
1 ms |
1004 KB |
Output is correct |
14 |
Correct |
1 ms |
1004 KB |
Output is correct |
15 |
Correct |
1 ms |
1004 KB |
Output is correct |
16 |
Correct |
1 ms |
1004 KB |
Output is correct |
17 |
Correct |
20 ms |
1900 KB |
Output is correct |
18 |
Correct |
21 ms |
2028 KB |
Output is correct |
19 |
Correct |
21 ms |
2028 KB |
Output is correct |
20 |
Correct |
23 ms |
1900 KB |
Output is correct |
21 |
Correct |
23 ms |
1900 KB |
Output is correct |
22 |
Correct |
24 ms |
2028 KB |
Output is correct |
23 |
Correct |
23 ms |
1900 KB |
Output is correct |
24 |
Correct |
13 ms |
1772 KB |
Output is correct |
25 |
Correct |
440 ms |
4716 KB |
Output is correct |
26 |
Correct |
426 ms |
4688 KB |
Output is correct |
27 |
Correct |
441 ms |
4844 KB |
Output is correct |
28 |
Correct |
463 ms |
4592 KB |
Output is correct |
29 |
Correct |
469 ms |
4588 KB |
Output is correct |
30 |
Correct |
466 ms |
4844 KB |
Output is correct |
31 |
Correct |
494 ms |
4844 KB |
Output is correct |
32 |
Correct |
472 ms |
4844 KB |
Output is correct |
33 |
Execution timed out |
5038 ms |
31596 KB |
Time limit exceeded |
34 |
Halted |
0 ms |
0 KB |
- |