Submission #891476

#TimeUsernameProblemLanguageResultExecution timeMemory
891476Muhammad_AneeqRectangles (IOI19_rect)C++17
25 / 100
5062 ms136400 KiB
#include <vector> #include <iostream> using namespace std; int const N=2600; bool z1=0; struct segt { vector<int>a; int seg[4*N]; segt(vector<int>&s) { a=s; build(1,0,a.size()-1); } void build(int i,int st,int en) { if (st==en) { seg[i]=a[st]; return; } int mid=(st+en)/2; build(i*2,st,mid);build(i*2+1,mid+1,en); seg[i]=max(seg[i*2],seg[i*2+1]); } int get(int i,int l,int r,int st,int en) { if (st>=l&&en<=r) return seg[i]; if (st>r||en<l) return 0; int mid=(st+en)/2; return max(get(i*2,l,r,st,mid),get(i*2+1,l,r,mid+1,en)); } }; segt* St[2][N]={NULL}; long long count_rectangles(vector<vector<int>>a) { int n=a.size(),m=a[0].size(); for (int i=0;i<n;i++) St[0][i]=new segt(a[i]); for (int i=0;i<m;i++) { vector<int>z; for (int j=0;j<n;j++) z.push_back(a[j][i]); z1=(i==3); St[1][i]=new segt(z); } long long ans=0; for (int i=1;i<n-1;i++) { for (int j=1;j<m-1;j++) { for (int k=i;k<n-1;k++) { for (int l=j;l<m-1;l++) { bool w=0; bool z=0; if (i==4&&j==3&&k==4&&l==3) { z=1; } for (int o=i;o<=k&&!w;o++) { int f=St[0][o]->get(1,j,l,0,m-1); if (f>=a[o][j-1]||f>=a[o][l+1]) w=1; } for (int o=j;o<=l&&!w;o++) { int f=St[1][o]->get(1,i,k,0,n-1); if (f>=a[i-1][o]||f>=a[k+1][o]) w=1; } ans+=(!w); } } } } return ans; }

Compilation message (stderr)

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:60:11: warning: variable 'z' set but not used [-Wunused-but-set-variable]
   60 |      bool z=0;
      |           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...