結果

問題 No.1647 Travel in Mitaru city 2
ユーザー keijakkeijak
提出日時 2021-08-14 00:13:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,520 bytes
コンパイル時間 2,715 ms
コンパイル使用メモリ 215,704 KB
実行使用メモリ 24,712 KB
最終ジャッジ日時 2024-10-04 01:04:54
合計ジャッジ時間 12,792 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 94 ms
22,652 KB
testcase_09 AC 95 ms
20,432 KB
testcase_10 AC 105 ms
22,696 KB
testcase_11 AC 88 ms
22,008 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 94 ms
23,144 KB
testcase_15 AC 91 ms
22,804 KB
testcase_16 AC 78 ms
21,712 KB
testcase_17 AC 93 ms
21,956 KB
testcase_18 WA -
testcase_19 AC 108 ms
23,816 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 101 ms
23,556 KB
testcase_23 AC 105 ms
23,688 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 99 ms
23,692 KB
testcase_27 AC 117 ms
24,072 KB
testcase_28 AC 148 ms
24,584 KB
testcase_29 AC 97 ms
24,712 KB
testcase_30 AC 92 ms
22,152 KB
testcase_31 AC 97 ms
24,712 KB
testcase_32 AC 82 ms
19,988 KB
testcase_33 AC 97 ms
24,584 KB
testcase_34 AC 93 ms
24,708 KB
testcase_35 AC 93 ms
22,148 KB
testcase_36 AC 95 ms
24,712 KB
testcase_37 AC 97 ms
24,712 KB
testcase_38 AC 85 ms
19,712 KB
testcase_39 WA -
testcase_40 AC 80 ms
19,328 KB
testcase_41 WA -
testcase_42 AC 86 ms
19,456 KB
testcase_43 AC 2 ms
5,248 KB
testcase_44 AC 5 ms
7,808 KB
testcase_45 WA -
testcase_46 AC 71 ms
13,440 KB
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
  for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;

template<typename T, typename U>
inline bool chmax(T &a, U b) {
  return a < b and ((a = std::move(b)), true);
}
template<typename T, typename U>
inline bool chmin(T &a, U b) {
  return a > b and ((a = std::move(b)), true);
}
template<typename T>
inline int ssize(const T &a) {
  return (int) std::size(a);
}

template<typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (auto &x : a) is >> x;
  return is;
}
template<typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
  return os << "(" << a.first << ", " << a.second << ")";
}
template<typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
                        std::string_view ends = "\n",
                        std::ostream &os = std::cout) {
  auto b = std::begin(a), e = std::end(a);
  for (auto it = std::begin(a); it != e; ++it) {
    if (it != b) os << sep;
    os << *it;
  }
  return os << ends;
}
template<typename T, typename = void>
struct is_iterable : std::false_type {};
template<typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
                                  decltype(std::end(std::declval<T>()))>>
    : std::true_type {
};

template<typename T, typename = std::enable_if_t<
    is_iterable<T>::value &&
        !std::is_same<T, std::string_view>::value &&
        !std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
  return print_seq(a, ", ", "", (os << "{")) << "}";
}

void print() { std::cout << "\n"; }
template<class T>
void print(const T &x) {
  std::cout << x << "\n";
}
template<typename Head, typename... Tail>
void print(const Head &head, Tail... tail) {
  std::cout << head << " ";
  print(tail...);
}

void read_from_cin() {}
template<typename T, typename... Ts>
void read_from_cin(T &value, Ts &...args) {
  std::cin >> value;
  read_from_cin(args...);
}
#define INPUT(type, ...) \
  type __VA_ARGS__;      \
  read_from_cin(__VA_ARGS__)

#ifdef MY_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif

using namespace std;

auto solve() -> optional<vector<int>> {
  INPUT(i64, H, W, n);
  vector<pair<int, int>> spots(n);
  vector<vector<int>> rows(H), cols(W);
  REP(i, n) {
    INPUT(int, x, y);
    --x, --y;
    spots[i] = {x, y};
    rows[x].push_back(i);
    cols[y].push_back(i);
  }
  vector<int> iteration(n, -1);
  vector<int> searched(n, -1);
  vector<int> path;

  auto dfs = [&](auto &dfs, int v, int j, int it) -> optional<int> {
    int x, y;
    tie(x, y) = spots[v];
    if (j & 1) {
      for (int u : cols[y]) {
        if (searched[u] != -1) {
          if (iteration[u] != it) continue;
          int sz = ssize(path) - searched[u];
          if (sz >= 4 and sz % 2 == 0) return searched[u];
          continue;
        }
        searched[u] = j - 1;
        iteration[u] = it;
        path.push_back(u);
        auto sub = dfs(dfs, u, j + 1, it);
        if (sub.has_value()) return sub;
        path.pop_back();
      }
    } else {
      for (auto u : rows[x]) {
        if (searched[u] != -1) {
          if (iteration[u] != it) continue;
          int sz = ssize(path) - searched[u];
          if (sz >= 4 and sz % 2 == 0) return searched[u];
          continue;
        }
        searched[u] = j - 1;
        iteration[u] = it;
        path.push_back(u);
        auto sub = dfs(dfs, u, j + 1, it);
        if (sub.has_value()) return sub;
        path.pop_back();
      }
    }
    return nullopt;
  };

  REP(v, n) {
    if (searched[v] != -1) continue;
    searched[v] = 0;
    iteration[v] = v;
    path.clear();
    path.push_back(v);
    auto res = dfs(dfs, v, 1, v);
    if (res.has_value()) {
      vector<int> ans;
      for (int j = res.value(); j < ssize(path); ++j) {
        ans.push_back(path[j] + 1);
      }
      if (ssize(ans) < 4) continue;
      return ans;
    }
  }
  return nullopt;
}

int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  cout << std::fixed << std::setprecision(15);
  int t = 1;
  REP(test_case, t) {
    auto ans = solve();
    if (not ans) {
      print(-1);
    } else {
      auto &v = ans.value();
      print(v.size());
      //for (auto &x : v) ++x;
      print_seq(v);
    }
  }
}
0