#include <bits/stdc++.h>
#define forn(i, a, b) for(int i = int(a); i <= int(b); ++ i)
///#include "grader.h"
#include "quality.h"
using namespace std;
vector<int> arre;
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
int mitad = (H * W) / 2;
int res = INT_MAX;
forn(i, 0, R - H){
forn(j, 0, C - W){
arre.clear();
forn(k, i, i + H - 1){
forn(l, j, j + W - 1){
arre.push_back(Q[k][l]);
}
}
sort(arre.begin(), arre.end());
res = min(res, arre[mitad]);
}
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
468 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
468 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
273 ms |
804 KB |
Output is correct |
5 |
Correct |
218 ms |
776 KB |
Output is correct |
6 |
Correct |
155 ms |
836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
468 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
273 ms |
804 KB |
Output is correct |
5 |
Correct |
218 ms |
776 KB |
Output is correct |
6 |
Correct |
155 ms |
836 KB |
Output is correct |
7 |
Execution timed out |
5061 ms |
2528 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
468 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
273 ms |
804 KB |
Output is correct |
5 |
Correct |
218 ms |
776 KB |
Output is correct |
6 |
Correct |
155 ms |
836 KB |
Output is correct |
7 |
Execution timed out |
5061 ms |
2528 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
468 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
273 ms |
804 KB |
Output is correct |
5 |
Correct |
218 ms |
776 KB |
Output is correct |
6 |
Correct |
155 ms |
836 KB |
Output is correct |
7 |
Execution timed out |
5061 ms |
2528 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |