(UPD: 2024-12-04 14:48 UTC) Judge is not working due to Cloudflare incident. (URL) We can do nothing about it, sorry. After the incident is resolved, we will grade all submissions.

제출 #286942

#제출 시각아이디문제언어결과실행 시간메모리
286942mraron삶의 질 (IOI10_quality)C++14
100 / 100
4486 ms140480 KiB
#include "quality.h" #include<bits/stdc++.h> using namespace std; int rectangle(int R, int C, int H, int W, int Q[3001][3001]) { int can=R*C; vector<vector<int>> t(R, vector<int>(C)); for(int i=25;i>=0;i--) { int akt=can-(1<<i); if(akt>=1) { for(int i=0;i<R;++i) { for(int j=0;j<C;++j) { if(akt==Q[i][j]) t[i][j]=0; else if(akt<Q[i][j]) t[i][j]=1; else if(akt>Q[i][j]) t[i][j]=-1; } } for(int i=0;i<R;++i) { for(int j=0;j<C;++j) { if(i) t[i][j]+=t[i-1][j]; if(j) t[i][j]+=t[i][j-1]; if(i&&j) t[i][j]-=t[i-1][j-1]; } } bool ok=false; for(int i=0;!ok&&i+H-1<R;++i) { for(int j=0;!ok&&j+W-1<C;++j) { int sum=t[i+H-1][j+W-1]; if(i) sum-=t[i-1][j+W-1]; if(j) sum-=t[i+H-1][j-1]; if(i&&j) sum+=t[i-1][j-1]; if(sum<=0) ok=true; } } if(ok) can=akt; } } return can; }
#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...