oj.uz

답안 #1029347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029347 2024-07-20T17:24:54 Z Minbaev 호화 벙커 (IZhO13_burrow) C++17
0 / 100
 2000 ms 19284 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;

void solve(){
	
	cin >> n >> m >> k;
	
	int arr[n+1][m+1];
	for(int i = 0;i<n;i++)
		for(int j = 0;j<m;j++)
			cin >> arr[i][j];
		
	int area = 0, ans = -1;
	int l = 1, r = 1e9;
	
	while(l<=r){
		int mid = (l+r)/2;
		
		int dp[n+1][m+1]{};
		for(int i = n-1;i>=0;i--)
			for(int j = 0;j<m;j++){
				if(arr[i][j] >= mid)dp[i][j] = dp[i+1][j] + 1;
				else dp[i][j] = 0;
		}
		
		int mx = -1;
		for(int i = 0;i<n;i++){
			for(int j = 0;j<m;j++){
				if(dp[i][j] == 0)continue;
				int r = j, mn = dp[i][j];
				while(r < m && dp[i][r] > 0){
					umax(mx, (r-j+1)*mn);
					r += 1;
					umin(mn, dp[i][r]);
				}
				//~ j = r - 1;
			}
		}
		
		if(mx >= k){
			l = mid + 1;
			area = mx;
			ans = mid;
		}
		else{
			r = mid - 1;
		}
	}
	
	cout << ans << " " << area << "\n";
	
	
	
}
/*
2
2
2 1
4
2 3 1 4

 */
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 25 ms 860 KB Output is correct
10 Correct 7 ms 1372 KB Output is correct
11 Correct 211 ms 2020 KB Output is correct
12 Correct 15 ms 1372 KB Output is correct
13 Correct 10 ms 1628 KB Output is correct
14 Correct 132 ms 3420 KB Output is correct
15 Correct 73 ms 3420 KB Output is correct
16 Correct 802 ms 4032 KB Output is correct
17 Correct 21 ms 4700 KB Output is correct
18 Correct 1963 ms 8764 KB Output is correct
19 Correct 410 ms 9812 KB Output is correct
20 Correct 1789 ms 15956 KB Output is correct
21 Execution timed out 2035 ms 19284 KB Time limit exceeded
22 Halted 0 ms 0 KB -