oj.uz

Submission #917379

# Submission time Handle Problem Language Result Execution time Memory
917379 2024-01-28T04:10:24 Z Whisper Luxury burrow (IZhO13_burrow) C++17
100 / 100
 577 ms 25936 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, M, K;
int a[MAX][MAX];
void Whisper(){
    cin >> N >> M >> K;
    FOR(i, 1, N) FOR(j, 1, M) cin >> a[i][j];
    int l = 1, r = 1e9;
    auto check = [&](int d){
        vector<vector<int>> f(N + 1, vector<int>(M + 1));
        vector<int> l(M + 1), r(M + 1), h(M + 1);
        FOR(i, 1, N) FOR(j, 1, M){
            f[i][j] = (a[i][j] >= d);
        }
        int ans = 0;
        for (int i = 1; i <= N; ++i){
            for (int j = 1; j <= M; ++j) h[j] = (f[i][j] ? h[j] + 1 : 0);
            stack<int> st;
            for (int j = 1; j <= M; ++j){
                while (!st.empty() && h[st.top()] >= h[j]) st.pop();
                l[j] = (st.empty() ? 0 : st.top());
                st.push(j);
            }
            st = stack<int> {};
            for (int j = M; j >= 1; --j){
                while (!st.empty() && h[st.top()] >= h[j]) st.pop();
                r[j] = (st.empty() ? M + 1 : st.top());
                st.push(j);
            }
            for (int j = 1; j <= M; ++j){
                maximize(ans, (r[j] - l[j] - 1) * h[j]);
            }
        }
        return ans;
    };
    int ans = -1;
    while (l <= r){
        int mid = (l + r) >> 1;
        if (check(mid) >= K){
            l = mid + 1;
            ans = mid;
        }
        else r = mid - 1;
    }
    cout << ans << " " << check(ans) << '\n';
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 8 ms 2904 KB Output is correct
10 Correct 25 ms 3160 KB Output is correct
11 Correct 40 ms 3504 KB Output is correct
12 Correct 22 ms 5208 KB Output is correct
13 Correct 35 ms 3420 KB Output is correct
14 Correct 67 ms 6560 KB Output is correct
15 Correct 73 ms 6564 KB Output is correct
16 Correct 74 ms 7064 KB Output is correct
17 Correct 87 ms 7228 KB Output is correct
18 Correct 203 ms 12652 KB Output is correct
19 Correct 214 ms 12496 KB Output is correct
20 Correct 432 ms 17404 KB Output is correct
21 Correct 406 ms 20188 KB Output is correct
22 Correct 497 ms 25936 KB Output is correct
23 Correct 577 ms 25936 KB Output is correct
24 Correct 345 ms 16724 KB Output is correct
25 Correct 387 ms 19052 KB Output is correct