oj.uz

Submission #201507

# Submission time Handle Problem Language Result Execution time Memory
201507 2020-02-10T20:35:37 Z luciocf Quality Of Living (IOI10_quality) C++14
100 / 100
 3695 ms 142200 KB 
#include <bits/stdc++.h>
#include "quality.h"

using namespace std;

const int maxn = 3010;

int n, m, h, w;

int a[maxn][maxn];

int aux[maxn][maxn];
int soma[maxn][maxn];

bool ok(int x)
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			if (a[i][j] > x) aux[i][j] = 1;
			else if (a[i][j] == x) aux[i][j] = 0;
			else aux[i][j] = -1;
		}
	}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			soma[i][j] = soma[i-1][j]+soma[i][j-1]+aux[i][j]-soma[i-1][j-1];

	for (int i = 1; i+h-1 <= n; i++)
		for (int j = 1; j+w-1 <= m; j++)
			if (soma[i+h-1][j+w-1]-soma[i+h-1][j-1]-soma[i-1][j+w-1]+soma[i-1][j-1] <= 0)
				return true;

	return false;
}

int rectangle(int N, int M, int H, int W, int A[3001][3001])
{
	n = N, m = M, h = H, w = W;

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			a[i][j] = A[i-1][j-1];


	int ini = 1, fim = n*m, ans = n*m;

	while (ini <= fim)
	{
		int mid = (ini+fim)>>1;

		if (ok(mid)) ans = mid, fim = mid-1;
		else ini = mid+1;
	}

	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 8 ms 2040 KB Output is correct
5 Correct 8 ms 2168 KB Output is correct
6 Correct 8 ms 2168 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 8 ms 2040 KB Output is correct
5 Correct 8 ms 2168 KB Output is correct
6 Correct 8 ms 2168 KB Output is correct
7 Correct 35 ms 7032 KB Output is correct
8 Correct 36 ms 7032 KB Output is correct
9 Correct 33 ms 6904 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 8 ms 2040 KB Output is correct
5 Correct 8 ms 2168 KB Output is correct
6 Correct 8 ms 2168 KB Output is correct
7 Correct 35 ms 7032 KB Output is correct
8 Correct 36 ms 7032 KB Output is correct
9 Correct 33 ms 6904 KB Output is correct
10 Correct 388 ms 33912 KB Output is correct
11 Correct 377 ms 34016 KB Output is correct
12 Correct 200 ms 26044 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 760 KB Output is correct
4 Correct 8 ms 2040 KB Output is correct
5 Correct 8 ms 2168 KB Output is correct
6 Correct 8 ms 2168 KB Output is correct
7 Correct 35 ms 7032 KB Output is correct
8 Correct 36 ms 7032 KB Output is correct
9 Correct 33 ms 6904 KB Output is correct
10 Correct 388 ms 33912 KB Output is correct
11 Correct 377 ms 34016 KB Output is correct
12 Correct 200 ms 26044 KB Output is correct
13 Correct 3625 ms 141944 KB Output is correct
14 Correct 3695 ms 142200 KB Output is correct
15 Correct 3283 ms 141928 KB Output is correct