제출 #925844

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
925844	2024-02-12 09:56:15	mickey080929	유괴 2 (JOI17_abduction2)	C++17	13 / 100	5043 ms	8792 KiB

abduction2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll H, W, Q;
ll mxl[50010][16], mxr[50010][16], mxu[50010][16], mxd[50010][16];
ll A[50010], B[50010];
ll dfs(ll x, ll y, ll dir) {
  ll cur = 0;
  if (dir == 0) {
    ll u = x - 1, d = x + 1;
    for (ll 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 {
    ll l = y - 1, r = y + 1; 
    for (ll 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])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 0 / 10
• Subtask 3: 0 / 17
• Subtask 4: 0 / 4
• Subtask 5: 0 / 56