結果

問題 No.1284 Flip Game
コンテスト
ユーザー KoD
提出日時 2020-11-06 22:53:02
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 47 ms / 2,000 ms
コード長 3,851 bytes
コンパイル時間 3,059 ms
コンパイル使用メモリ 119,664 KB
最終ジャッジ日時 2025-01-15 21:10:46
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 28
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:37:32: warning: narrowing conversion of '(1 << N)' from 'int' to 'size_t' {aka 'long unsigned int'} [-Wnarrowing]
   37 |   struct iter {
      |                                ^   
main.cpp:37:40: warning: narrowing conversion of '(1 << N)' from 'int' to 'size_t' {aka 'long unsigned int'} [-Wnarrowing]
   37 |   struct iter {
      |                                        ^

ソースコード

diff #
raw source code 

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
  struct iter {
    std::size_t itr;
    constexpr iter(std::size_t pos) noexcept: itr(pos) { }
    constexpr void operator ++ () noexcept { ++itr; }
    constexpr bool operator != (iter other) const noexcept { return itr != other.itr; }
    constexpr std::size_t operator * () const noexcept { return itr; }
  };

  struct reviter {
    std::size_t itr;
    constexpr reviter(std::size_t pos) noexcept: itr(pos) { }
    constexpr void operator ++ () noexcept { --itr; }
    constexpr bool operator != (reviter other) const noexcept { return itr != other.itr; }
    constexpr std::size_t operator * () const noexcept { return itr; }
  };

  const iter first, last;

public:
  constexpr range(std::size_t first, std::size_t last) noexcept: first(first), last(std::max(first, last)) { }
  constexpr iter begin() const noexcept { return first; }
  constexpr iter end() const noexcept { return last; }
  constexpr reviter rbegin() const noexcept { return reviter(*last - 1); } 
  constexpr reviter rend() const noexcept { return reviter(*first - 1); } 
};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/multi_vec.cpp"

#include <cstddef>
#line 5 "/Users/kodamankod/Desktop/cpp_programming/Library/other/multi_vec.cpp"
#include <type_traits>

template <class T, size_t N, size_t I = 0>
decltype(auto) multi_vec(const size_t (&)[N], typename std::enable_if<(I == N), const T&>::type value = T{}) { 
  return value; 
}

template <class T, size_t N, size_t I = 0>
decltype(auto) multi_vec(const size_t (&list)[N], typename std::enable_if<(I != N), const T&>::type value = T{}) { 
  return std::vector(list[I], multi_vec<T, N, I + 1>(list, value)); 
}

/**
 * @title Multi-Dimensional Vector
 */
#line 17 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  usize N;
  std::cin >> N;
  auto cost = multi_vec<u64>({ N, N });
  for (auto &x: cost) {
    for (auto &y: x) {
      std::cin >> y;
    }
  }
  auto dp = multi_vec<u64>({ 1 << N, 1 << N, N }, inf64);
  for (auto i: range(0, N)) {
    dp[0][0][i] = 0;
  }
  for (auto T: range(0, 1 << N)) {
    for (auto S: range(0, 1 << N)) {
      if (S & T) {
        continue;
      }
      for (auto p: range(0, N)) {
        if (T >> p & 1) {
          continue;
        }
        for (auto q: range(0, N)) {
          if (p == q || (T >> q & 1)) {
            continue;
          }
          if (S >> p & 1) {
            chmin(dp[S & ~(1 << p)][T | (1 << p)][q], dp[S][T][p] + cost[p][q]);
          }
          else {
            chmin(dp[S | (1 << p)][T][q], dp[S][T][p] + cost[p][q]);
          }
        }
      }
    }
  }
  u64 ans = inf64;
  for (auto T: range(0, 1 << N)) {
    for (auto S: range(0, 1 << N)) {
      for (auto p: range(0, N)) {
        if ((T | (1 << p)) == ((1 << N) - 1)) {
          chmin(ans, dp[S][T][p]);
        }
      }
    }
  }
  std::cout << ans << '\n';
  return 0;
}
0