oj.uz

Submission #848614

# Submission time Handle Problem Language Result Execution time Memory
848614 2023-09-13T04:18:38 Z wakandaaa Luxury burrow (IZhO13_burrow) C++17
100 / 100
 509 ms 8536 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e3 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int m, n, k;
int a[N][N], x[N][N];
int h[N], l[N], r[N];

int calc(int c) {
	memset(a, 0, sizeof a);
	memset(h, 0, sizeof h);
	memset(l, 0, sizeof l);
	memset(r, 0, sizeof r);

	int res = 0;
	for (int i = 1; i <= m; ++i)
		for (int j = 1; j <= n; ++j) a[i][j] = (x[i][j] >= c);

    for (int i = 1; i <= m; ++i) {
    	for (int j = 1; j <= n; ++j) 
    		if (a[i][j] == 1)
    			h[j]++;
    		else
    			h[j] = 0;
 
    	stack<int> st;
    	for (int j = 1; j <= n; ++j) {
    		while (st.size() && h[st.top()] >= h[j]) st.pop();
    		l[j] = st.size() ? st.top() : 0;
    		st.push(j);
    	}
    	st = stack<int>{};
    	for (int j = n; j >= 1; --j) {
    		while (st.size() && h[st.top()] >= h[j]) st.pop();
    		r[j] = st.size() ? st.top() : n + 1;
    		st.push(j);
    	}
 
    	for (int j = 1; j <= n; ++j) {
    		int t = h[j] * (r[j] - l[j] - 1);
    		res = max(res, t);
    	}
    }
	return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> m >> n >> k;
    for (int i = 1; i <= m; ++i)
    	for (int j = 1; j <= n; ++j) cin >> x[i][j];

    int l = 0, r = 1e9;

	int res = 0;
	while (l <= r) {
		int mid = (l + r) / 2;
		if (calc(mid) >= k) {
			res = mid;
			l = mid + 1;
		} else r = mid - 1;
	}

	cout << res << ' ' << calc(res);

    return 0;
}

/*
3 5 2
5 7 5 5 5
8 5 5 7 5
8 5 8 8 8

8 3
*/

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5976 KB Output is correct
2 Correct 3 ms 5980 KB Output is correct
3 Correct 4 ms 6176 KB Output is correct
4 Correct 3 ms 6232 KB Output is correct
5 Correct 4 ms 6232 KB Output is correct
6 Correct 5 ms 6232 KB Output is correct
7 Correct 4 ms 5976 KB Output is correct
8 Correct 10 ms 8280 KB Output is correct
9 Correct 12 ms 8284 KB Output is correct
10 Correct 27 ms 8280 KB Output is correct
11 Correct 45 ms 8528 KB Output is correct
12 Correct 27 ms 8280 KB Output is correct
13 Correct 33 ms 8280 KB Output is correct
14 Correct 81 ms 8352 KB Output is correct
15 Correct 78 ms 8352 KB Output is correct
16 Correct 80 ms 8352 KB Output is correct
17 Correct 96 ms 8352 KB Output is correct
18 Correct 185 ms 8536 KB Output is correct
19 Correct 230 ms 8272 KB Output is correct
20 Correct 422 ms 8528 KB Output is correct
21 Correct 411 ms 8356 KB Output is correct
22 Correct 496 ms 8352 KB Output is correct
23 Correct 509 ms 8272 KB Output is correct
24 Correct 359 ms 8272 KB Output is correct
25 Correct 414 ms 8356 KB Output is correct