#include "bits/stdc++.h"
using namespace std;
#define endl "\n"
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const long long MOD = 1e9+7;
const long long INF = 1e18;
int nx[4] = {0, 0, -1, 1};
int ny[4] = {1, -1, 0, 0};
int rectangle(int r, int c, int h, int w, int q[3001][3001])
{
int res = 1e8;
for(int i = 0; i<=r-h; i++)
{
for(int j = 0; j<=c-w; j++)
{
set<int> arr;
for(int k = i; k<h+i; k++)
{
for(int t = j; t<w+j; t++)
{
arr.insert(q[k][t]);
}
}
int len = int(arr.size());
int curr = *next(arr.begin(),len/2);
res = min(res, curr);
}
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
582 ms |
884 KB |
Output is correct |
5 |
Correct |
439 ms |
764 KB |
Output is correct |
6 |
Correct |
358 ms |
1000 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
582 ms |
884 KB |
Output is correct |
5 |
Correct |
439 ms |
764 KB |
Output is correct |
6 |
Correct |
358 ms |
1000 KB |
Output is correct |
7 |
Execution timed out |
5018 ms |
3060 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
582 ms |
884 KB |
Output is correct |
5 |
Correct |
439 ms |
764 KB |
Output is correct |
6 |
Correct |
358 ms |
1000 KB |
Output is correct |
7 |
Execution timed out |
5018 ms |
3060 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
582 ms |
884 KB |
Output is correct |
5 |
Correct |
439 ms |
764 KB |
Output is correct |
6 |
Correct |
358 ms |
1000 KB |
Output is correct |
7 |
Execution timed out |
5018 ms |
3060 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |