# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1065107 | aaaaaarroz | 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;
typedef long long ll;
bool limites(int n, int m, int x, int y){
return x>=0&&x<n&&y>=0&&y<m;
}
ll count_rectangles(const vector<vector<int>>a) {
ll rect=0;
int n = a.size();
int m = a[0].size();
vector<vector<bool>>v(n,vector<bool>(m));
vector<int>dx={0,-1,0,1};
vector<int>dy={1,0,-1,0};
for(int i=1;i<n-1;i++){
for(int j=1;j<m-1;j++){
if(!visited[i][j]&&a[i][j]==0){
v[i][j]=true;
queue<pair<int,int>>cola;
cola.push({i,j});
int l_x=INT_MAX,r_x=0,l_y=INT_MAX,r_y=0;
int cnt=1;
while(!cola.empty()){
pair<int,int>nodo=cola.front();
cola.pop();
l_x=min(l_x,nodo.first);
r_x=max(r_x,nodo.first);
l_y=min(l_y,nodo.second);
r_y=max(r_y,nodo.second);
for(int i=0;i<4;i++){
int x=nodo.first+dx[i],y=nodo.second+dy[i];