답안 #63741 :: oj.uz

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

abduction2

/*
Idea:
- https://codeforces.com/blog/entry/51010 (abduction 2)
*/

#include <bits/stdc++.h>

using namespace std;

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

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

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

map<ll, ll> dp;


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

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

		for(ll 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
		ll u = x - 1;
		ll d = x + 1;

		for(ll 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(ll i = 0; i < h; i++)
		segu[i][0] = segd[i][0] = a[i];

	for(ll j = 1; j < logn; j++){
		for(ll 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(ll i = 0; i < w; i++)
		segl[i][0] = segr[i][0] = b[i];

	for(ll j = 1; j < logn; j++){
		for(ll 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("%lld%lld%lld", &h, &w, &q);
	for(ll i = 0; i < h; i++)
		scanf("%lld", a + i);

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

	precalc();

	while(q--){
		ll x, y, ans = 0;
		scanf("%lld%lld", &x, &y);
		x--; y--;
		for(ll 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:101:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld", &h, &w, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
abduction2.cpp:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", a + i);
   ~~~~~^~~~~~~~~~~~~~~
abduction2.cpp:106:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", b + i);
   ~~~~~^~~~~~~~~~~~~~~
abduction2.cpp:112:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	3 ms	608 KB	Output is correct
5	Correct	3 ms	660 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	696 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	3 ms	696 KB	Output is correct
10	Correct	4 ms	696 KB	Output is correct
11	Correct	2 ms	744 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	3 ms	608 KB	Output is correct
5	Correct	3 ms	660 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	696 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	3 ms	696 KB	Output is correct
10	Correct	4 ms	696 KB	Output is correct
11	Correct	2 ms	744 KB	Output is correct
12	Correct	5 ms	1660 KB	Output is correct
13	Correct	5 ms	1660 KB	Output is correct
14	Correct	5 ms	1660 KB	Output is correct
15	Correct	5 ms	1676 KB	Output is correct
16	Correct	6 ms	1676 KB	Output is correct
17	Correct	4 ms	1676 KB	Output is correct
18	Correct	5 ms	1796 KB	Output is correct
19	Correct	6 ms	1916 KB	Output is correct
20	Correct	7 ms	1916 KB	Output is correct
21	Correct	6 ms	1916 KB	Output is correct
22	Correct	9 ms	2172 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	3 ms	608 KB	Output is correct
5	Correct	3 ms	660 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	696 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	3 ms	696 KB	Output is correct
10	Correct	4 ms	696 KB	Output is correct
11	Correct	2 ms	744 KB	Output is correct
12	Correct	5 ms	1660 KB	Output is correct
13	Correct	5 ms	1660 KB	Output is correct
14	Correct	5 ms	1660 KB	Output is correct
15	Correct	5 ms	1676 KB	Output is correct
16	Correct	6 ms	1676 KB	Output is correct
17	Correct	4 ms	1676 KB	Output is correct
18	Correct	5 ms	1796 KB	Output is correct
19	Correct	6 ms	1916 KB	Output is correct
20	Correct	7 ms	1916 KB	Output is correct
21	Correct	6 ms	1916 KB	Output is correct
22	Correct	9 ms	2172 KB	Output is correct
23	Correct	87 ms	28156 KB	Output is correct
24	Correct	110 ms	28156 KB	Output is correct
25	Correct	95 ms	28156 KB	Output is correct
26	Correct	98 ms	28156 KB	Output is correct
27	Correct	112 ms	28156 KB	Output is correct
28	Correct	139 ms	32636 KB	Output is correct
29	Correct	86 ms	32636 KB	Output is correct
30	Correct	207 ms	34040 KB	Output is correct
31	Correct	215 ms	35708 KB	Output is correct
32	Correct	86 ms	35708 KB	Output is correct
33	Correct	100 ms	35708 KB	Output is correct

Subtask #4
4.0 / 4.0

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

Subtask #5
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	3 ms	608 KB	Output is correct
5	Correct	3 ms	660 KB	Output is correct
6	Correct	3 ms	660 KB	Output is correct
7	Correct	2 ms	696 KB	Output is correct
8	Correct	3 ms	696 KB	Output is correct
9	Correct	3 ms	696 KB	Output is correct
10	Correct	4 ms	696 KB	Output is correct
11	Correct	2 ms	744 KB	Output is correct
12	Correct	5 ms	1660 KB	Output is correct
13	Correct	5 ms	1660 KB	Output is correct
14	Correct	5 ms	1660 KB	Output is correct
15	Correct	5 ms	1676 KB	Output is correct
16	Correct	6 ms	1676 KB	Output is correct
17	Correct	4 ms	1676 KB	Output is correct
18	Correct	5 ms	1796 KB	Output is correct
19	Correct	6 ms	1916 KB	Output is correct
20	Correct	7 ms	1916 KB	Output is correct
21	Correct	6 ms	1916 KB	Output is correct
22	Correct	9 ms	2172 KB	Output is correct
23	Correct	87 ms	28156 KB	Output is correct
24	Correct	110 ms	28156 KB	Output is correct
25	Correct	95 ms	28156 KB	Output is correct
26	Correct	98 ms	28156 KB	Output is correct
27	Correct	112 ms	28156 KB	Output is correct
28	Correct	139 ms	32636 KB	Output is correct
29	Correct	86 ms	32636 KB	Output is correct
30	Correct	207 ms	34040 KB	Output is correct
31	Correct	215 ms	35708 KB	Output is correct
32	Correct	86 ms	35708 KB	Output is correct
33	Correct	100 ms	35708 KB	Output is correct
34	Correct	7 ms	35708 KB	Output is correct
35	Correct	7 ms	35708 KB	Output is correct
36	Correct	5 ms	35708 KB	Output is correct
37	Correct	8 ms	35708 KB	Output is correct
38	Correct	6 ms	35708 KB	Output is correct
39	Correct	6 ms	35708 KB	Output is correct
40	Correct	6 ms	35708 KB	Output is correct
41	Correct	9 ms	35708 KB	Output is correct
42	Correct	12 ms	35708 KB	Output is correct
43	Correct	9 ms	35708 KB	Output is correct
44	Correct	9 ms	35708 KB	Output is correct
45	Correct	73 ms	35708 KB	Output is correct
46	Correct	70 ms	35708 KB	Output is correct
47	Correct	99 ms	35708 KB	Output is correct
48	Correct	71 ms	35708 KB	Output is correct
49	Correct	110 ms	35708 KB	Output is correct
50	Correct	136 ms	35708 KB	Output is correct
51	Correct	152 ms	35708 KB	Output is correct
52	Correct	251 ms	38140 KB	Output is correct
53	Correct	215 ms	38140 KB	Output is correct
54	Correct	250 ms	38140 KB	Output is correct
55	Correct	415 ms	42236 KB	Output is correct
56	Correct	2178 ms	153420 KB	Output is correct
57	Correct	580 ms	153420 KB	Output is correct
58	Correct	486 ms	153420 KB	Output is correct
59	Correct	539 ms	153420 KB	Output is correct

답안 #63741

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 56.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
56.0 / 56.0