제출 #549733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549733		Pherokung	The Kingdom of JOIOI (JOI17_joioi)	C++14	0 / 100	2 ms	852 KiB

joioi

#include<bits/stdc++.h>
using namespace std;
#define N 2005
#define F first
#define S second
int n,m,A[N][N],a[N][N],dp[N][N],ans=1e9;
typedef pair<int,int> pa;
 
bool cal(int n,int m,int v){
	bitset<N> dp[N];
	for(int i=0;i<=n;i++) dp[i] = 1;
	for(int i=0;i<=m;i++) dp[n+1][i] = true;
	
	for(int i=n;i>0;i--) for(int j=1;a[i][j]<=v&&dp[i+1][j]&&dp[i][j-1];j++) dp[i][j]=true;
	
	if(!dp[n][1]) return false;
	if(dp[1][m]) return true;
	
	int mn[2], mx[2];
	mn[0] = mn[1] = 1e9;
    mx[0] = mx[1] = 0;
    
	for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            mn[dp[i][j]]=min(mn[dp[i][j]],a[i][j]);
            mx[dp[i][j]]=max(mx[dp[i][j]],a[i][j]);
        }
    }
	
//	printf(">> %d : %d %d %d %d\n",v,mx1,mn1,mx0,mn0);
	ans = min(ans,max(mx[0]-mn[0],mx[1]-mn[1]));
	if(mn[1] >= mn[0]) return false;
	return mx[1]-mn[1] > mx[0]-mn[0];
}
 
void sol(int n,int m){
	int be = 1,ed = 1e9;
	while(be < ed){
		int mid = (be+ed)/2;
		if(cal(n,m,mid)) ed = mid;
		else be = mid+1;
	}
}
 
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%d",&A[i][j]);
	
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) a[i][j] = A[i][j];
	sol(n,m);
 
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) a[n-i+1][j] = A[i][j];
	sol(n,m);
	
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) a[m-j+1][n-i+1] = A[i][j];
	sol(m,n);
	
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) a[j][n-i+1] = A[i][j];
	sol(m,n);
	
	printf("%d",ans);
}

컴파일 시 표준 에러 (stderr) 메시지

joioi.cpp: In function 'int main()':
joioi.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
joioi.cpp:47:51: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%d",&A[i][j]);
      |                                              ~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 45
• Subtask 3: 0 / 40