oj.uz

Submission #943471

# Submission time Handle Problem Language Result Execution time Memory
943471 2024-03-11T14:05:04 Z IBory Quality Of Living (IOI10_quality) C++17
0 / 100
 1 ms 4440 KB 
#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 = 0; i < R; ++i) for (int j = 0; j < C; ++j) {
		int n = S[i][j];
		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 = 0; i < R; ++i) for (int j = 1; j < C; ++j) S[i][j] += S[i][j - 1];
		for (int j = 0; j < C; ++j) for (int i = 1; i < R; ++i) S[i][j] += S[i - 1][j];

		int high = 0;
		for (int i = H - 1; i < R; ++i) for (int j = W - 1; j < C; ++j) {
			int s = S[i][j] - (i <= H ? S[i - H][j] : 0) - (j <= W ? S[i][j - W] : 0) + (i <= H && j <= W ? S[i - H][j - W] : 0);
			high = max(high, s);
		}

		((H * W + 1) / 2 <= high ? r : l) = mid;
	}

	return r;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -