#1166109 (C++23) No.3552 Triangular Coloring

• 問題: No.3552 Triangular Coloring
• ユーザー: risujiroh
• 提出日時: 2026-05-22 22:57:04
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 386 ms / 2,000 ms
• コード長: 3,660 bytes
• コンパイル時間: 3,894 ms
• コンパイル使用メモリ: 355,552 KB
• 実行使用メモリ: 26,864 KB
• 最終ジャッジ日時: 2026-05-22 22:57:17
• 合計ジャッジ時間: 11,693 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

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

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n, m;
  IN(n, m);
  vector<vector<int>> g(n);
  while (m--) {
    int i, j;
    IN(OneBased(i, j));
    g[i].push_back(j);
    g[j].push_back(i);
  }

  vector<int> deg(n);
  for (int i : Rep(0, n))
    deg[i] = Len(g[i]);

  priority_queue q(greater{}, vector<pair<int, int>>{});
  for (int i : Rep(0, n))
    q.emplace(deg[i], i);

  vector<int> order;
  order.reserve(n);

  basic_string<bool> done(n, false);

  while (Len(q)) {
    auto [di, i] = q.top();
    q.pop();
    if (di != deg[i])
      continue;
    order.push_back(i);
    done[i] = true;
    for (int j : g[i]) {
      if (done[j])
        continue;
      --deg[j];
      q.emplace(deg[j], j);
    }
  }

  basic_string<bool> alive(n, false);

  vector<int> ans(n);

  for (int i : Rev(order)) {
    uint32_t used = 0;
    for (int j : g[i])
      if (alive[j]) {
        used |= 1 << ans[j];
      }

    for (int x : Rep1(1, 4))
      if (~used >> x & 1) {
        ans[i] = x;
        break;
      }

    alive[i] = true;
  }

  OUT("Yes");
  OUT(ans);
}

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

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

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 Rev views::reverse
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Rep1(...) [](int l, int r) { return Rep(l, r + 1); }(__VA_ARGS__)
#define Len(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1