oj.uz

답안 #883215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
883215 2023-12-04T19:42:13 Z MilosMilutinovic 유괴 2 (JOI17_abduction2) C++14
44 / 100
 4731 ms 39328 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w, q;
  cin >> h >> w >> q;
  vector<int> a(h);
  for (int i = 0; i < h; i++) {
    cin >> a[i];
  }
  vector<int> b(w);
  for (int i = 0; i < w; i++) {
    cin >> b[i];
  }
  const int L = 20;
  vector<vector<int>> maxa(h, vector<int>(L));
  vector<vector<int>> maxb(w, vector<int>(L));
  for (int i = 0; i < h; i++) {
    maxa[i][0] = a[i];
  }
  for (int i = 0; i < w; i++) {
    maxb[i][0] = b[i];
  }
  for (int j = 1; j < L; j++) {
    for (int i = 0; i + (1 << j) <= h; i++) {
      maxa[i][j] = max(maxa[i][j - 1], maxa[i + (1 << (j - 1))][j - 1]);
    }
  }
  for (int j = 1; j < L; j++) {
    for (int i = 0; i + (1 << j) <= w; i++) {
      maxb[i][j] = max(maxb[i][j - 1], maxb[i + (1 << (j - 1))][j - 1]);
    }
  }
  vector<int> logs(max(h, w) + 1);
  for (int i = 2; i <= max(h, w); i++) {
    logs[i] = logs[i >> 1] + 1;
  }
  auto MaxA = [&](int L, int R) {
    int k = logs[R - L + 1];
    return max(maxa[L][k], maxa[R - (1 << k) + 1][k]);
  };
  auto MaxB = [&](int L, int R) {
    int k = logs[R - L + 1];
    return max(maxb[L][k], maxb[R - (1 << k) + 1][k]);
  };
  auto Go = [&](int x, int y, int dir) {
    if (dir == 0) {
      // up
      if (x == 0) {
        return make_pair(x, y);
      }
      x--;
      {
        if (MaxA(0, x) < b[y]) {
          return make_pair(0, y);
        }
        int low = 0, high = x, pos = x;
        while (low <= high) {
          int mid = low + high >> 1;
          if (MaxA(mid, x) >= b[y]) {
            pos = mid;
            low = mid + 1;
          } else {
            high = mid - 1;
          }
        }
        return make_pair(pos, y);
      }
      /* while (x > 0 && a[x] < b[y]) {
        x -= 1;
      }
      return make_pair(x, y); */
    }
    if (dir == 1) {
      // down
      if (x == h - 1) {
        return make_pair(x, y);
      }
      x += 1;
      {
        if (MaxA(x, h - 1) < b[y]) {
          return make_pair(h - 1, y);
        }
        int low = x, high = h - 1, pos = h - 1;
        while (low <= high) {
          int mid = low + high >> 1;
          if (MaxA(x, mid) >= b[y]) {
            pos = mid;
            high = mid - 1;
          } else {
            low = mid + 1;
          }
        }
        return make_pair(pos, y);
      } 
      /* while (x + 1 < h && a[x] < b[y]) {
        x += 1;
      }
      return make_pair(x, y); */
    }
    if (dir == 2) {
      // left
      if (y == 0) {
        return make_pair(x, y);
      }
      y -= 1;
      {
        if (MaxB(0, y) < a[x]) {
          return make_pair(x, 0);
        }
        int low = 0, high = y, pos = y;
        while (low <= high) {
          int mid = low + high >> 1;
          if (MaxB(mid, y) >= a[x]) {
            pos = mid;
            low = mid + 1;
          } else {
            high = mid - 1;
          }
        }
        return make_pair(x, pos);
      } 
      /* while (y > 0 && a[x] > b[y]) {
        y -= 1;
      }
      return make_pair(x, y); */
    }
    if (dir == 3) {
      // right
      if (y == w - 1) {
        return make_pair(x, y);
      }
      y += 1;
      {
        if (MaxB(y, w - 1) < a[x]) {
          return make_pair(x, w - 1);
        }
        int low = y, high = w - 1, pos = y;
        while (low <= high) {
          int mid = low + high >> 1;
          if (MaxB(y, mid) >= a[x]) {
            pos = mid;
            high = mid - 1;
          } else {
            low = mid + 1;
          }
        }
        return make_pair(x, pos);
      } 
      /* while (y + 1 < w && a[x] > b[y]) {
        y += 1;
      }
      return make_pair(x, y); */
    }
    assert(false);
    return make_pair(-1, -1);
  };
  vector<unordered_map<int, bool>> was(4);
  vector<unordered_map<int, int>> dp(4);
  function<int(int, int, int)> Solve = [&](int x, int y, int dir) {
    if (dir == 0) {
      if (a[x] < b[y]) {
        return 0;
      }
    }
    if (dir == 1) {
      if (a[x] < b[y]) {
        return 0;
      }
    }
    if (dir == 2) {
      if (a[x] > b[y]) {
        return 0;
      }
    }
    if (dir == 3) {
      if (a[x] > b[y]) {
        return 0;
      }
    }
    int curr = x * w + y;
    if (was[dir][curr]) {
      return dp[dir][curr];
    }
    was[dir][curr] = true;
    if (dir == 0 || dir == 1) {
      {
        pair<int, int> nxt = Go(x, y, 2);
        if (nxt.first != x || nxt.second != y) {
          dp[dir][curr] = max(dp[dir][curr], Solve(nxt.first, nxt.second, 2) + abs(nxt.first - x) + abs(nxt.second - y));
        }
      }
      {
        pair<int, int> nxt = Go(x, y, 3);
        if (nxt.first != x || nxt.second != y) {
          dp[dir][curr] = max(dp[dir][curr], Solve(nxt.first, nxt.second, 3) + abs(nxt.first - x) + abs(nxt.second - y));
        }
      }
    } 
    if (dir == 2 || dir == 3) {
      {
        pair<int, int> nxt = Go(x, y, 0);
        if (nxt.first != x || nxt.second != y) {
          dp[dir][curr] = max(dp[dir][curr], Solve(nxt.first, nxt.second, 0) + abs(nxt.first - x) + abs(nxt.second - y));
        }
      }
      {
        pair<int, int> nxt = Go(x, y, 1);
        if (nxt.first != x || nxt.second != y) {
          dp[dir][curr] = max(dp[dir][curr], Solve(nxt.first, nxt.second, 1) + abs(nxt.first - x) + abs(nxt.second - y));
        }
      }
    }
    return dp[dir][curr];
  };
  while (q--) {
    int x, y;
    cin >> x >> y;
    --x; --y;
    int res = 1;
    for (int dir = 0; dir < 4; dir++) {
      pair<int, int> cell = Go(x, y, dir);
      int nx = cell.first;
      int ny = cell.second;
      if (nx != x || ny != y) {
        res = max(res, Solve(nx, ny, dir) + abs(x - nx) + abs(y - ny));
      }
    }
    cout << res << '\n';
    for (int dir = 0; dir < 4; dir++) {
      was[dir].clear();
      dp[dir].clear();
    }
  }
  return 0;
}

Compilation message

abduction2.cpp: In lambda function:
abduction2.cpp:62:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~
abduction2.cpp:89:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~
abduction2.cpp:116:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  116 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~
abduction2.cpp:143:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  143 |           int mid = low + high >> 1;
      |                     ~~~~^~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 18 ms 12632 KB Output is correct
24 Correct 19 ms 12748 KB Output is correct
25 Correct 18 ms 12632 KB Output is correct
26 Correct 18 ms 12636 KB Output is correct
27 Correct 19 ms 12636 KB Output is correct
28 Correct 35 ms 20572 KB Output is correct
29 Correct 20 ms 13656 KB Output is correct
30 Correct 65 ms 21332 KB Output is correct
31 Correct 89 ms 24640 KB Output is correct
32 Correct 21 ms 12892 KB Output is correct
33 Correct 30 ms 15704 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 952 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 856 KB Output is correct
6 Correct 13 ms 1368 KB Output is correct
7 Correct 11 ms 1372 KB Output is correct
8 Correct 51 ms 1616 KB Output is correct
9 Correct 63 ms 1596 KB Output is correct
10 Correct 58 ms 1372 KB Output is correct
11 Correct 78 ms 1844 KB Output is correct

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 2 ms 1116 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 18 ms 12632 KB Output is correct
24 Correct 19 ms 12748 KB Output is correct
25 Correct 18 ms 12632 KB Output is correct
26 Correct 18 ms 12636 KB Output is correct
27 Correct 19 ms 12636 KB Output is correct
28 Correct 35 ms 20572 KB Output is correct
29 Correct 20 ms 13656 KB Output is correct
30 Correct 65 ms 21332 KB Output is correct
31 Correct 89 ms 24640 KB Output is correct
32 Correct 21 ms 12892 KB Output is correct
33 Correct 30 ms 15704 KB Output is correct
34 Correct 2 ms 856 KB Output is correct
35 Correct 2 ms 860 KB Output is correct
36 Correct 2 ms 952 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 856 KB Output is correct
39 Correct 13 ms 1368 KB Output is correct
40 Correct 11 ms 1372 KB Output is correct
41 Correct 51 ms 1616 KB Output is correct
42 Correct 63 ms 1596 KB Output is correct
43 Correct 58 ms 1372 KB Output is correct
44 Correct 78 ms 1844 KB Output is correct
45 Correct 22 ms 12632 KB Output is correct
46 Correct 22 ms 12692 KB Output is correct
47 Correct 21 ms 12636 KB Output is correct
48 Correct 21 ms 12624 KB Output is correct
49 Correct 22 ms 12636 KB Output is correct
50 Correct 697 ms 23800 KB Output is correct
51 Correct 538 ms 24324 KB Output is correct
52 Correct 3493 ms 29252 KB Output is correct
53 Correct 3408 ms 29612 KB Output is correct
54 Correct 3242 ms 28716 KB Output is correct
55 Incorrect 4731 ms 39328 KB Output isn't correct
56 Halted 0 ms 0 KB -