제출 #1147963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147963		monkey133	The Kingdom of JOIOI (JOI17_joioi)	C++20	100 / 100	1321 ms	31824 KiB

joioi

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll h,w;
ll a[2005][2005];
ll minn = LLONG_MAX, maxx = LLONG_MIN;

bool check(ll x)
{
	ll dist = -1;
	for (ll i=0; i<h; ++i) 
	{
		for (ll j=0; j<w; ++j) if (maxx - a[i][j] > x) dist = max(dist, j);
		for (ll j=0; j<w; ++j) if (a[i][j] - minn > x && j <= dist) return 0;
	}
	return 1;
}

void reflectx()
{
	for (ll i=0; i<h/2; ++i) for (ll j=0; j<w; ++j) swap(a[i][j], a[h-1-i][j]);
}

void reflecty()
{
	for (ll i=0; i<h; ++i) for (ll j=0; j<w/2; ++j) swap(a[i][j], a[i][w-1-j]);
}

ll solve()
{
	ll lo = 0, hi = maxx - minn;
	while (lo!=hi)
	{
		ll mid = (lo + hi) >> 1;
		if (check(mid)) hi = mid;
		else lo = mid + 1;
	}
	return lo;
}

int main()
{
	cin >> h >> w;
	for (ll i=0; i<h; ++i) for (ll j=0; j<w; ++j) cin >> a[i][j];
	for (ll i=0; i<h; ++i) for (ll j=0; j<w; ++j) {minn = min(minn, a[i][j]); maxx = max(maxx, a[i][j]);}
	ll ans = solve();
	reflectx();
	ans = min(ans, solve());
	reflecty();
	ans = min(ans, solve());
	reflectx();
	ans = min(ans, solve());
	cout << ans << endl;
	return 0;
}

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