제출 #396788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396788		keta_tsimakuridze	The Kingdom of JOIOI (JOI17_joioi)	C++14	60 / 100	4005 ms	48904 KiB

joioi

#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=2e3+5,mod=1e9+7;
int t,a[N][N],r[N],l[N],mn[N],mx[N],n,m,ans,mid;
map<int,int> fix;
vector<int> val;
string s;

bool check(int mx1){
	int diff=mx1-val[0];
	for(int i=1;i<=n;i++) {
		l[i]=m+1;  r[i]=0;
	}
	for(int i=1;i<=n;i++) {
		for(int j=m;j>=1;j--){
			if(a[i][j]>mx1) l[i] = j - 1;
		}
		for(int j=1;j<=m;j++){
			if(a[i][j]+diff<val.back()) r[i] = j ;
		}
		 // [r[i] , l[i]) 
		 if(l[i]<r[i]) return 0;
	}
	int F=0;
	int cur=m;
	for(int i=1;i<=n;i++) {
		if(r[i]>cur) {
			F=1;
			break;
		} 
		cur = min(l[i],cur);
	}
	if(!F) return 1; 
	F=0;
	cur=0;
	for(int i=1;i<=n;i++) {
		if(l[i]<cur) {
			F=1;
			break;
		}
		cur = max(r[i],cur);
	}
	if(!F) return 1;
	return 0;
}
void search(){	
	int l = 0,r =(int)val.size()-1;
	while(l<=r){
		 mid=(l+r)/2; 
		if(check(val[mid])) { 
			ans =min(ans, (val[mid]-val[0])); 
			r=mid-1;
		}
		else l=mid+1;
	}
}
 main(){
 	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	// t=1;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin >> a[i][j]; 
			if(!fix[a[i][j]]) val.push_back(a[i][j]);
			fix[a[i][j]]=1;
		}
		
	} 
	sort(val.begin(),val.end()); ans=val.back()-val[0];
	search();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m/2;j++){
			swap(a[i][j],a[i][m-j+1]);
		}
	}
	search();
	val.clear();
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++){
			a[i][j]=-a[i][j];
			if(!fix[a[i][j]]) val.push_back(a[i][j]);
			fix[a[i][j]]=1;
		}
	}
	sort(val.begin(),val.end());
	search();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m/2;j++){
			swap(a[i][j],a[i][m-j+1]);
		}
	}
	search();
	cout<<ans;
}

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

joioi.cpp:59:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 |  main(){
      |       ^

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