#include <stdio.h>
#include <stdlib.h>
#include "quality.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int rectangle(int R, int C, int H, int W, int a[3001][3001]) {
int n=R;
int m=C;
int h=H;
int w=W;
int ans=n*m;
// cout<<endl;
for(int i=0;i<=n-h;i++){
for(int j=0;j<=m-w;j++){
vector < int > v;
for(int k=i;k<i+h;k++){
for(int f=j;f<j+w;f++){
v.push_back(a[k][f]);
// cout<<Q[k][f]<<" ";
}
cout<<endl;
}
sort(v.begin(),v.end());
// cout<<endl;
ans=min(ans,v[(h*w)/2]);
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
512 KB |
Output is correct |
2 |
Correct |
6 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
512 KB |
Output is correct |
2 |
Correct |
6 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
4 |
Correct |
444 ms |
1024 KB |
Output is correct |
5 |
Correct |
557 ms |
1016 KB |
Output is correct |
6 |
Correct |
244 ms |
944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
512 KB |
Output is correct |
2 |
Correct |
6 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
4 |
Correct |
444 ms |
1024 KB |
Output is correct |
5 |
Correct |
557 ms |
1016 KB |
Output is correct |
6 |
Correct |
244 ms |
944 KB |
Output is correct |
7 |
Execution timed out |
5058 ms |
3564 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
512 KB |
Output is correct |
2 |
Correct |
6 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
4 |
Correct |
444 ms |
1024 KB |
Output is correct |
5 |
Correct |
557 ms |
1016 KB |
Output is correct |
6 |
Correct |
244 ms |
944 KB |
Output is correct |
7 |
Execution timed out |
5058 ms |
3564 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
512 KB |
Output is correct |
2 |
Correct |
6 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
512 KB |
Output is correct |
4 |
Correct |
444 ms |
1024 KB |
Output is correct |
5 |
Correct |
557 ms |
1016 KB |
Output is correct |
6 |
Correct |
244 ms |
944 KB |
Output is correct |
7 |
Execution timed out |
5058 ms |
3564 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |