#595969 (C++17) No.1323 うしらずSwap

提出ソース

結果

問題	No.1323 うしらずSwap
ユーザー	NyaanNyaan
提出日時	2020-12-20 23:57:28
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	1,243 ms / 3,000 ms
コード長	14,567 bytes
コンパイル時間	4,634 ms
コンパイル使用メモリ	281,820 KB
実行使用メモリ	143,168 KB
最終ジャッジ日時	2023-08-09 14:00:54
合計ジャッジ時間	31,331 ms
ジャッジサーバーID （参考情報）	judge11 / judge15

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,384 KB
testcase_02	AC	1 ms 4,384 KB
testcase_03	AC	2 ms 4,384 KB
testcase_04	AC	2 ms 4,384 KB
testcase_05	AC	2 ms 4,380 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	1 ms 4,380 KB
testcase_08	AC	2 ms 4,384 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	1 ms 4,380 KB
testcase_11	AC	1 ms 4,384 KB
testcase_12	AC	1 ms 4,380 KB
testcase_13	AC	1 ms 4,380 KB
testcase_14	AC	1 ms 4,384 KB
testcase_15	AC	2 ms 4,380 KB
testcase_16	AC	189 ms 115,772 KB
testcase_17	AC	697 ms 115,760 KB
testcase_18	AC	192 ms 115,680 KB
testcase_19	AC	686 ms 115,676 KB
testcase_20	AC	190 ms 115,676 KB
testcase_21	AC	315 ms 115,640 KB
testcase_22	AC	1,108 ms 115,888 KB
testcase_23	AC	316 ms 115,668 KB
testcase_24	AC	1,058 ms 115,780 KB
testcase_25	AC	313 ms 115,500 KB
testcase_26	AC	268 ms 116,872 KB
testcase_27	AC	248 ms 118,044 KB
testcase_28	AC	459 ms 115,672 KB
testcase_29	AC	264 ms 115,948 KB
testcase_30	AC	570 ms 115,784 KB
testcase_31	AC	265 ms 115,668 KB
testcase_32	AC	692 ms 115,816 KB
testcase_33	AC	853 ms 128,348 KB
testcase_34	AC	947 ms 133,516 KB
testcase_35	AC	1,029 ms 136,024 KB
testcase_36	AC	948 ms 137,856 KB
testcase_37	AC	962 ms 138,616 KB
testcase_38	AC	1,172 ms 141,784 KB
testcase_39	AC	1,165 ms 142,432 KB
testcase_40	AC	1,214 ms 142,888 KB
testcase_41	AC	1,243 ms 143,168 KB
testcase_42	AC	1,054 ms 142,888 KB
testcase_43	AC	149 ms 99,376 KB
testcase_44	AC	400 ms 101,612 KB
testcase_45	AC	270 ms 106,808 KB
testcase_46	AC	404 ms 101,668 KB
testcase_47	AC	182 ms 102,128 KB
testcase_48	AC	218 ms 99,328 KB
testcase_49	AC	538 ms 101,684 KB
testcase_50	AC	194 ms 97,200 KB
testcase_51	AC	85 ms 88,556 KB
testcase_52	AC	128 ms 92,952 KB
testcase_53	AC	561 ms 101,896 KB
testcase_54	AC	129 ms 92,904 KB
testcase_55	AC	547 ms 101,632 KB
testcase_56	AC	99 ms 91,040 KB
testcase_57	AC	726 ms 106,736 KB
testcase_58	AC	3 ms 4,384 KB
testcase_59	AC	2 ms 4,380 KB
testcase_60	AC	2 ms 4,380 KB
testcase_61	AC	2 ms 4,380 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 *  date : 2020-12-20 23:57:18
 */

#define NDEBUG
using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>

// utility
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  T &x() { return first; }
  const T &x() const { return first; }
  U &y() { return second; }
  const U &y() const { return second; }

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}
template <typename T, size_t N>
void mem(T (&a)[N], int c) {
  memset(a, c, sizeof(T) * N);
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<T> reord(const vector<T> &v, const vector<T> &ord) {
  int N = v.size();
  vector<T> ret(N);
  for (int i = 0; i < N; i++) ret[i] = v[ord[i]];
  return ret;
};

template <typename T = int>
vector<T> mkiota(int N) {
  vector<T> ret(N);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
vector<int> mkinv(vector<T> &v, int max_val = -1) {
  if (max_val < (int)v.size()) max_val = v.size() - 1;
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

}  // namespace Nyaan

// bit operation
namespace Nyaan {

__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}

__attribute__((target("bmi"))) inline int lsb(const u64 &a) {
  return _tzcnt_u64(a);
}
__attribute__((target("bmi"))) inline int ctz(const u64 &a) {
  return _tzcnt_u64(a);
}

__attribute__((target("lzcnt"))) inline int msb(const u64 &a) {
  return 63 - _lzcnt_u64(a);
}
__attribute__((target("lzcnt"))) inline int clz64(const u64 &a) {
  return _lzcnt_u64(a);
}

template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  a ^= (gbit(a, i) == b ? 0 : (T(b) << i));
}

constexpr long long PW(int n) { return 1LL << n; }

constexpr long long MSK(int n) { return (1LL << n) - 1; }

}  // namespace Nyaan

// inout
namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

void outr() {}
template <typename T, class... U, char sep = ' '>
void outr(const T &t, const U &... u) {
  cout << t;
  outr(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan

// debug
namespace DebugImpl {

template <typename U, typename = void>
struct is_specialize : false_type {};
template <typename U>
struct is_specialize<
    U, typename conditional<false, typename U::iterator, void>::type>
    : true_type {};
template <typename U>
struct is_specialize<
    U, typename conditional<false, decltype(U::first), void>::type>
    : true_type {};
template <typename U>
struct is_specialize<U, enable_if_t<is_integral<U>::value, void>> : true_type {
};

void dump(const char& t) { cerr << t; }

void dump(const string& t) { cerr << t; }

template <typename U,
          enable_if_t<!is_specialize<U>::value, nullptr_t> = nullptr>
void dump(const U& t) {
  cerr << t;
}

template <typename T>
void dump(const T& t, enable_if_t<is_integral<T>::value>* = nullptr) {
  string res;
  if (t == Nyaan::inf) res = "inf";
  if (is_signed<T>::value)
    if (t == -Nyaan::inf) res = "-inf";
  if (sizeof(T) == 8) {
    if (t == Nyaan::infLL) res = "inf";
    if (is_signed<T>::value)
      if (t == -Nyaan::infLL) res = "-inf";
  }
  if (res.empty()) res = to_string(t);
  cerr << res;
}

template <typename T, typename U>
void dump(const pair<T, U>&);
template <typename T>
void dump(const pair<T*, int>&);

template <typename T>
void dump(const T& t,
          enable_if_t<!is_void<typename T::iterator>::value>* = nullptr) {
  cerr << "[ ";
  for (auto it = t.begin(); it != t.end();) {
    dump(*it);
    cerr << (++it == t.end() ? "" : ", ");
  }
  cerr << " ]";
}

template <typename T, typename U>
void dump(const pair<T, U>& t) {
  cerr << "( ";
  dump(t.first);
  cerr << ", ";
  dump(t.second);
  cerr << " )";
}

template <typename T>
void dump(const pair<T*, int>& t) {
  cerr << "[ ";
  for (int i = 0; i < t.second; i++) {
    dump(t.first[i]);
    cerr << (i == t.second - 1 ? "" : ", ");
  }
  cerr << " ]";
}

void trace() { cerr << endl; }
template <typename Head, typename... Tail>
void trace(Head&& head, Tail&&... tail) {
  cerr << " ";
  dump(head);
  if (sizeof...(tail) != 0) cerr << ",";
  trace(forward<Tail>(tail)...);
}

}  // namespace DebugImpl

#ifdef NyaanDebug
#define trc(...)                            \
  do {                                      \
    cerr << "## " << #__VA_ARGS__ << " = "; \
    DebugImpl::trace(__VA_ARGS__);          \
  } while (0)
#else
#define trc(...)
#endif

// macro
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define repc(i, a, cond) for (long long i = (a); (cond); i++)
#define enm(i, val, vec)                                  \
  for (long long i = 0; i < (long long)(vec).size(); i++) \
    if (auto& val = vec[i]; false)                        \
      ;                                                   \
    else

#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }

#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)

namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }


using namespace Nyaan;


vector<pair<int, int>> bfs_restore(vector<vector<int>>& g, int st = 0) {
  vector<pair<int, int>> d(g.size(), make_pair(-1, -1));
  d[st] = make_pair(0, -1);
  queue<int> Q;
  Q.push(st);
  while (!Q.empty()) {
    int cur = Q.front();
    Q.pop();
    int cd = d[cur].first;
    for (auto&& dst : g[cur]) {
      if (d[dst].first == -1) {
        d[dst].first = cd + 1;
        d[dst].second = cur;
        Q.push(dst);
      }
    }
  }
  return d;
}

void Nyaan::solve() {
  ini(H, W);
  ini(ra, ca, rb, cb);
  ra--, ca--, rb--, cb--;
  vs gr(H);
  in(gr);
  auto idx = [&](int i, int j) { return i * W + j; };
  int ids = idx(ra, ca), idt = idx(rb, cb);
  V<P<int, int>> near{mkp(1, 0), mkp(-1, 0), mkp(0, -1), mkp(0, 1)};

  vvi g;
  auto mk = [&]() {
    g.clear();
    g.resize(H * W);
    reg(i, 1, H - 1) reg(j, 1, W - 1) {
      if (gr[i][j] == '#') continue;
      if (gr[i + 1][j] == '.') g[idx(i + 1, j)].push_back(idx(i, j));
      if (gr[i - 1][j] == '.') g[idx(i - 1, j)].push_back(idx(i, j));
      if (gr[i][j + 1] == '.') g[idx(i, j + 1)].push_back(idx(i, j));
      if (gr[i][j - 1] == '.') g[idx(i, j - 1)].push_back(idx(i, j));
    }
  };
  mk();

  auto d0 = bfs_restore(g, ids);
  auto d1 = bfs_restore(g, idt);
  if (d0[idt].first == -1) die(-1);
  ll ans0 = d0[idt].first;
  vi path;
  for (int i = idt; i != -1; i = d0[i].second) {
    path.push_back(i);
  }

  each(p, path) {
    int hh = p / W, ww = p % W;
    gr[hh][ww] = '#';
  }

  ll mn = inf;
  {
    vi d2(H * W * 2, -1);
    d2[idx(ra, ca)] = 0;
    queue<int> Q;
    Q.push(ids);
    while (!Q.empty()) {
      int cur = Q.front();
      Q.pop();
      int codin = cur >= H * W ? cur - H * W : cur;
      int f = (cur != codin);
      int h = codin / W;
      int w = codin % W;
      trc(f,h,w);
      if(codin == idt) continue;
      int dc = d2[cur];
      f |= gr[h][w] == '.';
      each(dst, g[codin]) {
        int nh = dst / W, nw = dst % W;
        int nf = f | (gr[nh][nw] == '.');
        if(dst == ids) nf = 0;
        trc(nf, nh , nw);
        int nid = nf * H * W + idx(nh, nw);
        if (d2[nid] == -1) {
          d2[nid] = dc + 1;
          Q.push(nid);
        }
      }
    }
    if (d2[H * W + idt] != -1) amin(mn, d2[H * W + idt]);
  }
  trc(mn);
  each(x, gr) trc(x);

  bool nukemiti = 0, mawarimiti = 0;
  int mws = 0, mwt = 0;
  vi mwrs;
  each(p, path) {
    int hh = p / W, ww = p % W;
    trc(hh, ww);
    each2(dh, dw, near) if (gr[hh + dh][ww + dw] == '.') {
      if (p != ids and p != idt)
        nukemiti = true;
      else {
        mawarimiti = true, mwrs.push_back(idx(hh + dh, ww + dw));
        if (ids == p) mws++;
        if (idt == p) mwt++;
      }
    }
  }
  if (!nukemiti and !mawarimiti) die(-1);

  if (nukemiti) {
    out(ans0 + min(ans0 + 2, mn));
    return;
  }
  trc(mws, mwt);
  if (mws >= 2 or mwt >= 2) {
    out(ans0 + min(ans0 + 4, mn));
    return;
    exit(1);
  }

  // 廻り道のみオーケー　実装したくないな　困った
  // 分岐3箇所あるマスに行く感じか？自信ねえ
  mk();

  // 回り道出来るマスは？
  ll mrval = inf;
  // g[ra][ca] = g[rb][cb] = '.';
  each(p, mwrs) {
    auto d2 = bfs_restore(g, p);
    rep(i, H) rep(j, W) {
      if (gr[i][j] == '#') continue;
      int id = idx(i, j);
      if (d2[id].first == -1) continue;
      int masu = 0;
      each2(di, dj, near) masu += gr[i + di][j + dj] == '.';
      if (p == idx(i, j) and masu >= 2) mrval = 0;
      if (masu <= 2) continue;
      amin(mrval, d2[id].first);
    }
  }
  trc(mrval);

  // 二人ともmrval + 1に行く -> 戻るの手間が余計にかかる
  if (mn == inf and mrval == inf) die(-1);
  amin(mn, (mrval + 2) * 4 + ans0);
  out(ans0 + mn);
}

yukicoder

結果

テストケース

ソースコード