oj.uz

Submission #407426

# Submission time Handle Problem Language Result Execution time Memory
407426 2021-05-18T23:54:45 Z arwaeystoamneg The Kingdom of JOIOI (JOI17_joioi) C++17
100 / 100
 1454 ms 17480 KB 
// 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.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 1228 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 7 ms 1500 KB Output is correct
19 Correct 7 ms 1476 KB Output is correct
20 Correct 6 ms 1312 KB Output is correct
21 Correct 10 ms 1612 KB Output is correct
22 Correct 9 ms 1612 KB Output is correct
23 Correct 8 ms 1676 KB Output is correct
24 Correct 8 ms 1468 KB Output is correct
25 Correct 8 ms 1612 KB Output is correct
26 Correct 8 ms 1612 KB Output is correct
27 Correct 10 ms 1676 KB Output is correct
28 Correct 10 ms 1592 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 1228 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 7 ms 1500 KB Output is correct
19 Correct 7 ms 1476 KB Output is correct
20 Correct 6 ms 1312 KB Output is correct
21 Correct 10 ms 1612 KB Output is correct
22 Correct 9 ms 1612 KB Output is correct
23 Correct 8 ms 1676 KB Output is correct
24 Correct 8 ms 1468 KB Output is correct
25 Correct 8 ms 1612 KB Output is correct
26 Correct 8 ms 1612 KB Output is correct
27 Correct 10 ms 1676 KB Output is correct
28 Correct 10 ms 1592 KB Output is correct
29 Correct 819 ms 15744 KB Output is correct
30 Correct 804 ms 16504 KB Output is correct
31 Correct 861 ms 16504 KB Output is correct
32 Correct 987 ms 16400 KB Output is correct
33 Correct 867 ms 14468 KB Output is correct
34 Correct 825 ms 16524 KB Output is correct
35 Correct 1454 ms 17268 KB Output is correct
36 Correct 1149 ms 16664 KB Output is correct
37 Correct 1398 ms 17480 KB Output is correct