oj.uz

답안 #112022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112022 2019-05-17T05:42:12 Z qkxwsm The Kingdom of JOIOI (JOI17_joioi) C++14
100 / 100
 727 ms 55172 KB 
//clever
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

#define INF 1000000007
#define MAXN 2013

typedef pair<int, int> pii;

int N, M;
int grid[MAXN][MAXN];
int big, small = INF;
pii bigpos, smallpos;
pii range[MAXN];

bool valid(int x, int y)
{
	return (0 <= x && x < N && 0 <= y && y < M);
}
bool ok()
{
	//these are the first guys that do not approve!
	FOR(i, 0, N)
	{
		if (range[i].fi >= range[i].se) return false;
	}
	bool flag = true; int pos = 0;
	FOR(i, 0, N)
	{
		if (range[i].se < pos)
		{
			flag = false; break;
		}
		pos = max(pos, range[i].fi + 1);
	}
	if (flag) return true;
	flag = true; pos = M - 1;
	FOR(i, 0, N)
	{
		if (range[i].fi > pos)
		{
			flag = false; break;
		}
		pos = min(pos, range[i].se - 1);
	}
	if (flag) return true;
	return false;
}

bool check(int c)
{
	//try to merge stuff with small!
	//try to have SMALL be an increasing/decreasing sequence!
	FOR(i, 0, N)
	{
		for (range[i].se = 0; range[i].se < M; range[i].se++)
		{
			if (grid[i][range[i].se] > small + c) break;
		}
		for (range[i].fi = M - 1; range[i].fi >= 0; range[i].fi--)
		{
			if (grid[i][range[i].fi] < big - c) break;
		}
	}
	if (ok())
	{
		return true;
	}
	//try to have BIG be an increasing/decreasing sequence
	FOR(i, 0, N)
	{
		for (range[i].se = 0; range[i].se < M; range[i].se++)
		{
			if (grid[i][range[i].se] < big - c) break;
		}
		for (range[i].fi = M - 1; range[i].fi >= 0; range[i].fi--)
		{
			if (grid[i][range[i].fi] > small + c) break;
		}
	}
	if (ok())
	{
		return true;
	}
	return false;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> M;
	FOR(i, 0, N)
	{
		FOR(j, 0, M)
		{
			cin >> grid[i][j];
			if (grid[i][j] > big)
			{
				big = grid[i][j];
				bigpos = {i, j};
			}
			if (grid[i][j] < small)
			{
				small = grid[i][j];
				smallpos = {i, j};
			}
		}
	}
	// cerr << smallpos.fi << ' ' << smallpos.se << ' ' << bigpos.fi << ' ' << bigpos.se << endl;
	int lo = 0, hi = big - small;
	while(hi > lo)
	{
		int mid = (hi + lo) >> 1;
		if (check(mid)) hi = mid;
		else lo = mid + 1;
	}
	cout << lo << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 19 ms 1280 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 6 ms 1280 KB Output is correct
19 Correct 6 ms 1280 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 9 ms 1280 KB Output is correct
22 Correct 7 ms 1280 KB Output is correct
23 Correct 8 ms 1280 KB Output is correct
24 Correct 9 ms 1280 KB Output is correct
25 Correct 9 ms 1280 KB Output is correct
26 Correct 9 ms 1280 KB Output is correct
27 Correct 12 ms 1280 KB Output is correct
28 Correct 10 ms 1280 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 19 ms 1280 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 6 ms 1280 KB Output is correct
19 Correct 6 ms 1280 KB Output is correct
20 Correct 6 ms 1152 KB Output is correct
21 Correct 9 ms 1280 KB Output is correct
22 Correct 7 ms 1280 KB Output is correct
23 Correct 8 ms 1280 KB Output is correct
24 Correct 9 ms 1280 KB Output is correct
25 Correct 9 ms 1280 KB Output is correct
26 Correct 9 ms 1280 KB Output is correct
27 Correct 12 ms 1280 KB Output is correct
28 Correct 10 ms 1280 KB Output is correct
29 Correct 354 ms 15416 KB Output is correct
30 Correct 416 ms 37776 KB Output is correct
31 Correct 416 ms 39536 KB Output is correct
32 Correct 487 ms 39476 KB Output is correct
33 Correct 356 ms 34432 KB Output is correct
34 Correct 450 ms 39444 KB Output is correct
35 Correct 727 ms 55032 KB Output is correct
36 Correct 491 ms 49884 KB Output is correct
37 Correct 581 ms 55172 KB Output is correct