# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154444 | Dormi | Rectangles (IOI19_rect) | C++14 | 4539 ms | 736340 KiB |
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 pair<int,int> pii;
const int MAXN=2500;
int bit[MAXN+1];
int n,m;
vector<pii> rowranges[MAXN][MAXN];
vector<pii> colranges[MAXN][MAXN];
int preloc[MAXN];
int sufloc[MAXN];
pii deq[MAXN];
inline void update(int loc, int val){
for(;loc<=n;loc+=loc&-loc)bit[loc]+=val;
}
inline int sum(int loc){
int ans=0;
for(;loc>0;loc-=loc&-loc)ans+=bit[loc];
return ans;
}
long long count_rectangles(std::vector<std::vector<int>> a){
n=a.size();
m=a[0].size();
for(int i=0;i<n;i++){
int l=0,r=-1;
for(int j=m-1;j>=0;j--){
while(r>=l&&deq[r].second<=a[i][j])r--;
if(r>=l)sufloc[j]=deq[r].first;
else sufloc[j]=-1;
deq[++r]={j,a[i][j]};
}
Compilation message (stderr)
# | 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... |