oj.uz

Submission #512667

# Submission time Handle Problem Language Result Execution time Memory
512667 2022-01-16T15:59:32 Z saral Quality Of Living (IOI10_quality) C++14
0 / 100
 0 ms 460 KB 
#include "quality.h"
const int N = 3010;
int pom[N][N];

bool check (int x, int n, int m, int h, int w, int a[3001][3001]) {
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			pom[i][j] = 0;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] <= x) pom[i][j] = 1;
			else pom[i][j] = 0;
			pom[i][j] = pom[i][j]+pom[i-1][j]+pom[i][j-1]-pom[i-1][j-1];
		}
	}
	/*for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout << pom[i][j] << " ";
		}
		cout << endl;
	}*/
	for (int i = h; i <= n; i++) {
		for (int j = w; j <= m; j++) {
			int val = pom[i][j]-pom[i-h][j]-pom[i][j-w]+pom[i-h][j-w];
			if (val >= (h*w+1)/2) return true;
		}
	}
	return false;
}
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	int lo = 1, hi = R*C, mid;

	while (lo < hi) {
		mid = (lo+hi)/2;
		if (check(mid, R, C, H, W, Q)) {
			hi = mid;
		}
		else {
			lo = mid+1;
		}
	}
	return lo;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

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