oj.uz

답안 #173443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173443 2020-01-04T06:30:27 Z dennisstar The Kingdom of JOIOI (JOI17_joioi) C++11
100 / 100
 933 ms 133752 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
#define all(V) ((V).begin()), ((V).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef vector<int> vim;
typedef vector<ll> vlm;


int H, W;
int ar[2010][2010], im[2010][2010];
int Lmn[2010][2010], Lmx[2010][2010], Rmn[2010][2010], Rmx[2010][2010];
int lb[2010];

void init() {
	for (int i=1; i<=H; i++) Lmn[i][0]=Rmn[i][W+1]=(1<<30);
	for (int i=1; i<=W; i++) Lmn[0][i]=Rmn[H+1][i]=(1<<30);
	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) {
		Lmn[i][j]=min({ar[i][j], Lmn[i-1][j], Lmn[i][j-1]});
		Lmx[i][j]=max({ar[i][j], Lmx[i-1][j], Lmx[i][j-1]});
	}
	for (int i=H; i>=1; i--) for (int j=W; j>=1; j--) {
		Rmn[i][j]=min({ar[i][j], Rmn[i+1][j], Rmn[i][j+1]});
		Rmx[i][j]=max({ar[i][j], Rmx[i+1][j], Rmx[i][j+1]});
	}
}

int f(int v, int mn) {
	int r=W;
	int rn=(1<<30), rx=0;
	for (int i=1; i<=H; i++) {
		int u=upper_bound(Lmx[i]+1, Lmx[i]+W+1, mn+v)-Lmx[i];
		r=min(r, u-1);
		rn=min(rn, Rmn[i][u]);
		rx=max(rx, Rmx[i][u]);
	}
	if (rn==(1<<30)) rn=0;
	return (rx-rn<=v?1:0);
}

int solve() {
	init();
	int mx=0, st=0, mn=Lmn[H][W];
	for (int i=H; i>=1; i--) {
		for (int j=W; j>=1; j--) if (mn==ar[i][j]) { st=max(st, j); break; }
		lb[i]=st; mx=max(mx, Lmx[i][st]);
	}
	int s=mx-mn, e=Lmx[H][W], ret;
	int ans=(1<<30);
	while (s<e) {
		int md=(s+e)/2;
		if (f(md, mn)) {
			ans=md; e=md;
		}
		else s=md+1;
	}
	return ans;
}

int main() {
	int ans;
	scanf("%d %d", &H, &W);
	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) scanf("%d", &ar[i][j]);

	ans=solve(); 

	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) im[i][j]=ar[H-i+1][j];
	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) ar[i][j]=im[i][j];
	ans=min(ans, solve());

	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) im[i][j]=ar[i][W-j+1];
	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) ar[i][j]=im[i][j];
	ans=min(ans, solve());

	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) im[i][j]=ar[H-i+1][j];
	for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) ar[i][j]=im[i][j];
	ans=min(ans, solve());

	printf("%d\n", ans);
	return 0;
}

Compilation message

joioi.cpp: In function 'int solve()':
joioi.cpp:53:28: warning: unused variable 'ret' [-Wunused-variable]
  int s=mx-mn, e=Lmx[H][W], ret;
                            ^~~
joioi.cpp: In function 'int main()':
joioi.cpp:67:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &H, &W);
  ~~~~~^~~~~~~~~~~~~~~~~
joioi.cpp:68:57: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1; i<=H; i++) for (int j=1; j<=W; j++) scanf("%d", &ar[i][j]);
                                                    ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 7 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 12 ms 6136 KB Output is correct
17 Correct 14 ms 6392 KB Output is correct
18 Correct 14 ms 6392 KB Output is correct
19 Correct 15 ms 6392 KB Output is correct
20 Correct 13 ms 5752 KB Output is correct
21 Correct 16 ms 6520 KB Output is correct
22 Correct 16 ms 6408 KB Output is correct
23 Correct 16 ms 6520 KB Output is correct
24 Correct 14 ms 5752 KB Output is correct
25 Correct 16 ms 6520 KB Output is correct
26 Correct 16 ms 6520 KB Output is correct
27 Correct 16 ms 6520 KB Output is correct
28 Correct 16 ms 6520 KB Output is correct
29 Correct 719 ms 112304 KB Output is correct
30 Correct 717 ms 116240 KB Output is correct
31 Correct 756 ms 117868 KB Output is correct
32 Correct 757 ms 117956 KB Output is correct
33 Correct 655 ms 103440 KB Output is correct
34 Correct 755 ms 118028 KB Output is correct
35 Correct 933 ms 133496 KB Output is correct
36 Correct 821 ms 127864 KB Output is correct
37 Correct 929 ms 133752 KB Output is correct