제출 #943470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
943470		IBory	삶의 질 (IOI10_quality)	C++17	0 / 100	17 ms	38236 KiB

quality

#include <bits/stdc++.h>
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 = MAX - 1; i > 0; --i) for (int j = MAX - 1; j > 0; --j) S[i][j] = S[i - 1][j - 1];

	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;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20