Submission #427618

#	Time	Username	Problem	Language	Result	Execution time	Memory
427618		Ahmadsm2005	Rectangles (IOI19_rect)	C++14	37 / 100	5061 ms	427580 KiB

rect

#include "rect.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
vector<vector<pair<int,int>>>RE(701);
int n,m;
vector<vector<int>>A;
bool check(int x1,int x2,int y1,int y2){
for(int i=x1;i<=x2;i++){
for(int l=y1;l<=y2;l++){
if((A[x1-1][l]<=A[i][l])||(A[x2+1][l]<=A[i][l])||(A[i][y1-1]<=A[i][l])||(A[i][y2+1]<=A[i][l]))
return 0;
}
}
return 1;
}
bool check2(int x1,int x2,int y1,int y2){
for(int i=x1;i<=x2;i++){
for(int l=y1;l<=y2;l++){
if((A[i][y1-1]<=A[i][l])||(A[i][y2+1]<=A[i][l]))
return 0;
}
}
return 1;
}
long long count_rectangles(vector<vector<int>>a){
A=a;
n=a.size(),m=a[0].size();
for(int i=1;i<n-1;i++){
for(int l=1;l<m-1;l++){
for(int x=l;x<m-1;x++){
if(check2(i,i,l,x)){
RE[i].push_back({l,x});
}
}
}
}
long long CNT=0;
set<pair<pair<int,int>,pair<int,int>>>lol;
for(int i=1;i<n-1;i++){
for(int l=1;l<n-1;l++){
for(int x=0;x<RE[i].size();x++){
if(lol.find({{min(i,l),max(l,i)},{RE[i][x].first,RE[i][x].second}})==lol.end())
lol.insert({{min(i,l),max(l,i)},{RE[i][x].first,RE[i][x].second}});
else
continue;
if(check(min(i,l),max(l,i),RE[i][x].first,RE[i][x].second)){
CNT++;
}
}
}
}
return CNT;
}

Compilation message (stderr)

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:42:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 | for(int x=0;x<RE[i].size();x++){
      |             ~^~~~~~~~~~~~~

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