oj.uz

Submission #288009

# Submission time Handle Problem Language Result Execution time Memory
288009 2020-09-01T07:50:07 Z dolijan Quality Of Living (IOI10_quality) C++14
40 / 100
 5000 ms 3044 KB 
#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
const int mn=3001;
int rectangle1(int r,int c,int h,int w,int q[mn][mn])
{
	int mn=r*c;
	for(int i=0;i<=r-h;i++)
	{
		for(int j=0;j<=c-w;j++)
		{
			vector<int> v;
			for(int aa=i;aa<i+h;aa++)
			{
				for(int bb=j;bb<j+w;bb++)
				{
					v.pb(q[aa][bb]);
				}
			}
			sort(v.begin(),v.end());
			int srednji=v.size()/2;
			mn=min(mn,v[srednji]);
		}
	}
	return mn;
}
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	return rectangle1(R,C,H,W,Q);
}
/*
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int r,c,h,w;
	cin>>r>>c>>h>>w;
	int a[mn][mn];
	for(int i=0;i<r;i++)
		for(int j=0;j<c;j++) cin>>a[i][j];
	cout<<rectangle(r,c,h,w,a)<<endl;
	return 0;
}*/

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 287 ms 768 KB Output is correct
5 Correct 231 ms 768 KB Output is correct
6 Correct 166 ms 896 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 287 ms 768 KB Output is correct
5 Correct 231 ms 768 KB Output is correct
6 Correct 166 ms 896 KB Output is correct
7 Execution timed out 5094 ms 3044 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 287 ms 768 KB Output is correct
5 Correct 231 ms 768 KB Output is correct
6 Correct 166 ms 896 KB Output is correct
7 Execution timed out 5094 ms 3044 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 287 ms 768 KB Output is correct
5 Correct 231 ms 768 KB Output is correct
6 Correct 166 ms 896 KB Output is correct
7 Execution timed out 5094 ms 3044 KB Time limit exceeded
8 Halted 0 ms 0 KB -