Submission #8804831

---

Source Code Expand

#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
using namespace std;
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define DUMP(...)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define MAXN 640000
//----//
struct edge {
  int from, to;
};
char A[800][800];
// edge G[(640000 * 4)];
int H, W, K, S;

int d[MAXN];
int d2[MAXN];
vector<int> G[MAXN];
bool visited[MAXN];
struct Idcost {
  int id, cost;
};
queue<Idcost> q;
void bfs() {
  fill(d, d + H * W, INF);
  Idcost start = {S, 0};
  q.push(start);
  while (!q.empty()) {
    Idcost now = q.front();
    d[now.id] = now.cost;
    visited[now.id] = true;
    q.pop();
    /*if (now.id == T) {
      return now.cost;
    }*/
    for (auto x : G[now.id]) {
      Idcost next = {x, now.cost + 1};
      if (!visited[x]) {
        //        DUMP(x, now.cost + 1);
        q.push(next);
      }
    }
  }
  return;
}

signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  cin >> H >> W >> K;
  REP(i, H) REP(j, W) {
    cin >> A[i][j];
    if (A[i][j] == 'S') S = i * W + j;
  }

  REP(i, H) {
    REP(j, W - 1) {
      if (A[i][j] != '#' && A[i][j + 1] != '#') {
        int addr = i * W + j;
        G[addr].pb(addr + 1);
        G[addr + 1].pb(addr);
      }
    }
  }
  REP(i, W) {
    REP(j, H - 1) {
      if (A[j][i] != '#' && A[j + 1][i] != '#') {
        int addr = j * W + i;
        G[addr].pb(addr + W);
        G[addr + W].pb(addr);
      }
    }
  }
  // DUMP(S);
  bfs();
  fill(d2, d2 + H * W, INF);
  REP(i, H) REP(j, W) {
    int val = min({i, H - 1 - i, j, W - 1 - j});
    d2[i * W + j] = (val + K - 1) / K;
  }
  int ans = INF;
  REP(i, H) REP(j, W) {
    if (d[i * W + j] <= K) chmin(ans, 1 + d2[i * W + j]);
  }
  print(ans);
  //  REP(i, H * W) DUMP(i, d[i]);
}

Submission Info

Judge Result