oj.uz

Submission #525979

# Submission time Handle Problem Language Result Execution time Memory
525979 2022-02-13T11:55:32 Z tkwiatkowski Quality Of Living (IOI10_quality) C++17
0 / 100
 1 ms 336 KB 
/*
	Zadanie: 
	Autor: Tomasz Kwiatkowski
*/

#include <bits/stdc++.h>
#include "quality.h"
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 1e6 + 7;
const int INF = 1e9 + 7;

bool check(int m, int R, int C, int H, int W, int Q[][3001])
{
	vector<vector<int>> pref(R + 1, vector<int>(C + 1));
	for (int i = 1; i <= R; ++i)
		for (int j = 1; j <= C; ++j)
			pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + (Q[i - 1][j - 1] >= m);
	for (int i = 1; i <= R-H+1; ++i)
		for (int j = 1; j <= C-W+1; ++j)
			if (2*(pref[i + H - 1][j + W - 1] - pref[i - 1][j + W - 1] - pref[i + H - 1][j - 1] + pref[i - 1][j - 1]) >= H*W)
				return true;
	return false;
}

int rectangle(int R, int C, int H, int W, int Q[][3001])
{
	int lo = 1, hi = R*C;
	while (lo < hi) {
		int mid = (lo + hi + 1) / 2;
		if (check(mid, R, C, H, W, Q))
			lo = mid;
		else
			hi = mid - 1;
	}
	return lo;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 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 336 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 336 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 336 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 336 KB Output isn't correct
2 Halted 0 ms 0 KB -