oj.uz

답안 #1039518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039518 2024-07-31T02:33:20 Z vjudge1 호화 벙커 (IZhO13_burrow) C++17
100 / 100
 305 ms 25680 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;
vector<int>l(1005), r(1005);
 
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 l1 = 1, r1 = 1e9;
	
	while(l1<=r1){
		int mid = (l1+r1)/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++){
				l[j] = j - 1;
				while(l[j] >= 0 && dp[i][l[j]] >= dp[i][j])l[j] = l[l[j]];
			}
			
			for(int j = m - 1;j>=0;j--){
				r[j] = j + 1;
				while(r[j] < m && dp[i][r[j]] >= dp[i][j])r[j] = r[r[j]];
				umax(mx, (r[j]-l[j]-1)*dp[i][j]);
			}
		}
		
		if(mx >= k){
			l1 = mid + 1;
			area = mx;
			ans = mid;
		}
		else{
			r1 = 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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 472 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 14 ms 1408 KB Output is correct
11 Correct 24 ms 2060 KB Output is correct
12 Correct 13 ms 1368 KB Output is correct
13 Correct 18 ms 1700 KB Output is correct
14 Correct 44 ms 3416 KB Output is correct
15 Correct 45 ms 3416 KB Output is correct
16 Correct 46 ms 4016 KB Output is correct
17 Correct 51 ms 4700 KB Output is correct
18 Correct 108 ms 8652 KB Output is correct
19 Correct 125 ms 9820 KB Output is correct
20 Correct 255 ms 15824 KB Output is correct
21 Correct 216 ms 19284 KB Output is correct
22 Correct 305 ms 25572 KB Output is correct
23 Correct 281 ms 25680 KB Output is correct
24 Correct 195 ms 15040 KB Output is correct
25 Correct 207 ms 18892 KB Output is correct