#1153952 (C++23) No.3482 Quod Erat Demonstrandum

• 問題: No.3482 Quod Erat Demonstrandum
• ユーザー: risujiroh
• 提出日時: 2026-03-27 21:35:14
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 108 ms / 2,000 ms
• コード長: 3,914 bytes
• コンパイル時間: 4,561 ms
• コンパイル使用メモリ: 363,008 KB
• 実行使用メモリ: 20,568 KB
• 最終ジャッジ日時: 2026-03-27 21:36:22
• 合計ジャッジ時間: 8,584 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_1

ファイルパターン	結果
sample	AC * 1
other	AC * 45

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n, m;
  IN(n, m);
  atcoder::dsu dsu(n);
  vector<pair<int, int>> diff;
  vector<vector<pair<int, int>>> g(n);
  while (m--) {
    int i, j, c;
    IN(OneBased(i, j, c));
    if (c == 0) {
      dsu.merge(i, j);
      g[i].emplace_back(j, 1);
      g[j].emplace_back(i, 1);
    } else {
      diff.emplace_back(i, j);
    }
  }
  auto get_dist = [&] {
    vector<int> dist(n, INF);
    priority_queue q(greater{}, vector{pair(dist[0] = 0, 0)});
    while (!q.empty()) {
      auto [di, i] = q.top();
      q.pop();
      if (di != dist[i])
        continue;
      for (auto [j, c] : g[i])
        if (SetMin(dist[j], di + c))
          q.emplace(dist[j], j);
    }
    return dist[n - 1];
  };
  if (dsu.same(0, n - 1)) {
    OUT("Same");
    OUT(get_dist());
    return;
  }
  for (auto [i, j] : diff) {
    for (int _ : Rep(0, 2)) {
      if (dsu.same(i, 0) && dsu.same(j, n - 1)) {
        g[i].emplace_back(j, n);
        g[j].emplace_back(i, n);
      }
      swap(i, j);
    }
  }
  int ans = get_dist();
  if (ans == INF) {
    OUT("Unknown");
  } else {
    ans -= n - 1;
    OUT("Different");
    OUT(ans);
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  IN(t);
  while (t--) {
    Solve();
  }
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

#include <atcoder/dsu.hpp>

template <class T>
concept MyRange =
    std::ranges::range<T> &&
    !std::convertible_to<T, std::string_view> &&
    !std::convertible_to<T, std::filesystem::path>;

template <class T>
concept MyTuple = std::__is_tuple_like<T>::value && !MyRange<T>;

namespace std {

istream& operator>>(istream& is, MyRange auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, MyTuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, MyRange auto&& r) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << forward<decltype(e)>(e);
  }
  return os;
}

ostream& operator<<(ostream& os, MyTuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

template <class T>
class OneBased {
 public:
  explicit OneBased(T&& x) : ref_(std::forward<T>(x)) {}

  template <class... Ts>
  requires(sizeof...(Ts) > 1)
      OneBased(Ts&&... xs) : ref_(std::forward_as_tuple(std::forward<Ts>(xs)...)) {}

  friend std::istream& operator>>(std::istream& is, OneBased x) {
    if constexpr (MyRange<T>) {
      for (auto&& e : x.ref_) {
        is >> ::OneBased(e);
      }
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { (is >> ... >> ::OneBased(xs)); }, x.ref_);
    } else {
      is >> x.ref_;
      --x.ref_;
    }
    return is;
  }

  friend std::ostream& operator<<(std::ostream& os, OneBased x) {
    if constexpr (MyRange<T>) {
      auto f = [](auto&& e) { return ::OneBased(std::forward<decltype(e)>(e)); };
      os << (x.ref_ | std::views::transform(f));
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { os << std::tuple(::OneBased(xs)...); }, x.ref_);
    } else {
      os << ++x.ref_;
      --x.ref_;
    }
    return os;
  }

 private:
  T ref_;
};

template <class T>
OneBased(T&&) -> OneBased<T>;

template <class... Ts>
OneBased(Ts&&...) -> OneBased<std::tuple<Ts...>>;

using namespace std;

#define _ _ [[maybe_unused]]
#define LAMBDA2(x, y, ...) ([&](auto&& x, auto&& y) -> decltype(auto) { return __VA_ARGS__; })
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define SetMin(...) LAMBDA2(x, y, y < x && (x = y, 1))(__VA_ARGS__)
#define INF (INT_MAX / 2)
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1