#include "quality.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int rectangle(int R, int C, int H, int W, int Q[3001][3001])
{
int res = R*C;
vector<int> temp;
for(int i = H-1; i < R; i++)
{
for(int j = W-1; j < C; j++)
{
temp.clear();
for(int x = i-H+1; x <= i; x++)
{
for(int y = j-W+1; y <= j; y++)
{
temp.push_back(Q[x][y]);
}
}
if(i == 3 && j == 4) for(int t: temp) cout << t << ' ';
cout << '\n';
sort(temp.begin(), temp.end());
res = min(res, temp[temp.size()/2]);
}
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
492 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
492 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
281 ms |
876 KB |
Output is correct |
5 |
Correct |
216 ms |
876 KB |
Output is correct |
6 |
Correct |
165 ms |
924 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
492 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
281 ms |
876 KB |
Output is correct |
5 |
Correct |
216 ms |
876 KB |
Output is correct |
6 |
Correct |
165 ms |
924 KB |
Output is correct |
7 |
Execution timed out |
5083 ms |
2668 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
492 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
281 ms |
876 KB |
Output is correct |
5 |
Correct |
216 ms |
876 KB |
Output is correct |
6 |
Correct |
165 ms |
924 KB |
Output is correct |
7 |
Execution timed out |
5083 ms |
2668 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
492 KB |
Output is correct |
2 |
Correct |
2 ms |
492 KB |
Output is correct |
3 |
Correct |
1 ms |
492 KB |
Output is correct |
4 |
Correct |
281 ms |
876 KB |
Output is correct |
5 |
Correct |
216 ms |
876 KB |
Output is correct |
6 |
Correct |
165 ms |
924 KB |
Output is correct |
7 |
Execution timed out |
5083 ms |
2668 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |