# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503597 | LouayFarah | Quality Of Living (IOI10_quality) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define endl "\n"
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const long long MOD = 1e9+7;
const long long INF = 1e18;
int nx[4] = {0, 0, -1, 1};
int ny[4] = {1, -1, 0, 0};
int rectangle(int r, int c, int h, int w, int *q[3001])
{
int res = 1e8;
for(int i = 0; i<=r-h; i++)
{
for(int j = 0; j<=c-w; j++)
{
vector<int> arr;
for(int k = i; k<h+i; k++)
{
for(int t = j; t<w+j; t++)
{
arr.pb(q[k][t]);
}
}
sort(arr.begin(), arr.end());
int len = int(arr.size());
int curr = arr[len/2];
res = min(res, curr);
}
}
return res;
}