# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080374 | speedcode | 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 <bits/stdc++.h>
using namespace std;
long long count_rectangles(std::vector<std::vector<int>> a)
{
if(n < 3 || m < 3) return 0;
int n = a.size();
int m = a[0].size();
int valid[m];
for(int i = 0; i < m; i++)
valid[i] = a[0][i] > a[1][i] && a[2][i] > a[1][i];
long long res = 0;
for(int start = 1; start < m-1; start++){
int ma = a[1][start];
int end = start;
while(end < m-1){
if(a[1][start-1] <= ma) break;
if(a[1][end+1] <= ma) {
end++;
ma = max(ma, a[1][end]);
continue;
}
if(!valid[end]) break;
cout << start << ' ' << end << endl;
res++;
end++;
ma = max(ma, a[1][end]);
}
}
return res;
}