Submission #1007401

#	Time	Username	Problem	Language	Result	Execution time	Memory
1007401		giorgi_pkhaladze	The Kingdom of JOIOI (JOI17_joioi)	C++14	100 / 100	1468 ms	70864 KiB

joioi

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ff first
#define ss second
using namespace std;
const int N=2010;
int n,m,ans,a[N][N],b[N][N],mn;
void turn(){
	for(int i=1; i<=n; i++) for(int j = 1; j<=m; j++)b[j][n+1-i]=a[i][j];
	swap(n,m);
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++)a[i][j]=b[i][j];
}
bool check(int o){
	for(int k=0; k<4; k++){
		int lst=m,omx=0,omn=1e9;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= lst; j++)if(a[i][j]>mn+o){lst=j-1; break;}
			for(int j=lst+1; j<=m; j++){
				omx=max(omx,a[i][j]);
				omn=min(omn,a[i][j]);
			}
		}
		if(omx-omn<=o)return 1;
		if(k<3) turn();
	}
	return 0;
}
int main() {
	cin>>n>>m;
	mn=1e9;
	for(int i=1; i<=n; i++)
		for(int j=1; j<=m; j++){cin>>a[i][j]; mn=min(mn,a[i][j]);}
	int l=0,r=1e9;
	while(l<=r){
		int md=(l+r)/2;
		if(check(md))r=md-1;
		else l=md+1;
	}
	cout<<l;
}

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