#925739 (C++23) No.2532 Want Play More

• 問題: No.2532 Want Play More
• ユーザー: risujiroh
• 提出日時: 2023-11-03 22:10:49
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 128 ms / 2,000 ms
• コード長: 3,007 bytes
• コンパイル時間: 3,314 ms
• コンパイル使用メモリ: 261,016 KB
• 実行使用メモリ: 34,432 KB
• 最終ジャッジ日時: 2024-09-25 20:36:12
• 合計ジャッジ時間: 5,778 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	126 ms; 15,744 KB
testcase_02	AC	123 ms; 15,872 KB
testcase_03	AC	128 ms; 15,232 KB
testcase_04	AC	120 ms; 15,232 KB
testcase_05	AC	114 ms; 14,848 KB
testcase_06	AC	80 ms; 34,432 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	4 ms; 5,376 KB
testcase_09	AC	4 ms; 5,376 KB
testcase_10	AC	44 ms; 9,088 KB
testcase_11	AC	40 ms; 8,960 KB
testcase_12	AC	74 ms; 12,544 KB
testcase_13	AC	53 ms; 9,984 KB
testcase_14	AC	16 ms; 5,504 KB
testcase_15	AC	107 ms; 15,668 KB
testcase_16	AC	84 ms; 13,736 KB
testcase_17	AC	4 ms; 5,376 KB
testcase_18	AC	61 ms; 11,392 KB
testcase_19	AC	98 ms; 14,028 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	51 ms; 16,344 KB

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  int n;
  scan(n);
  vector<vector<int>> g(n);
  for (int _ = n - 1; _--;) {
    int i, j;
    scan(i, j);
    --i, --j;
    g[i].push_back(j);
    g[j].push_back(i);
  }
  vector<array<int, 2>> f(n);
  fix([&](auto self, int i) -> void {
    if (g[i].empty()) {
      return;
    }
    f[i] = {INT_MAX, INT_MIN};
    for (int j : g[i]) {
      g[j].erase(ranges::find(g[j], i));
      self(j);
      chmin(f[i][0], f[j][1] + 1);
      chmax(f[i][1], f[j][0] + 1);
    }
  })(0);
  print(f[0][1]);
  print(f[0][0]);
}

}  // namespace

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

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

using namespace std;

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = forward<U>(y), true);
}

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class R, enable_if_t<!is_same_v<R, string&>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

template <class... Ts>
void scan(Ts&&... xs) {
  (cin >> ... >> xs);
}

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(move(f)) {}

  template <class... Ts>
  decltype(auto) operator()(Ts&&... xs) const {
    return f_(ref(*this), forward<Ts>(xs)...);
  }

 private:
  F f_;
};

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

inline auto len = ranges::ssize;

#endif  // __INCLUDE_LEVEL__