Problem p02644 (C++) — buggy submission, verdict: Time Limit Exceeded

#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\\n";
    }
  }
  return false;
}
void print() { cout << "\\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void Pr(bool f) {
  cout << (f ? "Yes" : "No") << "\\n";
  exit(0);
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll h, w, k;
  cin >> h >> w >> k;
  ll x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  x1--;
  y1--;
  x2--;
  y2--;
  vs s(h);
  rep(i, h) { cin >> s[i]; }
  int di[4] = {1, -1, 0, 0};
  int dj[4] = {0, 0, 1, -1};
  vvi visited(h, vi(w, -1));
  auto bfs = [&](int si, int sj) -> void {
    queue<tuple<int, int, int>> q;
    q.emplace(si, sj, 0);
    visited[si][sj] = 0;
    while (q.size()) {
      auto fr = q.front();
      dump(fr);
      if (get<0>(fr) == x2 && get<1>(fr) == y2) {
        print(get<2>(fr));
        exit(0);
      }
      q.pop();
      rep(kk, 4) {
        repr(m, 1, k + 1) {
          int ni = get<0>(fr) + m * di[kk];
          int nj = get<1>(fr) + m * dj[kk];
          if (ni < 0 || ni >= h || nj < 0 || nj >= w)
            break;
          if (s[ni][nj] == '.' && visited[ni][nj] == -1) {
            visited[ni][nj] = get<2>(fr) + 1;
            q.emplace(ni, nj, get<2>(fr) + 1);
          } else if (s[ni][nj] == '@' || visited[ni][nj] < get<2>(fr) + 1) {
            break;
          }
        }
      }
    }
    print(-1);
    exit(0);
  };
  bfs(x1, y1);
}


Error: TLE

Fixed submission:

#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\\n";
    }
  }
  return false;
}
void print() { cout << "\\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void Pr(bool f) {
  cout << (f ? "Yes" : "No") << "\\n";
  exit(0);
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll h, w, k;
  cin >> h >> w >> k;
  ll x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  x1--;
  y1--;
  x2--;
  y2--;
  vs s(h);
  rep(i, h) { cin >> s[i]; }
  int di[4] = {1, -1, 0, 0};
  int dj[4] = {0, 0, 1, -1};
  vvi visited(h, vi(w, 0));
  auto bfs = [&](int si, int sj) -> void {
    queue<tuple<int, int, int>> q;
    q.emplace(si, sj, 0);
    visited[si][sj] = 1;
    while (q.size()) {
      auto fr = q.front();
      dump(fr);
      if (get<0>(fr) == x2 && get<1>(fr) == y2) {
        print(get<2>(fr));
        exit(0);
      }
      q.pop();
      rep(kk, 4) {
        repr(m, 1, k + 1) {
          int ni = get<0>(fr) + m * di[kk];
          int nj = get<1>(fr) + m * dj[kk];
          if (ni < 0 || ni >= h || nj < 0 || nj >= w)
            break;
          if (s[ni][nj] == '.' && !visited[ni][nj]) {
            visited[ni][nj] = 1;
            q.emplace(ni, nj, get<2>(fr) + 1);
          } else if (s[ni][nj] == '@') {
            break;
          }
        }
      }
    }
    print(-1);
    exit(0);
  };
  bfs(x1, y1);
}