第二个点RE 90pts求助

#include <bits/stdc++.h>
using namespace std;

int h, w, d, r, a[1010][1010], v[1010][1010][2], ans = INT_MAX;
struct state {
  int x, y, u, s;
};
queue<state> q;
string s;

void push(int x, int y, int u, int s) {
  if (!a[x][y] || v[x][y][u] || x < 1 || x > h || y < 1 || y > w)
    return;
  q.push(state{x, y, u, s});
  v[x][y][u] = true;
  if (x == h && y == w)
    ans = min(ans, s);
}

int main() {
  cin >> h >> w >> d >> r;
  for (int i = 1; i <= h; i++) {
    cin >> s;
    for (int j = 1; j <= w; j++)
      if (s[j - 1] == '.')
        a[i][j] = true;
  }
  push(1, 1, 0, 0);
  while (!q.empty()) {
    int x = q.front().x, y = q.front().y, u = q.front().u, s = q.front().s;
    q.pop();
    if (u == 0)
      push(x + d, y + r, 1, s + 1);
    push(x + 1, y, u, s + 1);
    push(x - 1, y, u, s + 1);
    push(x, y + 1, u, s + 1);
    push(x, y - 1, u, s + 1);
  }
  if (ans == INT_MAX)
    cout << "-1\n";
  else
    cout << ans << endl;
  return 0;
}