oj.uz

Submission #887405

# Submission time Handle Problem Language Result Execution time Memory
887405 2023-12-14T12:25:53 Z Faisal_Saqib Quality Of Living (IOI10_quality) C++17
100 / 100
 1350 ms 180224 KB 
#include <iostream>
using namespace std;
int n,m,h,w,g[3100][3100],pre[3100][3100];
bool check(int& k)
{
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			pre[i][j]=((g[i][j]<=k)?1:-1)+pre[i-1][j]+pre[i][j-1]-pre[i-1][j-1];
	for(int i=1;(i+h-1)<=n;i++)
		for(int j=1;(j+w-1)<=m;j++)
			if((pre[i+h-1][j+w-1]-pre[i-1][j+w-1]-pre[i+h-1][j-1]+pre[i-1][j-1])>=0)
				return 1;
	return 0;
}
int rectangle(int n1, int m1, int h1, int w1, int g1[3001][3001])
{
	n=n1,m=m1,h=h1,w=w1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			g[i][j]=g1[i-1][j-1];
	int s=0,e=n*m;
	while(s+1<e)
	{
		int mid=(s+e)/2;
		if(check(mid))
			e=mid;
		else
			s=mid;
	}
	return e;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 6864 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 6864 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 13 ms 14684 KB Output is correct
8 Correct 13 ms 14684 KB Output is correct
9 Correct 12 ms 14680 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 6864 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 13 ms 14684 KB Output is correct
8 Correct 13 ms 14684 KB Output is correct
9 Correct 12 ms 14680 KB Output is correct
10 Correct 147 ms 45228 KB Output is correct
11 Correct 135 ms 45224 KB Output is correct
12 Correct 70 ms 39348 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 6864 KB Output is correct
5 Correct 2 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 13 ms 14684 KB Output is correct
8 Correct 13 ms 14684 KB Output is correct
9 Correct 12 ms 14680 KB Output is correct
10 Correct 147 ms 45228 KB Output is correct
11 Correct 135 ms 45224 KB Output is correct
12 Correct 70 ms 39348 KB Output is correct
13 Correct 1350 ms 180092 KB Output is correct
14 Correct 1307 ms 180224 KB Output is correct
15 Correct 1229 ms 172448 KB Output is correct