Submission #827767

#	Time	Username	Problem	Language	Result	Execution time	Memory
827767		Baytoro	Rectangles (IOI19_rect)	C++17	10 / 100	5031 ms	40504 KiB

rect

#include "rect.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
const int N=2505;
int a[N][N],b[N],c[N];
long long count_rectangles(vector<vector<int>> A) {
	int n=A.size();
	int m=A[0].size();
	if(min(n,m)<3) return 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++)
			a[i+1][j+1]=A[i][j];
	}
	int ans=0;
	for(int l=2;l<n;l++){
		for(int r=l;r<n;r++){
			for(int i=1;i<=m;i++){
				if(l==r) b[i]=a[l][i];
				else b[i]=max(b[i],a[r][i]);
			}
			for(int i=2;i<m;i++){
				for(int j=i;j<m;j++){
					if(b[j]>=min(a[l-1][j],a[r+1][j])) break;
					ans++;
					for(int k=l;k<=r;k++){
						if(i==j) c[k]=a[k][j];
						else c[k]=max(c[k],a[k][j]);
						if(c[k]>=min(a[k][i-1],a[k][j+1])){
							ans--;
							break;
						}
					}
				}
			}
		}
	}
	return ans;
	return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 10 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28