답안 #925837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925837	2024-02-12T09:45:02 Z	mickey080929	유괴 2 (JOI17_abduction2)	C++17	44 / 100	110 ms	27488 KB

abduction2

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int H, W, Q;
map<ll,int> memo;
int mxl[50010][16], mxr[50010][16], mxu[50010][16], mxd[50010][16];
int A[50010], B[50010];

int dfs(int x, int y, int dir) {
	if (memo.find((ll)x*(ll)W*2LL + (ll)y*2LL + (ll)dir) != memo.end()) return memo[(ll)x*(ll)W*2LL + (ll)y*2LL + (ll)dir];
	int cur = 0;
	if (dir == 0) {
		int u = x - 1, d = x + 1;
		for (int lv=15; lv>=0; lv--) {
			if (u - (1 << lv) >= -1 && mxu[u][lv] < B[y])
				u -= (1 << lv);
			if (d + (1 << lv) <= H && mxd[d][lv] < B[y])
				d += (1 << lv);
		}
		if (u != -1) cur = max(cur, dfs(u, y, 1) + x - u);
		else cur = max(cur, x);
		if (d != H) cur = max(cur, dfs(d, y, 1) + d - x);
		else cur = max(cur, H - x - 1);
	}
	else {
		int l = y - 1, r = y + 1; 
		for (int lv=15; lv>=0; lv--) {
			if (l - (1 << lv) >= -1 && mxl[l][lv] < A[x])
				l -= (1 << lv);
			if (r + (1 << lv) <= W && mxr[r][lv] < A[x])
				r += (1 << lv);
		}
		if (l != -1) cur = max(cur, dfs(x, l, 0) + y - l);
		else cur = max(cur, y);
		if (r != W) cur = max(cur, dfs(x, r, 0) + r - y);
		else cur = max(cur, W - y - 1);
	}
	memo[(ll)x*(ll)W*2LL + (ll)y*2LL + (ll)dir] = cur;
	return cur;
}

int main() {
	ios_base :: sync_with_stdio(false); cin.tie(NULL); 
	cin >> H >> W >> Q;
	for (int i=0; i<H; i++) {
		cin >> A[i];
		mxu[i][0] = mxd[i][0] = A[i];
	}
	for (int i=0; i<W; i++) {
		cin >> B[i];
		mxl[i][0] = mxr[i][0] = B[i];
	}
	for (int lv=1; lv<=15; lv++) {
		for (int i=0; i<H; i++) {
			if (i - (1 << lv) >= -1)
				mxu[i][lv] = max(mxu[i][lv-1], mxu[i-(1<<(lv-1))][lv-1]);
			if (i + (1 << lv) <= H)
				mxd[i][lv] = max(mxd[i][lv-1], mxd[i+(1<<(lv-1))][lv-1]);
		}
	}
	for (int lv=1; lv<=15; lv++) {
		for (int i=0; i<W; i++) {
			if (i - (1 << lv) >= -1)
				mxl[i][lv] = max(mxl[i][lv-1], mxl[i-(1<<(lv-1))][lv-1]);
			if (i + (1 << lv) <= W)
				mxr[i][lv] = max(mxr[i][lv-1], mxr[i+(1<<(lv-1))][lv-1]);
		}
	}
	while (Q --) {
		int x, y;
		cin >> x >> y;
		x --; y --;
		cout << max(dfs(x, y, 0), dfs(x, y, 1)) << '\n';
	}
}

Subtask #1
13.0 / 13.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8540 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	1 ms	8540 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	1 ms	8540 KB	Output is correct
6	Correct	1 ms	8540 KB	Output is correct
7	Correct	1 ms	8540 KB	Output is correct
8	Correct	1 ms	8540 KB	Output is correct
9	Correct	2 ms	8664 KB	Output is correct
10	Correct	1 ms	8536 KB	Output is correct
11	Correct	1 ms	8540 KB	Output is correct
12	Correct	1 ms	8540 KB	Output is correct
13	Correct	2 ms	8540 KB	Output is correct
14	Correct	2 ms	8540 KB	Output is correct
15	Correct	2 ms	8540 KB	Output is correct
16	Correct	2 ms	8540 KB	Output is correct
17	Correct	2 ms	8540 KB	Output is correct
18	Correct	2 ms	8540 KB	Output is correct
19	Correct	3 ms	8948 KB	Output is correct
20	Correct	3 ms	8796 KB	Output is correct
21	Correct	3 ms	8796 KB	Output is correct
22	Correct	3 ms	9052 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8540 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	1 ms	8540 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	1 ms	8540 KB	Output is correct
6	Correct	1 ms	8540 KB	Output is correct
7	Correct	1 ms	8540 KB	Output is correct
8	Correct	1 ms	8540 KB	Output is correct
9	Correct	2 ms	8664 KB	Output is correct
10	Correct	1 ms	8536 KB	Output is correct
11	Correct	1 ms	8540 KB	Output is correct
12	Correct	1 ms	8540 KB	Output is correct
13	Correct	2 ms	8540 KB	Output is correct
14	Correct	2 ms	8540 KB	Output is correct
15	Correct	2 ms	8540 KB	Output is correct
16	Correct	2 ms	8540 KB	Output is correct
17	Correct	2 ms	8540 KB	Output is correct
18	Correct	2 ms	8540 KB	Output is correct
19	Correct	3 ms	8948 KB	Output is correct
20	Correct	3 ms	8796 KB	Output is correct
21	Correct	3 ms	8796 KB	Output is correct
22	Correct	3 ms	9052 KB	Output is correct
23	Correct	13 ms	13144 KB	Output is correct
24	Correct	13 ms	13144 KB	Output is correct
25	Correct	14 ms	13376 KB	Output is correct
26	Correct	14 ms	13148 KB	Output is correct
27	Correct	13 ms	13148 KB	Output is correct
28	Correct	22 ms	17900 KB	Output is correct
29	Correct	14 ms	13916 KB	Output is correct
30	Correct	49 ms	19236 KB	Output is correct
31	Correct	55 ms	21076 KB	Output is correct
32	Correct	14 ms	13404 KB	Output is correct
33	Correct	24 ms	15116 KB	Output is correct

Subtask #4
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	8796 KB	Output is correct
2	Correct	3 ms	8796 KB	Output is correct
3	Correct	2 ms	8660 KB	Output is correct
4	Correct	2 ms	8796 KB	Output is correct
5	Correct	3 ms	8796 KB	Output is correct
6	Correct	2 ms	8796 KB	Output is correct
7	Correct	2 ms	8796 KB	Output is correct
8	Correct	4 ms	8916 KB	Output is correct
9	Correct	4 ms	9052 KB	Output is correct
10	Correct	4 ms	9048 KB	Output is correct
11	Correct	4 ms	9052 KB	Output is correct

Subtask #5
0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8540 KB	Output is correct
2	Correct	1 ms	8536 KB	Output is correct
3	Correct	1 ms	8540 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct
5	Correct	1 ms	8540 KB	Output is correct
6	Correct	1 ms	8540 KB	Output is correct
7	Correct	1 ms	8540 KB	Output is correct
8	Correct	1 ms	8540 KB	Output is correct
9	Correct	2 ms	8664 KB	Output is correct
10	Correct	1 ms	8536 KB	Output is correct
11	Correct	1 ms	8540 KB	Output is correct
12	Correct	1 ms	8540 KB	Output is correct
13	Correct	2 ms	8540 KB	Output is correct
14	Correct	2 ms	8540 KB	Output is correct
15	Correct	2 ms	8540 KB	Output is correct
16	Correct	2 ms	8540 KB	Output is correct
17	Correct	2 ms	8540 KB	Output is correct
18	Correct	2 ms	8540 KB	Output is correct
19	Correct	3 ms	8948 KB	Output is correct
20	Correct	3 ms	8796 KB	Output is correct
21	Correct	3 ms	8796 KB	Output is correct
22	Correct	3 ms	9052 KB	Output is correct
23	Correct	13 ms	13144 KB	Output is correct
24	Correct	13 ms	13144 KB	Output is correct
25	Correct	14 ms	13376 KB	Output is correct
26	Correct	14 ms	13148 KB	Output is correct
27	Correct	13 ms	13148 KB	Output is correct
28	Correct	22 ms	17900 KB	Output is correct
29	Correct	14 ms	13916 KB	Output is correct
30	Correct	49 ms	19236 KB	Output is correct
31	Correct	55 ms	21076 KB	Output is correct
32	Correct	14 ms	13404 KB	Output is correct
33	Correct	24 ms	15116 KB	Output is correct
34	Correct	2 ms	8796 KB	Output is correct
35	Correct	3 ms	8796 KB	Output is correct
36	Correct	2 ms	8660 KB	Output is correct
37	Correct	2 ms	8796 KB	Output is correct
38	Correct	3 ms	8796 KB	Output is correct
39	Correct	2 ms	8796 KB	Output is correct
40	Correct	2 ms	8796 KB	Output is correct
41	Correct	4 ms	8916 KB	Output is correct
42	Correct	4 ms	9052 KB	Output is correct
43	Correct	4 ms	9048 KB	Output is correct
44	Correct	4 ms	9052 KB	Output is correct
45	Correct	15 ms	13660 KB	Output is correct
46	Correct	15 ms	13656 KB	Output is correct
47	Correct	15 ms	13660 KB	Output is correct
48	Correct	15 ms	13636 KB	Output is correct
49	Correct	15 ms	13660 KB	Output is correct
50	Correct	26 ms	17488 KB	Output is correct
51	Correct	28 ms	18004 KB	Output is correct
52	Correct	80 ms	23240 KB	Output is correct
53	Correct	66 ms	23124 KB	Output is correct
54	Correct	66 ms	22356 KB	Output is correct
55	Incorrect	110 ms	27488 KB	Output isn't correct
56	Halted	0 ms	0 KB	-

답안 #925837

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 10.0 / 10.0

Subtask #3 17.0 / 17.0

Subtask #4 4.0 / 4.0

Subtask #5 0 / 56.0

Subtask #1
13.0 / 13.0

Subtask #2
10.0 / 10.0

Subtask #3
17.0 / 17.0

Subtask #4
4.0 / 4.0

Subtask #5
0 / 56.0