| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 396529 | blue | Rectangles (IOI19_rect) | C++17 | 0 ms | 0 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 "rect.h"
#include <vector>
using namespace std;
/*
For each (i, j)
T[i][j] = furthest row I such that T[I][j], T[I+1][j], ... T[i-1][j] all have height less than (i, j)
Similarly, D[i][j], R[i][j], L[i][j]
A rectangle (r1, r2, c1, c2) is good if(minD[r1-1][c1..c2] > r2) and so on
*/
long long count_rectangles(vector< vector<int> > a)
{
int n = a.size(), m = a[0].size();
long long res = 0;
for(int r1 = 1; r1 <= n-2; r1++)
{
for(int r2 = r1; r2 <= n-2; r2++)
{
for(int c1 = 1; c1 <= m-2; c1++)
{
if(a[i][c1] >= a[r1-1][c1] || a[i][c1] >= a[r2+1][c1])
break;
for(int c2 = c1; c2 <= m-2; c2++)
{
if(a[i][c2] >= a[r1-1][c2] || a[i][c2] >= a[r2+1][c2])
break;
bool flag = 1;
for(int i = r1; i <= r2; i++)
for(int j = c1; j <= c2; j++)
flag &= (a[i][j] < a[i][c1-1]) && (a[i][j] < a[i][c2+1]);
if(flag) res++;
}
}
}
}
return res;
}
