oj.uz

Submission #144080

# Submission time Handle Problem Language Result Execution time Memory
144080 2019-08-16T01:38:28 Z Lyestria Rectangles (IOI19_rect) C++14
10 / 100
 1659 ms 157976 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
const int mn=2510;
struct seg{
    int seg[mn*2];
    void up(int a,int b){
        seg[a+=mn]=b;
        for(a>>=1;a;a>>=1)seg[a]=min(seg[a<<1],seg[(a<<1)^1]);
    }
    int qu(int a,int b){
        int ans=0x3f3f3f3f;
        for(a+=mn,b+=mn;a<=b;a>>=1,b>>=1){
            if(a&1)ans=min(ans,seg[a++]);
            if(!(b&1))ans=min(ans,seg[b--]);
        }
        return ans;
    }
};
seg lef[mn],rig[mn],up[mn],dow[mn];
long long count_rectangles(std::vector<std::vector<int> > a) {
	int n=a.size(),m=a[0].size();
	int i,j;
	for(i=0;i<n;i++){
        stack<int>s;
        for(j=0;j<m;j++){
            while(s.size()&&a[i][s.top()]<=a[i][j])rig[s.top()].up(i,j),s.pop();
            s.push(j);
        }
        while(s.size())rig[s.top()].up(i,j),s.pop();
        for(j=m-1;j>=0;j--){
            while(s.size()&&a[i][s.top()]<=a[i][j])lef[s.top()].up(i,-j),s.pop();
            s.push(j);
        }
        while(s.size())lef[s.top()].up(i,-j),s.pop();
	}
	for(i=0;i<m;i++){
        stack<int>s;
        for(j=0;j<n;j++){
            while(s.size()&&a[s.top()][i]<=a[j][i])dow[s.top()].up(i,j),s.pop();
            s.push(j);
        }
        while(s.size())dow[s.top()].up(i,j),s.pop();
        for(j=n-1;j>=0;j--){
            while(s.size()&&a[s.top()][i]<=a[j][i])up[s.top()].up(i,-j),s.pop();
            s.push(j);
        }
        while(s.size())up[s.top()].up(i,-j),s.pop();
	}
	int ans=0;
	for(i=1;i<n-1;i++){
        for(j=1;j<m-1;j++){
            int d,u,l,r;
            d=dow[i].qu(j,j);
            u=-up[i].qu(j,j);
            l=-lef[j].qu(i,i);
            r=rig[j].qu(i,i);
            if(l==-1||u==-1||r==m||d==n)continue;
            if(rig[l].qu(u+1,d-1)<r)continue;
            if(-lef[r].qu(u+1,d-1)>l)continue;
            if(dow[u].qu(l+1,r-1)<d)continue;
            if(-up[d].qu(l+1,r-1)>u)continue;
            ans++;
        }
	}
	return ans;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct
6 Incorrect 3 ms 1912 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct
6 Incorrect 3 ms 1912 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct
6 Incorrect 3 ms 1912 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct
6 Incorrect 3 ms 1912 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 65272 KB Output is correct
2 Correct 45 ms 55524 KB Output is correct
3 Correct 53 ms 65272 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 54 ms 65400 KB Output is correct
6 Correct 54 ms 65244 KB Output is correct
7 Correct 53 ms 65272 KB Output is correct
8 Correct 53 ms 65244 KB Output is correct
9 Correct 54 ms 65272 KB Output is correct
10 Correct 50 ms 65016 KB Output is correct
11 Correct 53 ms 65144 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 888 KB Output is correct
2 Incorrect 1659 ms 157976 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct
6 Incorrect 3 ms 1912 KB Output isn't correct
7 Halted 0 ms 0 KB -