oj.uz

Submission #570595

# Submission time Handle Problem Language Result Execution time Memory
570595 2022-05-30T15:37:49 Z iancu Abduction 2 (JOI17_abduction2) C++14
44 / 100
 5000 ms 9924 KB 
#include <bits/stdc++.h>

#define NORTH 0
#define SOUTH 1
#define EAST  2
#define WEST  3

using namespace std;

const int N = 5e4 + 5;

struct Node {
  int x, y;
  int val;
  int dir;
  long long dist;

  bool operator<(const Node& n) const {
    return val > n.val;
    //return make_tuple(x, y, dir) < make_tuple(n.x, n.y, n.dir);
  }
};

struct Hasher
{
  long long operator() (const Node& n) const
  {
      return n.dir ^ n.val ^ n.x ^ n.y;
  }
};
struct EqualFn
{
  bool operator() (const Node& n1, const Node& n2) const
  {
    return (n1.x == n2.x) && (n1.y == n2.y) && (n1.val == n2.val) && (n1.dir == n2.dir);
  }
};
struct Hasher2
{
  size_t operator() (const pair<int, int>& v) const
  {
      size_t h = (size_t(v.first)<<32)+size_t(v.second);
      h*=1231231557ull; // "random" uneven integer
      h^=(h>>32);
      return h;
  }
};

int h, w;
int a[N], b[N];

long long solve(int x, int y, int dir) {
  vector<int> nxt0(w + h + 1, 0);
  vector<int> nxt1(w + h + 1, 0);
  vector<int> nxt2(w + h + 1, 0);
  vector<int> nxt3(w + h + 1, 0);
  unordered_map<pair<int, int>, long long, Hasher2> dp;
  int hl, hr, wl, wr;
  long long ans = 0;
  hl = hr = x;
  wl = wr = y;
  if (dir == 0) hl = max(hl - 1, 1);
  else if (dir == 1) hr = min(hr + 1, h);
  else if (dir == 2) wr = min(wr + 1, w);
  else wl = max(wl - 1, 1);
  priority_queue<Node> pq;
  pq.push({x, y, 0, dir, 0});
  while (!pq.empty()) {
    auto n = pq.top();
    //cout << n.x << " " << n.y << " " << n.dir << " " << n.dist << endl;
    pq.pop();
    ans = max(ans, n.dist);

    if (n.dir == NORTH && n.x == 1)
      continue;
    if (n.dir == SOUTH && n.x == h)
      continue;
    if (n.dir == EAST  && n.y == w)
      continue;
    if (n.dir == WEST  && n.y == 1)
      continue;

    if (n.dir == NORTH) {
      if (nxt0[n.y] != 0) {
      } else {
          while (hl > 1 && a[hl] <= b[n.y])
            --hl;
          if (a[hl] <= b[n.y]) {
            ans = max(ans, n.dist + n.x - hl);
            continue;
          }
          nxt0[n.y] = hl;
      }
      pair<int, int> urm = {nxt0[n.y], n.y};
      if (dp[urm] >= n.dist + n.x - urm.first)
        continue;
      dp[urm] = n.dist + n.x - urm.first;
      pq.push({urm.first, urm.second, a[urm.first], WEST, n.dist + n.x - urm.first});
      pq.push({urm.first, urm.second, a[urm.first], EAST, n.dist + n.x - urm.first});
    } else if (n.dir == SOUTH) {
      if (nxt1[n.y] == 0) {
        while (hr < h && a[hr] <= b[n.y])
          ++hr;
        if (a[hr] <= b[n.y]) {
          ans = max(ans, n.dist + hr - n.x);
          continue;
        }
        nxt1[n.y] = hr;
      }
      pair<int, int> urm = {nxt1[n.y], n.y};
      if (dp[urm] >= n.dist + urm.first - n.x)
        continue;
      dp[urm] = n.dist + urm.first - n.x;
      pq.push({urm.first, urm.second, a[urm.first], WEST, n.dist + urm.first - n.x});
      pq.push({urm.first, urm.second, a[urm.first], EAST, n.dist + urm.first - n.x});
    } else if (n.dir == EAST) {
      if (nxt2[n.x] == 0) {
        while (wr < w && b[wr] <= a[n.x])
          ++wr;
        if (b[wr] <= a[n.x]) {
          ans = max(ans, n.dist + wr - n.y);
          continue;
        }
        nxt2[n.x] = wr;
      }
      pair<int, int> urm = {n.x, nxt2[n.x]};
      if (dp[urm] >= n.dist + urm.second - n.y)
        continue;
      dp[urm] = n.dist + urm.second - n.y;
      pq.push({urm.first, urm.second, b[urm.second], NORTH, n.dist + urm.second - n.y});
      pq.push({urm.first, urm.second, b[urm.second], SOUTH, n.dist + urm.second - n.y});
    } else {
      if (nxt3[n.x] == 0) {
        while (wl > 1 && b[wl] <= a[n.x])
          --wl;
        if (b[wl] <= a[n.x]) {
          ans = max(ans, n.dist + n.y - wl);
          continue;
        }
        nxt3[n.x] = wl;
      }
      pair<int, int> urm = {n.x, nxt3[n.x]};
      if (dp[urm] >= n.dist + n.y - urm.second)
        continue;
      dp[urm] = n.dist + n.y - urm.second;
      pq.push({urm.first, urm.second, b[urm.second], NORTH, n.dist + n.y - urm.second});
      pq.push({urm.first, urm.second, b[urm.second], SOUTH, n.dist + n.y - urm.second});
    }
  }
  return ans;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  int q;
  cin >> h >> w >> q;
  for (int i = 1; i <= h; ++i)
    cin >> a[i];
  for (int i = 1; i <= w; ++i)
    cin >> b[i];
  while (q--) {
    int x, y;
    cin >> x >> y;
    long long ans = 0;
    for (int i = 0; i < 4; ++i)
      ans = max(ans, solve(x, y, i));
    cout << ans << "\n";
  }
  return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 7 ms 596 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 12 ms 736 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 7 ms 596 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 12 ms 736 KB Output is correct
23 Correct 11 ms 2260 KB Output is correct
24 Correct 12 ms 2204 KB Output is correct
25 Correct 16 ms 2288 KB Output is correct
26 Correct 13 ms 2216 KB Output is correct
27 Correct 13 ms 2236 KB Output is correct
28 Correct 38 ms 4148 KB Output is correct
29 Correct 14 ms 2528 KB Output is correct
30 Correct 171 ms 6520 KB Output is correct
31 Correct 293 ms 8296 KB Output is correct
32 Correct 21 ms 2516 KB Output is correct
33 Correct 61 ms 3712 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 51 ms 504 KB Output is correct
7 Correct 59 ms 496 KB Output is correct
8 Correct 360 ms 740 KB Output is correct
9 Correct 367 ms 836 KB Output is correct
10 Correct 410 ms 888 KB Output is correct
11 Correct 673 ms 972 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 7 ms 596 KB Output is correct
21 Correct 6 ms 468 KB Output is correct
22 Correct 12 ms 736 KB Output is correct
23 Correct 11 ms 2260 KB Output is correct
24 Correct 12 ms 2204 KB Output is correct
25 Correct 16 ms 2288 KB Output is correct
26 Correct 13 ms 2216 KB Output is correct
27 Correct 13 ms 2236 KB Output is correct
28 Correct 38 ms 4148 KB Output is correct
29 Correct 14 ms 2528 KB Output is correct
30 Correct 171 ms 6520 KB Output is correct
31 Correct 293 ms 8296 KB Output is correct
32 Correct 21 ms 2516 KB Output is correct
33 Correct 61 ms 3712 KB Output is correct
34 Correct 8 ms 340 KB Output is correct
35 Correct 6 ms 340 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 7 ms 340 KB Output is correct
38 Correct 6 ms 340 KB Output is correct
39 Correct 51 ms 504 KB Output is correct
40 Correct 59 ms 496 KB Output is correct
41 Correct 360 ms 740 KB Output is correct
42 Correct 367 ms 836 KB Output is correct
43 Correct 410 ms 888 KB Output is correct
44 Correct 673 ms 972 KB Output is correct
45 Correct 51 ms 2332 KB Output is correct
46 Correct 51 ms 2260 KB Output is correct
47 Correct 53 ms 2304 KB Output is correct
48 Correct 55 ms 2396 KB Output is correct
49 Correct 53 ms 2388 KB Output is correct
50 Correct 1342 ms 5300 KB Output is correct
51 Correct 1199 ms 5308 KB Output is correct
52 Execution timed out 5054 ms 9924 KB Time limit exceeded
53 Halted 0 ms 0 KB -