Submission #407426

#	Time	Username	Problem	Language	Result	Execution time	Memory
407426		arwaeystoamneg	The Kingdom of JOIOI (JOI17_joioi)	C++17	100 / 100	1454 ms	17480 KiB

joioi

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 2004;
int n, m, a[MAX][MAX], mi = inf, ma = -inf, d;
bool check()
{
	int best = 0;
	F0R(i, n)
	{
		F0R(j, best)if (a[i][j] > d + mi)return 0;
		int k = m - 1;
		for (; k >= 0; k--)if (a[i][k] < ma - d)break;
		if (k >= best)
		{
			FOR(j, best, k + 1)if (a[i][j] > d + mi)return 0;
			best = k + 1;
		}
	}
	return 1;
}
int main()
{
	setIO("test1");
	cin >> n >> m;
	F0R(i, n)F0R(j, m)cin >> a[i][j], mi = min(mi, a[i][j]), ma = max(ma, a[i][j]);
	int l = 0, r = ma - mi;
	while (l < r)
	{
		d = (l + r) / 2;
		if (check())
		{
			r = d;
		}
		else
		{
			F0R(i, n)reverse(a[i], a[i] + m);
			if (check())
			{
				r = d;
			}
			else
			{
				F0R(j, m)
				{
					F0R(i, n / 2)
					{
						swap(a[i][j], a[n - 1 - i][j]);
					}
				}
				if (check())
				{
					r = d;
				}
				else
				{
					F0R(i, n)reverse(a[i], a[i] + m);
					if (check())r = d;
					else l = d + 1;// don't need to restore
				}
			}
		}
	}
	cout << l << endl;
}

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