제출 #103698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
103698		RockyB	The Kingdom of JOIOI (JOI17_joioi)	C++17	0 / 100	3 ms	384 KiB

joioi

/// In The Name Of God

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, m;
int a[N][N];

int len[N];
int ans = inf;
void rec(int v = 1, int last = n) {
	if (v > m) {
		int cur = -inf;
		{
			int mx = -inf, mn = inf;
			rep(i, 1, m) {
				rep(j, 1, len[i]) {
					mx = max(mx, a[j][i]);
					mn = min(mn, a[j][i]);
				}
			}
			cur = max(cur, mx - mn);
		}
		{
			int mx = -inf, mn = inf;
			rep(i, 1, m) {
				rep(j, len[i] + 1, n) {
					mx = max(mx, a[j][i]);
					mn = min(mn, a[j][i]);
				}
			}
			cur = max(cur, mx - mn);
		}
		ans = min(ans, cur);
		return;
	}
	rep(i, 1, last) {
		len[v] = i;
		rec(v + 1, i);
	}
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> m;
	rep(i, 1, n) rep(j, 1, m) {
		cin >> a[i][j];
	}
	rec();
	cout << ans;
	ioi
}

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