답안 #63737 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
63737	2018-08-02T16:02:20 Z	zadrga	유괴 2 (JOI17_abduction2)	C++14	44 / 100	2471 ms	176328 KB

abduction2

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF ((int) 1e9)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 50111
#define logn 17

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

ll segd[maxn][logn], segu[maxn][logn], segl[maxn][logn], segr[maxn][logn];
ll a[maxn], b[maxn];
int h, w, q;

map<ll, ll> dp;


ll f(int x, int y, int dir){
	ll id = x * 2 * maxn + 2 * y + dir;
	if(dp[id])
		return dp[id];

//	cout << x << "  " << y << "  " << dir << endl;

	ll cur = 0;
	if(dir == 0){	// left and right
		int l = y - 1;
		int r = y + 1;

		for(int i = logn - 1; i >= 0; i--){
			if(l - (1 << i) + 1 >= 0 && segl[l][i] < a[x])
				l -= (1 << i);

			if(r + (1 << i) - 1 < w && segr[r][i] < a[x])
				r += (1 << i);
		}

		ll left = (l < 0) ? (y) : (abs(l - y) + f(x, l, 1));
		ll right = (r >= w) ? (w - 1 - y) : (abs(r - y) + f(x, r, 1));
		cur = max(left, right);
	}

	if(dir == 1){	// up and down
		int u = x - 1;
		int d = x + 1;

		for(int i = logn - 1; i >= 0; i--){
			if(u - (1 << i) + 1 >= 0 && segu[u][i] < b[y])
				u -= (1 << i);

			if(d + (1 << i) - 1 < h && segd[d][i] < b[y])
				d += (1 << i);
		}

		ll up = (u < 0) ? (x) : (abs(u - x) + f(u, y, 0));
		ll down = (d >= h) ? (h - 1 - x) : (abs(d - x) + f(d, y, 0));
		cur = max(up, down);
	}
	return dp[id] = cur;
}

void precalc(){
	for(int i = 0; i < h; i++)
		segu[i][0] = segd[i][0] = a[i];

	for(int j = 1; j < logn; j++){
		for(int i = 0; i < h; i++){
			if(i + (1 << j) - 1 < h)
				segd[i][j] = max(segd[i][j - 1], segd[i + (1 << (j - 1))][j - 1]);
			
			if(i - (1 << j) + 1 >= 0)
				segu[i][j] = max(segu[i][j - 1], segu[i - (1 << (j - 1))][j - 1]);
		}
	}

	for(int i = 0; i < w; i++)
		segl[i][0] = segr[i][0] = b[i];

	for(int j = 1; j < logn; j++){
		for(int i = 0; i < w; i++){
			if(i + (1 << j) - 1 < w)
				segr[i][j] = max(segr[i][j - 1], segr[i + (1 << (j - 1))][j - 1]);
			
			if(i - (1 << j) + 1 >= 0)
				segl[i][j] = max(segl[i][j - 1], segl[i - (1 << (j - 1))][j - 1]);
		}
	}
}

int main(){
	scanf("%d%d%d", &h, &w, &q);
	for(int i = 0; i < h; i++)
		scanf("%lld", a + i);

	for(int i = 0; i < w; i++)
		scanf("%lld", b + i);

	precalc();

	while(q--){
		int x, y;
		ll ans = 0;
		scanf("%d%d", &x, &y);
		x--; y--;
		for(int i = 0; i < 2; i++)
			ans = max(ans, f(x, y, i));

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

Compilation message

abduction2.cpp: In function 'int main()':
abduction2.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &h, &w, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
abduction2.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", a + i);
   ~~~~~^~~~~~~~~~~~~~~
abduction2.cpp:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", b + i);
   ~~~~~^~~~~~~~~~~~~~~
abduction2.cpp:110:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	492 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	3 ms	624 KB	Output is correct
5	Correct	3 ms	648 KB	Output is correct
6	Correct	3 ms	744 KB	Output is correct
7	Correct	4 ms	744 KB	Output is correct
8	Correct	3 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	764 KB	Output is correct
11	Correct	4 ms	896 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	492 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	3 ms	624 KB	Output is correct
5	Correct	3 ms	648 KB	Output is correct
6	Correct	3 ms	744 KB	Output is correct
7	Correct	4 ms	744 KB	Output is correct
8	Correct	3 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	764 KB	Output is correct
11	Correct	4 ms	896 KB	Output is correct
12	Correct	8 ms	1928 KB	Output is correct
13	Correct	7 ms	2008 KB	Output is correct
14	Correct	6 ms	2064 KB	Output is correct
15	Correct	7 ms	2120 KB	Output is correct
16	Correct	8 ms	2180 KB	Output is correct
17	Correct	6 ms	2336 KB	Output is correct
18	Correct	7 ms	2336 KB	Output is correct
19	Correct	9 ms	2444 KB	Output is correct
20	Correct	9 ms	2608 KB	Output is correct
21	Correct	7 ms	2608 KB	Output is correct
22	Correct	8 ms	2816 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	492 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	3 ms	624 KB	Output is correct
5	Correct	3 ms	648 KB	Output is correct
6	Correct	3 ms	744 KB	Output is correct
7	Correct	4 ms	744 KB	Output is correct
8	Correct	3 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	764 KB	Output is correct
11	Correct	4 ms	896 KB	Output is correct
12	Correct	8 ms	1928 KB	Output is correct
13	Correct	7 ms	2008 KB	Output is correct
14	Correct	6 ms	2064 KB	Output is correct
15	Correct	7 ms	2120 KB	Output is correct
16	Correct	8 ms	2180 KB	Output is correct
17	Correct	6 ms	2336 KB	Output is correct
18	Correct	7 ms	2336 KB	Output is correct
19	Correct	9 ms	2444 KB	Output is correct
20	Correct	9 ms	2608 KB	Output is correct
21	Correct	7 ms	2608 KB	Output is correct
22	Correct	8 ms	2816 KB	Output is correct
23	Correct	116 ms	29800 KB	Output is correct
24	Correct	123 ms	30688 KB	Output is correct
25	Correct	125 ms	31724 KB	Output is correct
26	Correct	113 ms	32716 KB	Output is correct
27	Correct	112 ms	33664 KB	Output is correct
28	Correct	150 ms	39100 KB	Output is correct
29	Correct	140 ms	39100 KB	Output is correct
30	Correct	226 ms	42552 KB	Output is correct
31	Correct	264 ms	45196 KB	Output is correct
32	Correct	99 ms	45196 KB	Output is correct
33	Correct	169 ms	45196 KB	Output is correct

Subtask #4
4.0 / 4.0

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

Subtask #5
0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	492 KB	Output is correct
3	Correct	2 ms	568 KB	Output is correct
4	Correct	3 ms	624 KB	Output is correct
5	Correct	3 ms	648 KB	Output is correct
6	Correct	3 ms	744 KB	Output is correct
7	Correct	4 ms	744 KB	Output is correct
8	Correct	3 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	764 KB	Output is correct
11	Correct	4 ms	896 KB	Output is correct
12	Correct	8 ms	1928 KB	Output is correct
13	Correct	7 ms	2008 KB	Output is correct
14	Correct	6 ms	2064 KB	Output is correct
15	Correct	7 ms	2120 KB	Output is correct
16	Correct	8 ms	2180 KB	Output is correct
17	Correct	6 ms	2336 KB	Output is correct
18	Correct	7 ms	2336 KB	Output is correct
19	Correct	9 ms	2444 KB	Output is correct
20	Correct	9 ms	2608 KB	Output is correct
21	Correct	7 ms	2608 KB	Output is correct
22	Correct	8 ms	2816 KB	Output is correct
23	Correct	116 ms	29800 KB	Output is correct
24	Correct	123 ms	30688 KB	Output is correct
25	Correct	125 ms	31724 KB	Output is correct
26	Correct	113 ms	32716 KB	Output is correct
27	Correct	112 ms	33664 KB	Output is correct
28	Correct	150 ms	39100 KB	Output is correct
29	Correct	140 ms	39100 KB	Output is correct
30	Correct	226 ms	42552 KB	Output is correct
31	Correct	264 ms	45196 KB	Output is correct
32	Correct	99 ms	45196 KB	Output is correct
33	Correct	169 ms	45196 KB	Output is correct
34	Correct	8 ms	45196 KB	Output is correct
35	Correct	7 ms	45196 KB	Output is correct
36	Correct	8 ms	45196 KB	Output is correct
37	Correct	7 ms	45196 KB	Output is correct
38	Correct	7 ms	45196 KB	Output is correct
39	Correct	6 ms	45196 KB	Output is correct
40	Correct	8 ms	45196 KB	Output is correct
41	Correct	9 ms	45196 KB	Output is correct
42	Correct	10 ms	45196 KB	Output is correct
43	Correct	10 ms	45196 KB	Output is correct
44	Correct	13 ms	45196 KB	Output is correct
45	Correct	119 ms	45196 KB	Output is correct
46	Correct	101 ms	45196 KB	Output is correct
47	Correct	85 ms	45196 KB	Output is correct
48	Correct	114 ms	45196 KB	Output is correct
49	Correct	99 ms	45196 KB	Output is correct
50	Correct	144 ms	49940 KB	Output is correct
51	Correct	138 ms	51520 KB	Output is correct
52	Correct	224 ms	57628 KB	Output is correct
53	Correct	275 ms	57696 KB	Output is correct
54	Correct	265 ms	58480 KB	Output is correct
55	Correct	311 ms	64708 KB	Output is correct
56	Incorrect	2471 ms	176328 KB	Output isn't correct
57	Halted	0 ms	0 KB	-

답안 #63737

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