#include <iostream>
#include <vector>
#include <algorithm>
//#define FEEDBACK
using namespace std;
int binaryFunction(vector<int>& vec, int value);
int rectangle(int n, int m, int x, int y, int mat[][3001]){
vector<int> vec;
int max = n*m;
for(int i = 0; i <= n-x; ++i){
for(int j = 0; j <= m-y; ++j){
vec.resize(0);
for(int a = i; a < i+x; ++a){
for(int b =j; b < j+y; ++b){
vec.push_back(mat[a][b]);
}
}
sort(vec.begin(), vec.end());
#ifdef FEEDBACK
cout << "( " << i << ", " << j << " )\n";
cout << "median = " << vec[vec.size()/2] << endl;
#endif // FEEDBACK
if(max > vec[vec.size()/2]){
max = vec[vec.size()/2];
}
}
}
return max;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
281 ms |
888 KB |
Output is correct |
5 |
Correct |
217 ms |
768 KB |
Output is correct |
6 |
Correct |
164 ms |
916 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
281 ms |
888 KB |
Output is correct |
5 |
Correct |
217 ms |
768 KB |
Output is correct |
6 |
Correct |
164 ms |
916 KB |
Output is correct |
7 |
Execution timed out |
5047 ms |
2672 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
281 ms |
888 KB |
Output is correct |
5 |
Correct |
217 ms |
768 KB |
Output is correct |
6 |
Correct |
164 ms |
916 KB |
Output is correct |
7 |
Execution timed out |
5047 ms |
2672 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
281 ms |
888 KB |
Output is correct |
5 |
Correct |
217 ms |
768 KB |
Output is correct |
6 |
Correct |
164 ms |
916 KB |
Output is correct |
7 |
Execution timed out |
5047 ms |
2672 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |