| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1144807 | sano | Quality Of Living (IOI10_quality) | C++20 | 0 ms | 0 KiB |
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<string>
#include<fstream>
#include<algorithm>
#include <iomanip>
#include<map>
#include <set>
#include <unordered_map>
#include <stack>
#include <unordered_set>
#include <cmath>
#include <cstdint>
#define shit short int
#define ll long long
#define For(i, n) for(int i = 0; i < (int)n; i++)
#define ffor(i, a, n) for(int i = (int)a; i < (int)n; i++)
#define rfor(i, n) for(int i = (int)n; i >= (int)0; i--)
#define rffor(i, a, n) for(int i = (int)n; i >= (int)a; i--)
#define vec vector
#define ff first
#define ss second
#define pb push_back
#define pii pair<int, int>
#define NEK 2000000000
#define mod 1000000007
#define mod2 1000000009
#define rsz resize
#define prv1 43
#define prv2 47
#define D 8
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define sig 0.0000001
using namespace std;
int rectangle(int r, int c, int h, int w, vec<vec<int>> p) {
vec<vec<int>> ps(r + 1, vec<int>(c + 1, 0));
int le = 0; int ri = NEK;
while (le < ri) {
int mid = (le + ri + 1) / 2;
ffor(i, 1, r) {
ffor(j, 1, c) {
ps[i][j] = ps[i - 1][j] + ps[i][j - 1] - ps[i - 1][j - 1] + (p[i - 1][j - 1] >= mid) * 2 - 1;
}
}
int hod = -1;
For(i, (r - h + 1)) {
For(j, (c - w + 1)) {
hod = max(hod, ps[i + h][j + w] - ps[i][j + w] - ps[i + h][j] + ps[i][j]);
}
}
if (hod >= 0) le = mid;
else ri = mid - 1;
}
return le;
}
/*
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
//cin >> t;
t = 1;
while (t--) {
solve();
}
return 0;
}*/