제출 #61125

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

joioi

#include <bits/stdc++.h>
using namespace std;
 
const int N = 2005;
 
int n, m, mn = 1e9, a[N][N], b[N][N], f[N];
 
bool check0(int x){
	f[0] = 1e9;
	int mn, mx;
	mn = 1e9, mx = 0;
	for(int i = 1; i <= n; ++i){
		int mx = 0; f[i] = 0;
		for(int j = 1; j <= m; ++j){
			mx = max(mx, b[i][j]);
			if(mx - mn > x) break;
			f[i]++;
		}
		f[i] = min(f[i], f[i - 1]);
		for(int j = f[i] + 1; j <= m; ++j){
			mn = min(mn, b[i][j]);
			mx = max(mx, b[i][j]);
		}
	}
	return mx - mn <= x;
}
 
bool check1(int x){
	bool ok = 0;
	for (int i = 1; i <= n; ++i){
		for (int j = 1; j <= m; ++j){
			b[i][j] = a[i][j];
		}
	}
	ok |= check0(x);
	for (int i = 1; i <= n; ++i){
		for (int j = 1; j <= m; ++j){
			b[i][j] = a[i][m - j + 1];
		}
	}
	ok |= check0(x);
	for (int i = 1; i <= n; ++i){
		for (int j = 1; j <= m; ++j){
			b[i][j] = a[n - i + 1][j];
		}
	}
	ok |= check0(x);
	for (int i = 1; i <= n; ++i){
		for (int j = 1; j <= m; ++j){
			b[i][j] = a[n - i + 1][m - j + 1];
		}
	}
	ok |= check0(x);
	return ok;
}
 
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]); mn = min(mn, a[i][j]);
		}
	}
 
	int l = 0, r = 1e9;
	while (l < r) {
		int mid = (l + r) >> 1;
		if (check1(mid)) r = mid;
		else l = mid + 1;
	}
	cout << l;
}

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

joioi.cpp: In function 'int main()':
joioi.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
joioi.cpp:61:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a[i][j]); mn = min(mn, a[i][j]);
    ~~~~~^~~~~~~~~~~~~~~~

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