Submission #470299

#TimeUsernameProblemLanguageResultExecution timeMemory
470299Newtech66Quality Of Living (IOI10_quality)C++17
40 / 100
5029 ms3420 KiB
#include "quality.h" #include<vector> #include<iostream> using namespace std; bool solve(int R, int C, int H, int W, int Q[3001][3001],int mid) { vector<vector<int> > grid(R,vector<int>(C)); for(int i=0;i<R;i++) { for(int j=0;j<C;j++) { if(Q[i][j]<=mid) grid[i][j]=-1; else grid[i][j]=1; //cout<<grid[i][j]<<" "; } //cout<<endl; } for(int j=1;j<C;j++) { grid[0][j]+=grid[0][j-1]; } for(int i=1;i<R;i++) { grid[i][0]+=grid[i-1][0]; } for(int i=1;i<R;i++) { for(int j=1;j<C;j++) { grid[i][j]+=grid[i-1][j]+grid[i][j-1]-grid[i-1][j-1]; } } /*cout<<endl; for(int i=0;i<R;i++) { for(int j=0;j<C;j++) { cout<<grid[i][j]<<" "; } cout<<endl; } cout<<endl;*/ for(int i=H-1;i<R;i++) { for(int j=W-1;j<C;j++) { int chk=grid[i][j]; if(i>=H) chk-=grid[i-H][j]; if(j>=W) chk-=grid[i][j-W]; if(i>=H && j>=W) chk+=grid[i-H][j-W]; if(chk<0) return true; } } return false; } int rectangle(int R, int C, int H, int W, int Q[3001][3001]) { for(int i=1;i<=R*C;i++) { if(solve(R,C,H,W,Q,i)) { return i; } } }

Compilation message (stderr)

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^
#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...