# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42318 | wzy | Luxury burrow (IZhO13_burrow) | C++11 | 2 ms | 376 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>
using namespace std;
#define F first
#define S second
#define pb push_back
#define pii pair<int,int>
#define int long long
int n , m , k;
int v[1005][1005] , h[1005][1005];
int get(vector<int> t){
int ansj = 0;
stack<int> s;
for(int i = 0 ; i <t.size();i++){
while(s.size() && t[s.top()] >= t[i]){
int lefti = 0;
int u = s.top();
s.pop();
if(s.size()) lefti = s.top();
ansj = max(ansj , (u - lefti)*(t[u]));
}
s.push(i);
}
while(!s.empty()){
int u = s.top();
int leftii = 0;
s.pop();
if(s.size())leftii = s.top();
ansj = max(ansj , ((u) - (leftii))*(t[u]));
}
return ansj;
}
int32_t main(){
scanf("%lld%lld%lld" , &n , &m ,&k);
for(int i = 0 ; i<n;i++){
for(int j = 0 ; j < m;j++)scanf("%lld" , &v[i][j]);
}
int l = 0 , r =(int) 1e9;
int ansj = -1 , maxansjii;
while(l<=r){
int mid = (l+r)/2;
for(int i = 0 ; i < n;i++){
for(int j = 0 ; j <m ;j++){
if(i){
if(v[i][j] >= mid) h[i][j] = 1 + h[i-1][j];
else h[i][j] = 0;
}
else{
if(v[i][j] >= mid) h[i][j] = 1;
else h[i][j] = 0;
}
}
}
int currarr = -1;
for(int i = 0 ; i < n;i++){
vector<int> t;
for(int j = 0 ; j < m ; j++) t.pb(h[i][j]);
currarr = max(currarr , get(t));
}
if(currarr >= k){
ansj = max(ansj , mid);
maxansjii = currarr;
l = mid + 1;
}
else r = mid - 1;
}
cout<<ansj<<" "<<maxansjii<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |