#include "quality.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) v.begin(),v.end()
int rectangle(int n, int m, int h, int w, int a[3001][3001]) {
ll mn = n*m;
for(int i = 1; i <= n - h + 1; i++){
for(int j = 1; j <= m - w + 1; j++){
vector<ll>v;
for(int z = i; z < i + h; z++){
for(int k = j; k < j + w; k++){
v.push_back(a[z][k]);
}
}
sort(all(v));
mn = min(mn, v[v.size()/2]);
}
}
return mn;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |