# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491208 | Vladikus004 | Luxury burrow (IZhO13_burrow) | C++14 | 2 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define inf 2e9
#define ff first
#define ss second
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int N = 1000 + 3;
int n, m, k, a[N][N], h[N][N];
int check(int x) {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
h[i][j] = (a[i][j] >= x);
for (int i = 1; i < n; i++)
for (int j = 0; j < m; j++)
if (h[i][j])
h[i][j] += h[i - 1][j];
int mx = 0;
for (int i = 0; i < n; i++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |