# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
943467 | 2024-03-11T13:59:58 Z | IBory | Quality Of Living (IOI10_quality) | C++17 | 0 ms | 0 KB |
using namespace std; const int MAX = 3001; int Y[MAX * MAX], X[MAX * MAX]; int rectangle(int R, int C, int H, int W, int S[MAX][MAX]) { for (int i = 1; i <= R; ++i) for (int j = 1; j <= C; ++j) { int n = S[i - 1][j - 1]; Y[n] = i, X[n] = j; } int l = 0, r = R * C + 1; while (l + 1 < r) { int mid = (l + r) >> 1; for (int i = 1; i <= mid; ++i) S[Y[i]][X[i]] = 1; for (int i = mid + 1; i <= R * C; ++i) S[Y[i]][X[i]] = 0; for (int i = 1; i <= R; ++i) for (int j = 1; j <= C; ++j) S[i][j] += S[i][j - 1]; for (int j = 1; j <= C; ++j) for (int i = 1; i <= R; ++i) S[i][j] += S[i - 1][j]; int high = 0; for (int i = H; i <= R; ++i) for (int j = W; j <= C; ++j) { int s = S[i][j] - S[i - H][j] - S[i][j - W] + S[i - H][j - W]; high = max(high, s); } ((H * W + 1) / 2 <= high ? r : l) = mid; } return R; }