Submission #339736

#	Time	Username	Problem	Language	Result	Execution time	Memory
339736		amunduzbaev	Luxury burrow (IZhO13_burrow)	C++14	0 / 100	1 ms	492 KiB

burrow

/** made by amunduzbaev **/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/rope>

using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}

typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int N = 205;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, a[N][N];
pii ans;
int pref[N][N];

void solve(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++) cin>>a[i][j];
	}
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			memset(pref, mod, sizeof pref);
			pref[i][j] = a[i][j];
			for(int l=i;l<=n;l++){
				for(int t=j;t<=m;t++){
					pref[l][t] = min(min(pref[l][t-1], pref[l-1][t]), a[l][t]);
				//	cout<<pref[l][t]<<" ";
					if((t - j+1) * (l - i+1) >= k) {
						if(pref[l][t] > ans.ff) ans = {pref[l][t], (t - j+1) * (l - i+1) };
						else if(pref[l][t] == ans.ff) umax(ans.ss, (t - j+1)*(l - i+1));
					}
				}//cout<<"\n";
			}
		//	cout<<"_____\n";
		//	for(int l=1;l<=n;l++) { for(int t=1;t<=m;t++) cout<<pref[l][t]<<" "; cout<<"\n";}
		}
	}
	
	cout<<ans.ff<<" "<<ans.ss<<"\n";
	return;
}

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

• Subtask 1: 0 / 100