oj.uz

답안 #29423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
29423 2017-07-19T10:36:37 Z PrOAhMeT The Kingdom of JOIOI (JOI17_joioi) C++14
0 / 100
 6 ms 64836 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

const int MAXN=2005;
int a[MAXN][MAXN],n,m,used[MAXN*MAXN],ans=1e9,mx,mn,idx,l,r,add,mnn,b[MAXN][MAXN];
vector<int> so(MAXN*MAXN);
multiset<int> mpp;

void rotate1() {

	//cout<<"fuk"<<endl;
	for(int i=0;i<n;++i)
		for(int j=0;j<m;++j) {
			b[i][m-j-1]=a[i][j];
		}
	for(int i=0;i<n;++i)
		for(int j=0;j<m;++j) {
			a[i][j]=b[i][j];
		}

}

void rotate2() {

	for(int i=0;i<n;++i)
		for(int j=0;j<m;++j) {
			b[n-i-1][j]=a[i][j];
		}
	for(int i=0;i<n;++i)
		for(int j=0;j<m;++j) {
			a[i][j]=b[i][j];
		}

}

int solve() {

	/*for(int i=0;i<n;++i) {
		for(int j=0;j<m;++j) {
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}*/
	int ret=1e9;
	int x,y;
	mn=1e9+1;
	for(int i=0;i<n;++i)
		for(int j=0;j<m;++j) {
			mpp.insert(a[i][j]);
			if(mn>a[i][j]) {
				mn=a[i][j];
				x=i;
				y=j;
			}
		}
	//cout<<"xd"<<endl;
	mx=0;
	int up[MAXN];
	memset(up,0,sizeof up);
	for(int j=0;j<=x;++j) {
		up[j]=y+1;
		for(int i=0;i<=y;++i)  {
				mx=max(mx,a[j][i]);
				mpp.erase(a[j][i]);
		}
	}
	ret=min(ret,max(mx-mn,*(--mpp.end())-*mpp.begin()));
	//cout<<"xd"<<endl;
	while(!mpp.empty()) {
		add=-1,mnn=1e9+1;
		for(int i=0;i<n;++i) {
			if(up[i]!=m) {
				if(i&&up[i]==up[i-1])
					continue;
				if(mnn>a[i][up[i]]) {
					mnn=a[i][up[i]];
					add=i;
				}
			}
		}
		mx=max(mx,a[add][up[add]]);
		mpp.erase(a[add][up[add]]);
		//cout<<mpp.size()<<endl;
		++up[add];
		if(!mpp.empty()) ret=min(ret,max(mx-mn,*(--mpp.end())-*mpp.begin()));
		//cout<<mpp.size()<<endl;	
	}
	//cout<<"rekt"<<endl;
	return ret;

}

int main() {

	scanf("%d %d",&n,&m);
	for(int i=0;i<n;++i)
		for(int j=0;j<m;++j) {
			scanf("%d",&a[i][j]);
		}
	ans=min(ans,solve());
	rotate1();
	//cout<<"malahmet"<<endl;
	ans=min(ans,solve());
	rotate2();
	ans=min(ans,solve());
	rotate1();
	ans=min(ans,solve());
	printf("%d\n",ans);

}

Compilation message

joioi.cpp: In function 'int main()':
joioi.cpp:102:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
                      ^
joioi.cpp:105:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a[i][j]);
                        ^
joioi.cpp: In function 'int solve()':
joioi.cpp:69:16: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   for(int i=0;i<=y;++i)  {
                ^
joioi.cpp:67:15: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for(int j=0;j<=x;++j) {
               ^

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 64836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 64836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 64836 KB Output isn't correct
2 Halted 0 ms 0 KB -