oj.uz

Submission #525986

# Submission time Handle Problem Language Result Execution time Memory
525986 2022-02-13T12:10:12 Z tkwiatkowski Quality Of Living (IOI10_quality) C++17
100 / 100
 2054 ms 115292 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, 0));
	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);
		printf("\n");
	}
	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) / 2;
		if (check(mid, R, C, H, W, Q))
			hi = mid;
		else
			lo = mid + 1;
	}
	return lo;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 824 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 824 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 16 ms 2684 KB Output is correct
8 Correct 15 ms 2636 KB Output is correct
9 Correct 15 ms 2552 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 824 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 16 ms 2684 KB Output is correct
8 Correct 15 ms 2636 KB Output is correct
9 Correct 15 ms 2552 KB Output is correct
10 Correct 188 ms 18932 KB Output is correct
11 Correct 181 ms 18884 KB Output is correct
12 Correct 91 ms 11588 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 824 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 16 ms 2684 KB Output is correct
8 Correct 15 ms 2636 KB Output is correct
9 Correct 15 ms 2552 KB Output is correct
10 Correct 188 ms 18932 KB Output is correct
11 Correct 181 ms 18884 KB Output is correct
12 Correct 91 ms 11588 KB Output is correct
13 Correct 2054 ms 115244 KB Output is correct
14 Correct 2053 ms 115292 KB Output is correct
15 Correct 1816 ms 107096 KB Output is correct