結果
| 問題 |
No.1582 Vertexes vs Edges
|
| コンテスト | |
| ユーザー |
 jell
|
| 提出日時 | 2021-08-18 15:15:31 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 62 ms / 2,000 ms |
| コード長 | 59,238 bytes |
| コンパイル時間 | 14,556 ms |
| コンパイル使用メモリ | 370,812 KB |
| 最終ジャッジ日時 | 2025-01-23 22:55:23 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 36 |
ソースコード
#line 1 "atcoder-workspace\\yuki.cc"
#if defined(ONLINE_JUDGE) // && 0
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
#endif
// #undef _GLIBCXX_DEBUG
#include <bits/extc++.h>
/**
#include "lib/all"
/*/
#line 2 "Library\\lib\\alias"
/**
* @file alias
* @brief Alias
*/
#line 10 "Library\\lib\\alias"
// #include "bit"
#line 2 "Library\\lib\\limits"
#line 4 "Library\\lib\\limits"
namespace workspace {
template <class _Tp> struct numeric_limits : std::numeric_limits<_Tp> {};
#ifdef __SIZEOF_INT128__
template <> struct numeric_limits<__uint128_t> {
constexpr static __uint128_t max() { return ~__uint128_t(0); }
constexpr static __uint128_t min() { return 0; }
};
template <> struct numeric_limits<__int128_t> {
constexpr static __int128_t max() {
return numeric_limits<__uint128_t>::max() >> 1;
}
constexpr static __int128_t min() { return -max() - 1; }
};
#endif
} // namespace workspace
#line 13 "Library\\lib\\alias"
namespace workspace {
constexpr static char eol = '\n';
using namespace std;
using i32 = int_least32_t;
using u32 = uint_least32_t;
using i64 = int_least64_t;
using u64 = uint_least64_t;
#ifdef __SIZEOF_INT128__
using i128 = __int128_t;
using u128 = __uint128_t;
#else
#warning 128-bit integer is not available.
#endif
template <class _T1, class _T2,
typename = decltype(std::declval<const _T2 &>() <
std::declval<const _T1 &>())>
constexpr
typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,
typename std::common_type<_T1, _T2>::type>::type
min(const _T1 &__x, const _T2 &__y) noexcept {
return __y < __x ? __y : __x;
}
template <class _T1, class _T2, class _Compare,
typename = decltype(std::declval<_Compare>()(
std::declval<const _T2 &>(), std::declval<const _T1 &>()))>
constexpr
typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,
typename std::common_type<_T1, _T2>::type>::type
min(const _T1 &__x, const _T2 &__y, _Compare __comp) noexcept {
return __comp(__y, __x) ? __y : __x;
}
template <class _Tp, typename = decltype(std::declval<const _Tp &>() <
std::declval<const _Tp &>())>
constexpr _Tp min(std::initializer_list<_Tp> __x) noexcept {
return *std::min_element(__x.begin(), __x.end());
}
template <class _Tp, class _Compare,
typename = decltype(std::declval<_Compare>()(
std::declval<const _Tp &>(), std::declval<const _Tp &>()))>
constexpr _Tp min(std::initializer_list<_Tp> __x, _Compare __comp) noexcept {
return *std::min_element(__x.begin(), __x.end(), __comp);
}
template <class _T1, class _T2,
typename = decltype(std::declval<const _T1 &>() <
std::declval<const _T2 &>())>
constexpr
typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,
typename std::common_type<_T1, _T2>::type>::type
max(const _T1 &__x, const _T2 &__y) noexcept {
return __x < __y ? __y : __x;
}
template <class _T1, class _T2, class _Compare,
typename = decltype(std::declval<_Compare>()(
std::declval<const _T1 &>(), std::declval<const _T2 &>()))>
constexpr
typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,
typename std::common_type<_T1, _T2>::type>::type
max(const _T1 &__x, const _T2 &__y, _Compare __comp) noexcept {
return __comp(__x, __y) ? __y : __x;
}
template <class _Tp, typename = decltype(std::declval<const _Tp &>() <
std::declval<const _Tp &>())>
constexpr _Tp max(std::initializer_list<_Tp> __x) noexcept {
return *std::max_element(__x.begin(), __x.end());
}
template <class _Tp, class _Compare,
typename = decltype(std::declval<_Compare>()(
std::declval<const _Tp &>(), std::declval<const _Tp &>()))>
constexpr _Tp max(std::initializer_list<_Tp> __x, _Compare __comp) noexcept {
return *std::max_element(__x.begin(), __x.end(), __comp);
}
#ifdef _GLIBCXX_BIT
template <typename _Tp> constexpr _Tp __bsf(_Tp __x) noexcept {
return std::__countr_zero(__x);
}
template <typename _Tp> constexpr _Tp __bsr(_Tp __x) noexcept {
return std::__bit_width(__x) - 1;
}
#endif
} // namespace workspace
#line 13 "atcoder-workspace\\yuki.cc"
// #include "lib/cxx20"
#line 2 "Library\\src\\sys\\call_once.hpp"
/**
* @file call_once.hpp
* @brief Call Once
*/
#line 9 "Library\\src\\sys\\call_once.hpp"
namespace workspace {
/**
* @brief Call once.
*/
template <class _F> void call_once(_F &&__f) {
static std::unordered_set<void *> __called;
if (__called.count(std::addressof(__f))) return;
__called.emplace(std::addressof(__f));
__f();
}
} // namespace workspace
#line 2 "Library\\src\\sys\\clock.hpp"
/**
* @file clock.hpp
* @brief Clock
*/
#line 9 "Library\\src\\sys\\clock.hpp"
namespace workspace {
using namespace std::chrono;
namespace internal {
// The start time of the program.
const auto start_time{system_clock::now()};
} // namespace internal
/**
* @return Elapsed time of the program.
*/
decltype(auto) elapsed() noexcept {
const auto end_time{system_clock::now()};
return duration_cast<milliseconds>(end_time - internal::start_time).count();
}
} // namespace workspace
#line 2 "Library\\src\\sys\\ejection.hpp"
/**
* @file ejection.hpp
* @brief Ejection
*/
#line 9 "Library\\src\\sys\\ejection.hpp"
namespace workspace {
namespace internal {
struct ejection {
bool exit = 0;
};
} // namespace internal
/**
* @brief eject from a try block, throw nullptr
* @param arg output
*/
template <class Tp> void eject(Tp const &arg) {
std::cout << arg << "\n";
throw internal::ejection{};
}
void exit() { throw internal::ejection{true}; }
} // namespace workspace
#line 2 "Library\\src\\sys\\iteration.hpp"
/**
* @file iteration.hpp
* @brief Case Iteration
*/
#line 9 "Library\\src\\sys\\iteration.hpp"
#line 11 "Library\\src\\sys\\iteration.hpp"
namespace workspace {
void main();
struct {
// 1-indexed
unsigned current{0};
unsigned total{1};
void read() { (std::cin >> total).ignore(); }
int iterate() {
static bool once = false;
assert(!once);
once = true;
while (current++ < total) {
try {
main();
} catch (internal::ejection const& status) {
if (status.exit) break;
}
}
return 0;
}
} case_info;
} // namespace workspace
#line 1 "Library\\lib\\utils"
// #include "src/utils/cached.hpp"
#line 2 "Library\\src\\utils\\cat.hpp"
/**
* @file cat.hpp
* @brief Cat
*/
#line 9 "Library\\src\\utils\\cat.hpp"
#line 2 "Library\\lib\\cxx17"
#ifndef _CXX17_CONSTEXPR
#if __cplusplus >= 201703L
#define _CXX17_CONSTEXPR constexpr
#else
#define _CXX17_CONSTEXPR
#endif
#endif
#ifndef _CXX17_STATIC_ASSERT
#if __cplusplus >= 201703L
#define _CXX17_STATIC_ASSERT static_assert
#else
#define _CXX17_STATIC_ASSERT assert
#endif
#endif
#line 20 "Library\\lib\\cxx17"
#if __cplusplus < 201703L
namespace std {
/**
* @brief Return the size of a container.
* @param __cont Container.
*/
template <typename _Container>
constexpr auto size(const _Container& __cont) noexcept(noexcept(__cont.size()))
-> decltype(__cont.size()) {
return __cont.size();
}
/**
* @brief Return the size of an array.
*/
template <typename _Tp, size_t _Nm>
constexpr size_t size(const _Tp (&)[_Nm]) noexcept {
return _Nm;
}
struct monostate {};
template <class _Tp> class optional {
_Tp __value;
bool __has_value = false;
public:
constexpr operator bool() const noexcept { return __has_value; }
constexpr bool has_value() const noexcept { return __has_value; }
constexpr _Tp& value() noexcept { return __value; }
constexpr const _Tp& value() const noexcept { return __value; }
};
} // namespace std
#else
#include <optional>
#include <variant>
#endif
#line 11 "Library\\src\\utils\\cat.hpp"
namespace workspace {
/**
* @brief Concatenate two sequences.
*
* @param __c1
* @param __c2
* @return Concatenated sequence.
*/
template <class _C1, class _C2>
constexpr decltype(auto) cat(_C1 &&__c1, _C2 &&__c2) noexcept {
auto __c = std::forward<_C1>(__c1);
if _CXX17_CONSTEXPR (std::is_rvalue_reference<decltype(__c2)>::value)
__c.insert(std::end(__c), std::make_move_iterator(std::begin(__c2)),
std::make_move_iterator(std::end(__c2)));
else
__c.insert(std::end(__c), std::cbegin(__c2), std::cend(__c2));
return __c;
}
/**
* @return Concatenated sequence.
*/
template <class _C1, class _C2, class... _Args>
constexpr decltype(auto) cat(_C1 &&__c1, _C2 &&__c2,
_Args &&...__args) noexcept {
return cat(cat(std::forward<_C1>(__c1), std::forward<_C2>(__c2)),
std::forward<_Args>(__args)...);
}
} // namespace workspace
#line 2 "Library\\src\\utils\\chval.hpp"
/**
* @file chval.hpp
* @brief Change Less/Greater
*/
#line 9 "Library\\src\\utils\\chval.hpp"
namespace workspace {
/**
* @brief Substitute __y for __x if __y < __x.
* @param __x Reference
* @param __y Comparison target
* @return Whether or not __x is updated.
*/
template <class _T1, class _T2,
typename = decltype(std::declval<_T2>() < std::declval<_T1 &>())>
typename std::enable_if<std::is_assignable<_T1 &, _T2>::value, bool>::type chle(
_T1 &__x, _T2 &&__y) noexcept {
return __y < __x ? __x = std::forward<_T2>(__y), true : false;
}
/**
* @brief Substitute __y for __x if __x < __y.
* @param __x Reference
* @param __y Comparison target
* @return Whether or not __x is updated.
*/
template <class _T1, class _T2,
typename = decltype(std::declval<_T1 &>() < std::declval<_T2>())>
typename std::enable_if<std::is_assignable<_T1 &, _T2>::value, bool>::type chgr(
_T1 &__x, _T2 &&__y) noexcept {
return __x < __y ? __x = std::forward<_T2>(__y), true : false;
}
/**
* @brief Substitute __y for __x if __comp(__y, __x) is true.
* @param __x Reference
* @param __y Comparison target
* @param __comp Compare function object
* @return Whether or not __x is updated.
*/
template <class _T1, class _T2, class _Compare,
typename = decltype(std::declval<_Compare>()(std::declval<_T2>(),
std::declval<_T1 &>()))>
typename std::enable_if<std::is_assignable<_T1 &, _T2>::value, bool>::type chle(
_T1 &__x, _T2 &&__y, _Compare __comp) noexcept {
return __comp(__y, __x) ? __x = std::forward<_T2>(__y), true : false;
}
/**
* @brief Substitute __y for __x if __comp(__x, __y) is true.
* @param __x Reference
* @param __y Comparison target
* @param __comp Compare function object
* @return Whether or not __x is updated.
*/
template <class _T1, class _T2, class _Compare,
typename = decltype(std::declval<_Compare>()(std::declval<_T1 &>(),
std::declval<_T2>()))>
typename std::enable_if<std::is_assignable<_T1 &, _T2>::value, bool>::type chgr(
_T1 &__x, _T2 &&__y, _Compare __comp) noexcept {
return __comp(__x, __y) ? __x = std::forward<_T2>(__y), true : false;
}
} // namespace workspace
#line 2 "Library\\src\\utils\\fixed_point.hpp"
/**
* @file fixed_point.hpp
* @brief Fixed Point Combinator
*/
#line 9 "Library\\src\\utils\\fixed_point.hpp"
namespace workspace {
/**
* @brief Fixed Point Combinator.
*/
template <class _F> class fixed_point {
struct _wrapper {
_F &__ref;
template <class... _Args>
decltype(auto) operator()(_Args &&...__args) noexcept(
noexcept(__ref(*this, std::forward<_Args>(__args)...))) {
return __ref(*this, std::forward<_Args>(__args)...);
}
};
_F __fn;
public:
// Construct a new fixed-point object.
fixed_point(_F __x) noexcept : __fn(__x) {}
// Function call.
template <class... _Args>
decltype(auto) operator()(_Args &&...__args) noexcept(noexcept(_wrapper{
__fn}(std::forward<_Args>(__args)...))) {
return _wrapper{__fn}(std::forward<_Args>(__args)...);
}
};
} // namespace workspace
#line 5 "Library\\lib\\utils"
// #include "src/utils/hash.hpp"
#line 2 "Library\\src\\utils\\io\\istream.hpp"
/**
* @file istream.hpp
* @brief Input Stream
*/
#include <cxxabi.h>
#line 13 "Library\\src\\utils\\io\\istream.hpp"
#line 2 "Library\\src\\utils\\sfinae.hpp"
/**
* @file sfinae.hpp
* @brief SFINAE
*/
#line 10 "Library\\src\\utils\\sfinae.hpp"
#include <type_traits>
#ifndef __INT128_DEFINED__
#ifdef __SIZEOF_INT128__
#define __INT128_DEFINED__ 1
#else
#define __INT128_DEFINED__ 0
#endif
#endif
namespace std {
#if __INT128_DEFINED__
template <> struct make_signed<__uint128_t> { using type = __int128_t; };
template <> struct make_signed<__int128_t> { using type = __int128_t; };
template <> struct make_unsigned<__uint128_t> { using type = __uint128_t; };
template <> struct make_unsigned<__int128_t> { using type = __uint128_t; };
template <> struct is_signed<__uint128_t> : std::false_type {};
template <> struct is_signed<__int128_t> : std::true_type {};
template <> struct is_unsigned<__uint128_t> : std::true_type {};
template <> struct is_unsigned<__int128_t> : std::false_type {};
#endif
} // namespace std
namespace workspace {
template <class Tp, class... Args> struct variadic_front { using type = Tp; };
template <class... Args> struct variadic_back;
template <class Tp> struct variadic_back<Tp> { using type = Tp; };
template <class Tp, class... Args> struct variadic_back<Tp, Args...> {
using type = typename variadic_back<Args...>::type;
};
template <class type, template <class> class trait>
using enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;
/**
* @brief Return type of subscripting ( @c [] ) access.
*/
template <class _Tp>
using subscripted_type =
typename std::decay<decltype(std::declval<_Tp&>()[0])>::type;
template <class Container>
using element_type = typename std::decay<decltype(*std::begin(
std::declval<Container&>()))>::type;
template <class _Tp, class = void> struct has_begin : std::false_type {};
template <class _Tp>
struct has_begin<
_Tp, std::__void_t<decltype(std::begin(std::declval<const _Tp&>()))>>
: std::true_type {
using type = decltype(std::begin(std::declval<const _Tp&>()));
};
template <class _Tp, class = void> struct has_size : std::false_type {};
template <class _Tp>
struct has_size<_Tp, std::__void_t<decltype(std::size(std::declval<_Tp>()))>>
: std::true_type {};
template <class _Tp, class = void> struct has_resize : std::false_type {};
template <class _Tp>
struct has_resize<_Tp, std::__void_t<decltype(std::declval<_Tp>().resize(
std::declval<size_t>()))>> : std::true_type {};
template <class _Tp, class = void> struct has_mod : std::false_type {};
template <class _Tp>
struct has_mod<_Tp, std::__void_t<decltype(_Tp::mod)>> : std::true_type {};
template <class _Tp, class = void> struct is_integral_ext : std::false_type {};
template <class _Tp>
struct is_integral_ext<
_Tp, typename std::enable_if<std::is_integral<_Tp>::value>::type>
: std::true_type {};
#if __INT128_DEFINED__
template <> struct is_integral_ext<__int128_t> : std::true_type {};
template <> struct is_integral_ext<__uint128_t> : std::true_type {};
#endif
#if __cplusplus >= 201402
template <class _Tp>
constexpr static bool is_integral_ext_v = is_integral_ext<_Tp>::value;
#endif
template <typename _Tp, typename = void> struct multiplicable_uint {
using type = uint_least32_t;
};
template <typename _Tp>
struct multiplicable_uint<
_Tp,
typename std::enable_if<(2 < sizeof(_Tp)) &&
(!__INT128_DEFINED__ || sizeof(_Tp) <= 4)>::type> {
using type = uint_least64_t;
};
#if __INT128_DEFINED__
template <typename _Tp>
struct multiplicable_uint<_Tp,
typename std::enable_if<(4 < sizeof(_Tp))>::type> {
using type = __uint128_t;
};
#endif
template <typename _Tp> struct multiplicable_int {
using type =
typename std::make_signed<typename multiplicable_uint<_Tp>::type>::type;
};
template <typename _Tp> struct multiplicable {
using type = std::conditional_t<
is_integral_ext<_Tp>::value,
std::conditional_t<std::is_signed<_Tp>::value,
typename multiplicable_int<_Tp>::type,
typename multiplicable_uint<_Tp>::type>,
_Tp>;
};
template <class> struct first_arg { using type = void; };
template <class _R, class _Tp, class... _Args>
struct first_arg<_R(_Tp, _Args...)> {
using type = _Tp;
};
template <class _R, class _Tp, class... _Args>
struct first_arg<_R (*)(_Tp, _Args...)> {
using type = _Tp;
};
template <class _G, class _R, class _Tp, class... _Args>
struct first_arg<_R (_G::*)(_Tp, _Args...)> {
using type = _Tp;
};
template <class _G, class _R, class _Tp, class... _Args>
struct first_arg<_R (_G::*)(_Tp, _Args...) const> {
using type = _Tp;
};
template <class _Tp, class = void> struct parse_compare : first_arg<_Tp> {};
template <class _Tp>
struct parse_compare<_Tp, std::__void_t<decltype(&_Tp::operator())>>
: first_arg<decltype(&_Tp::operator())> {};
template <class _Container, class = void> struct get_dimension {
static constexpr size_t value = 0;
};
template <class _Container>
struct get_dimension<_Container,
std::enable_if_t<has_begin<_Container>::value>> {
static constexpr size_t value =
1 + get_dimension<typename std::iterator_traits<
typename has_begin<_Container>::type>::value_type>::value;
};
} // namespace workspace
#line 16 "Library\\src\\utils\\io\\istream.hpp"
namespace workspace {
namespace _istream_impl {
template <class _Tp, typename = void> struct helper {
helper(std::istream &__is, _Tp &__x) {
if _CXX17_CONSTEXPR (has_begin<_Tp &>::value)
for (auto &&__e : __x) helper<std::decay_t<decltype(__e)>>(__is, __e);
else
static_assert(has_begin<_Tp>::value, "istream unsupported type.");
}
};
template <class _Tp>
struct helper<_Tp, std::__void_t<decltype(std::declval<std::istream &>() >>
std::declval<_Tp &>())>> {
helper(std::istream &__is, _Tp &__x) { __is >> __x; }
};
#ifdef __SIZEOF_INT128__
template <> struct helper<__uint128_t, void> {
helper(std::istream &__is, __uint128_t &__x) {
std::string __s;
__is >> __s;
bool __neg = false;
if (__s.front() == '-') __neg = true, __s.erase(__s.begin());
__x = 0;
for (char __d : __s) {
__x *= 10;
__d -= '0';
if (__neg)
__x -= __d;
else
__x += __d;
}
}
};
template <> struct helper<__int128_t, void> {
helper(std::istream &__is, __int128_t &__x) {
std::string __s;
__is >> __s;
bool __neg = false;
if (__s.front() == '-') __neg = true, __s.erase(__s.begin());
__x = 0;
for (char __d : __s) {
__x *= 10;
__d -= '0';
if (__neg)
__x -= __d;
else
__x += __d;
}
}
};
#endif // INT128
template <class _T1, class _T2> struct helper<std::pair<_T1, _T2>> {
helper(std::istream &__is, std::pair<_T1, _T2> &__x) {
helper<_T1>(__is, __x.first), helper<_T2>(__is, __x.second);
}
};
template <class... _Tp> struct helper<std::tuple<_Tp...>> {
helper(std::istream &__is, std::tuple<_Tp...> &__x) { iterate(__is, __x); }
private:
template <class _Tuple, size_t _Nm = 0>
void iterate(std::istream &__is, _Tuple &__x) {
if _CXX17_CONSTEXPR (_Nm != std::tuple_size<_Tuple>::value) {
helper<typename std::tuple_element<_Nm, _Tuple>::type>(
__is, std::get<_Nm>(__x)),
iterate<_Tuple, _Nm + 1>(__is, __x);
}
}
};
} // namespace _istream_impl
/**
* @brief A wrapper class for std::istream.
*/
class istream : public std::istream {
public:
/**
* @brief Wrapped operator.
*/
template <typename _Tp> istream &operator>>(_Tp &__x) {
_istream_impl::helper<_Tp>(*this, __x);
if (std::istream::fail()) {
static auto once = atexit([] {
std::cerr << "\n\033[43m\033[30mwarning: failed to read \'"
<< abi::__cxa_demangle(typeid(_Tp).name(), 0, 0, 0)
<< "\'.\033[0m\n\n";
});
assert(!once);
}
return *this;
}
};
decltype(auto) cin = static_cast<istream &>(std::cin);
} // namespace workspace
#line 2 "Library\\src\\utils\\io\\ostream.hpp"
/**
* @file ostream.hpp
* @brief Output Stream
*/
#line 9 "Library\\src\\utils\\io\\ostream.hpp"
#line 11 "Library\\src\\utils\\io\\ostream.hpp"
namespace workspace {
template <class _Os> struct is_ostream {
template <typename... _Args>
static std::true_type __test(std::basic_ostream<_Args...> *);
static std::false_type __test(void *);
constexpr static bool value = decltype(__test(std::declval<_Os *>()))::value;
};
template <class _Os>
using ostream_ref =
typename std::enable_if<is_ostream<_Os>::value, _Os &>::type;
/**
* @brief Stream insertion operator for C-style array.
*
* @param __os Output stream
* @param __a Array
* @return Reference to __os.
*/
template <class _Os, class _Tp, size_t _Nm>
typename std::enable_if<bool(sizeof(_Tp) > 2), ostream_ref<_Os>>::type
operator<<(_Os &__os, const _Tp (&__a)[_Nm]) {
if _CXX17_CONSTEXPR (_Nm) {
__os << *__a;
for (auto __i = __a + 1, __e = __a + _Nm; __i != __e; ++__i)
__os << ' ' << *__i;
}
return __os;
}
/**
* @brief Stream insertion operator for std::array.
*
* @param __os Output stream
* @param __a Array
* @return Reference to __os.
*/
template <class _Os, class _Tp, size_t _Nm>
ostream_ref<_Os> operator<<(_Os &__os, const std::array<_Tp, _Nm> &__a) {
if _CXX17_CONSTEXPR (_Nm) {
__os << __a[0];
for (size_t __i = 1; __i != _Nm; ++__i) __os << ' ' << __a[__i];
}
return __os;
}
/**
* @brief Stream insertion operator for std::pair.
*
* @param __os Output stream
* @param __p Pair
* @return Reference to __os.
*/
template <class _Os, class _T1, class _T2>
ostream_ref<_Os> operator<<(_Os &__os, const std::pair<_T1, _T2> &__p) {
return __os << __p.first << ' ' << __p.second;
}
/**
* @brief Stream insertion operator for std::tuple.
*
* @param __os Output stream
* @param __t Tuple
* @return Reference to __os.
*/
template <class _Os, class _Tp, size_t _Nm = 0>
typename std::enable_if<bool(std::tuple_size<_Tp>::value + 1),
ostream_ref<_Os>>::type
operator<<(_Os &__os, const _Tp &__t) {
if _CXX17_CONSTEXPR (_Nm != std::tuple_size<_Tp>::value) {
if _CXX17_CONSTEXPR (_Nm) __os << ' ';
__os << std::get<_Nm>(__t);
operator<<<_Os, _Tp, _Nm + 1>(__os, __t);
}
return __os;
}
template <class _Os, class _Container,
typename = decltype(std::begin(std::declval<_Container>()))>
typename std::enable_if<
!std::is_convertible<std::decay_t<_Container>, std::string>::value &&
!std::is_convertible<std::decay_t<_Container>, char *>::value,
ostream_ref<_Os>>::type
operator<<(_Os &__os, const _Container &__cont) {
bool __h = true;
for (auto &&__e : __cont) __h ? __h = 0 : (__os << ' ', 0), __os << __e;
return __os;
}
#ifdef __SIZEOF_INT128__
/**
* @brief Stream insertion operator for __int128_t.
*
* @param __os Output Stream
* @param __x 128-bit integer
* @return Reference to __os.
*/
template <class _Os> ostream_ref<_Os> operator<<(_Os &__os, __int128_t __x) {
if (!__x) return __os << '0';
if (__x < 0) __os << '-';
char __s[40], *__p = __s;
while (__x) {
auto __d = __x % 10;
*__p++ = '0' + (__x < 0 ? -__d : __d);
__x /= 10;
}
*__p = 0;
for (char *__t = __s; __t < --__p; ++__t) *__t ^= *__p ^= *__t ^= *__p;
return __os << __s;
}
/**
* @brief Stream insertion operator for __uint128_t.
*
* @param __os Output Stream
* @param __x 128-bit unsigned integer
* @return Reference to __os.
*/
template <class _Os> ostream_ref<_Os> operator<<(_Os &__os, __uint128_t __x) {
if (!__x) return __os << '0';
char __s[40], *__p = __s;
while (__x) *__p++ = '0' + __x % 10, __x /= 10;
*__p = 0;
for (char *__t = __s; __t < --__p; ++__t) *__t ^= *__p ^= *__t ^= *__p;
return __os << __s;
}
#endif
} // namespace workspace
#line 8 "Library\\lib\\utils"
// #include "src/utils/io/read.hpp"
// #include "src/utils/grid/motion.hpp"
#line 2 "Library\\src\\utils\\io\\setup.hpp"
/**
* @file setup.hpp
* @brief I/O Setup
*/
#line 10 "Library\\src\\utils\\io\\setup.hpp"
namespace workspace {
/**
* @brief Setup I/O.
* @param __n Standard output precision
*/
void io_setup(int __n) {
std::cin.tie(0)->sync_with_stdio(0);
std::cout << std::fixed << std::setprecision(__n);
#ifdef _buffer_check
atexit([] {
char bufc;
if (std::cin >> bufc)
std::cerr << "\n\033[43m\033[30mwarning: buffer not empty.\033[0m\n\n";
});
#endif
}
} // namespace workspace
#line 11 "Library\\lib\\utils"
// #include "src/utils/iterator/category.hpp"
// #include "src/utils/iterator/reverse.hpp"
// #include "src/utils/make_vector.hpp"
#line 2 "Library\\src\\utils\\py-like\\enumerate.hpp"
/**
* @file enumerate.hpp
* @brief Enumerate
*/
#line 2 "Library\\src\\utils\\py-like\\range.hpp"
/**
* @file range.hpp
* @brief Range
*/
#line 9 "Library\\src\\utils\\py-like\\range.hpp"
#line 2 "Library\\src\\utils\\iterator\\reverse.hpp"
/*
* @file reverse_iterator.hpp
* @brief Reverse Iterator
*/
#if __cplusplus >= 201703L
#include <iterator>
#include <optional>
namespace workspace {
/*
* @class reverse_iterator
* @brief Wrapper class for `std::reverse_iterator`.
* @see http://gcc.gnu.org/PR51823
*/
template <class Iterator>
class reverse_iterator : public std::reverse_iterator<Iterator> {
using base_std = std::reverse_iterator<Iterator>;
std::optional<typename base_std::value_type> deref;
public:
using base_std::reverse_iterator;
constexpr typename base_std::reference operator*() noexcept {
if (!deref) {
Iterator tmp = base_std::current;
deref = *--tmp;
}
return deref.value();
}
constexpr reverse_iterator &operator++() noexcept {
base_std::operator++();
deref.reset();
return *this;
}
constexpr reverse_iterator &operator--() noexcept {
base_std::operator++();
deref.reset();
return *this;
}
constexpr reverse_iterator operator++(int) noexcept {
base_std::operator++();
deref.reset();
return *this;
}
constexpr reverse_iterator operator--(int) noexcept {
base_std::operator++();
deref.reset();
return *this;
}
};
} // namespace workspace
#endif
#line 2 "Library\\src\\utils\\py-like\\reversed.hpp"
/**
* @file reversed.hpp
* @brief Reversed
*/
#include <initializer_list>
#line 10 "Library\\src\\utils\\py-like\\reversed.hpp"
namespace workspace {
namespace _reversed_impl {
template <class _Container> class reversed {
_Container __cont;
public:
constexpr reversed(_Container &&__cont) noexcept : __cont(__cont) {}
constexpr decltype(auto) begin() noexcept { return std::rbegin(__cont); }
constexpr decltype(auto) begin() const noexcept {
return std::rbegin(__cont);
}
constexpr decltype(auto) end() noexcept { return std::rend(__cont); }
constexpr decltype(auto) end() const noexcept { return std::rend(__cont); }
constexpr decltype(auto) size() const noexcept {
return
#if __cplusplus < 201703L
__cont.size();
#else
std::size(__cont);
#endif
}
};
} // namespace _reversed_impl
template <class _Container>
constexpr decltype(auto) reversed(_Container &&__cont) noexcept {
return _reversed_impl::reversed<_Container>{std::forward<_Container>(__cont)};
}
template <class _Tp>
constexpr decltype(auto) reversed(
std::initializer_list<_Tp> &&__cont) noexcept {
return _reversed_impl::reversed<std::initializer_list<_Tp>>{
std::forward<std::initializer_list<_Tp>>(__cont)};
}
} // namespace workspace
#line 12 "Library\\src\\utils\\py-like\\range.hpp"
#if __cplusplus >= 201703L
namespace workspace {
template <class _Index> class range {
_Index __first, __last;
public:
class iterator {
_Index current;
public:
using difference_type = std::ptrdiff_t;
using value_type = _Index;
using reference = typename std::add_const<_Index>::type &;
using pointer = iterator;
using iterator_category = std::random_access_iterator_tag;
constexpr iterator(const _Index &__i = _Index()) noexcept : current(__i) {}
constexpr bool operator==(const iterator &__x) const noexcept {
return current == __x.current;
}
constexpr bool operator!=(const iterator &__x) const noexcept {
return current != __x.current;
}
constexpr bool operator<(const iterator &__x) const noexcept {
return current < __x.current;
}
constexpr bool operator<=(const iterator &__x) const noexcept {
return current <= __x.current;
}
constexpr bool operator>(const iterator &__x) const noexcept {
return current > __x.current;
}
constexpr bool operator>=(const iterator &__x) const noexcept {
return current >= __x.current;
}
constexpr iterator &operator++() noexcept {
++current;
return *this;
}
constexpr iterator &operator++(int) noexcept {
auto __tmp = *this;
++current;
return __tmp;
}
constexpr iterator &operator--() noexcept {
--current;
return *this;
}
constexpr iterator &operator--(int) noexcept {
auto __tmp = *this;
--current;
return __tmp;
}
constexpr difference_type operator-(const iterator &__x) const noexcept {
return current - __x.current;
}
constexpr iterator &operator+=(difference_type __x) noexcept {
current += __x;
return *this;
}
constexpr iterator operator+(difference_type __x) const noexcept {
return iterator(*this) += __x;
}
constexpr iterator &operator-=(difference_type __x) noexcept {
current -= __x;
return *this;
}
constexpr iterator operator-(difference_type __x) const noexcept {
return iterator(*this) -= __x;
}
constexpr reference operator*() const noexcept { return current; }
};
template <class _Tp1, class _Tp2>
constexpr range(const _Tp1 &__first, const _Tp2 &__last) noexcept
: __first(__first), __last(__last) {}
template <class _Tp>
constexpr range(const _Tp &__last) noexcept : __first(), __last(__last) {}
constexpr iterator begin() const noexcept { return iterator{__first}; }
constexpr iterator end() const noexcept { return iterator{__last}; }
constexpr reverse_iterator<iterator> rbegin() const noexcept {
return reverse_iterator<iterator>(end());
}
constexpr reverse_iterator<iterator> rend() const noexcept {
return reverse_iterator<iterator>(begin());
}
constexpr size_t size() const noexcept {
return std::distance(__first, __last);
}
};
template <class _Tp1, class _Tp2>
range(const _Tp1 &, const _Tp2 &)
-> range<std::decay_t<decltype(++std::declval<_Tp1 &>())>>;
template <class _Tp>
range(const _Tp &) -> range<std::decay_t<decltype(++std::declval<_Tp &>())>>;
template <class... _Args>
constexpr decltype(auto) rrange(_Args &&...__args) noexcept {
return reversed(range(std::forward<_Args>(__args)...));
}
template <class _Container>
constexpr decltype(auto) iterate(_Container &&__cont) noexcept {
return range(std::begin(__cont), std::end(__cont));
}
template <class _Container>
constexpr decltype(auto) riterate(_Container &&__cont) noexcept {
return range(std::rbegin(__cont), std::rend(__cont));
}
} // namespace workspace
#endif
#line 2 "Library\\src\\utils\\py-like\\zip.hpp"
/**
* @file zip.hpp
* @brief Zip
*/
#line 11 "Library\\src\\utils\\py-like\\zip.hpp"
#line 2 "Library\\src\\utils\\iterator\\category.hpp"
/*
* @file category.hpp
* @brief Iterator Category
*/
#line 10 "Library\\src\\utils\\iterator\\category.hpp"
namespace workspace {
/*
* @tparam Tuple Tuple of iterator types
*/
template <class Tuple, size_t N = std::tuple_size<Tuple>::value - 1>
struct common_iterator_category {
using type = typename std::common_type<
typename common_iterator_category<Tuple, N - 1>::type,
typename std::iterator_traits<typename std::tuple_element<
N, Tuple>::type>::iterator_category>::type;
};
template <class Tuple> struct common_iterator_category<Tuple, 0> {
using type = typename std::iterator_traits<
typename std::tuple_element<0, Tuple>::type>::iterator_category;
};
} // namespace workspace
#line 15 "Library\\src\\utils\\py-like\\zip.hpp"
#if __cplusplus >= 201703L
namespace workspace {
namespace internal {
template <class> struct zipped_iterator;
template <class...> struct zipped_iterator_tuple;
template <class... Args> class zipped {
using ref_tuple = std::tuple<Args...>;
ref_tuple args;
template <size_t N = 0> constexpr decltype(auto) begin_cat() const noexcept {
if _CXX17_CONSTEXPR (N != std::tuple_size<ref_tuple>::value) {
return std::tuple_cat(std::tuple(std::begin(std::get<N>(args))),
begin_cat<N + 1>());
} else
return std::tuple<>();
}
template <size_t N = 0> constexpr decltype(auto) end_cat() const noexcept {
if _CXX17_CONSTEXPR (N != std::tuple_size<ref_tuple>::value) {
return std::tuple_cat(std::tuple(std::end(std::get<N>(args))),
end_cat<N + 1>());
} else
return std::tuple<>();
}
public:
constexpr zipped(Args &&...args) noexcept : args(args...) {}
class iterator {
using base_tuple = typename zipped_iterator_tuple<Args...>::type;
public:
using iterator_category =
typename common_iterator_category<base_tuple>::type;
using difference_type = std::ptrdiff_t;
using value_type = zipped_iterator<base_tuple>;
using reference = zipped_iterator<base_tuple> &;
using pointer = iterator;
protected:
value_type current;
template <size_t N = 0>
constexpr bool equal(const iterator &rhs) const noexcept {
if _CXX17_CONSTEXPR (N != std::tuple_size<base_tuple>::value) {
return std::get<N>(current) == std::get<N>(rhs.current) ||
equal<N + 1>(rhs);
} else
return false;
}
template <size_t N = 0> constexpr void increment() noexcept {
if _CXX17_CONSTEXPR (N != std::tuple_size<base_tuple>::value) {
++std::get<N>(current);
increment<N + 1>();
}
}
template <size_t N = 0> constexpr void decrement() noexcept {
if _CXX17_CONSTEXPR (N != std::tuple_size<base_tuple>::value) {
--std::get<N>(current);
decrement<N + 1>();
}
}
template <size_t N = 0>
constexpr void advance(difference_type __d) noexcept {
if _CXX17_CONSTEXPR (N != std::tuple_size<base_tuple>::value) {
std::get<N>(current) += __d;
advance<N + 1>(__d);
}
}
public:
constexpr iterator() noexcept = default;
constexpr iterator(base_tuple const ¤t) noexcept : current(current) {}
constexpr bool operator==(const iterator &rhs) const noexcept {
return equal(rhs);
}
constexpr bool operator!=(const iterator &rhs) const noexcept {
return !equal(rhs);
}
constexpr iterator &operator++() noexcept {
increment();
return *this;
}
constexpr iterator &operator--() noexcept {
decrement();
return *this;
}
constexpr bool operator<(const iterator &rhs) const noexcept {
return std::get<0>(current) < std::get<0>(rhs.current);
}
constexpr bool operator<=(const iterator &rhs) const noexcept {
return std::get<0>(current) <= std::get<0>(rhs.current);
}
constexpr iterator &operator+=(difference_type __d) noexcept {
advance(__d);
return *this;
}
constexpr iterator &operator-=(difference_type __d) noexcept {
advance(-__d);
return *this;
}
constexpr iterator operator+(difference_type __d) const noexcept {
return iterator{*this} += __d;
}
constexpr iterator operator-(difference_type __d) const noexcept {
return iterator{*this} -= __d;
}
constexpr difference_type operator-(const iterator &rhs) const noexcept {
return std::get<0>(current) - std::get<0>(rhs.current);
}
constexpr reference operator*() noexcept { return current; }
};
constexpr iterator begin() const noexcept { return iterator{begin_cat()}; }
constexpr iterator end() const noexcept { return iterator{end_cat()}; }
constexpr reverse_iterator<iterator> rbegin() const noexcept {
return reverse_iterator<iterator>{end()};
}
constexpr reverse_iterator<iterator> rend() const noexcept {
return reverse_iterator<iterator>{begin()};
}
};
template <class Tp, class... Args> struct zipped_iterator_tuple<Tp, Args...> {
using type = decltype(std::tuple_cat(
std::declval<std::tuple<decltype(std::begin(std::declval<Tp>()))>>(),
std::declval<typename zipped_iterator_tuple<Args...>::type>()));
};
template <> struct zipped_iterator_tuple<> { using type = std::tuple<>; };
template <class Iter_tuple> struct zipped_iterator : Iter_tuple {
constexpr zipped_iterator(Iter_tuple const &__t) noexcept
: Iter_tuple::tuple(__t) {}
constexpr zipped_iterator(zipped_iterator const &__t) = default;
constexpr zipped_iterator &operator=(zipped_iterator const &__t) = default;
// Avoid move initialization.
constexpr zipped_iterator(zipped_iterator &&__t)
: zipped_iterator(static_cast<zipped_iterator const &>(__t)) {}
// Avoid move assignment.
zipped_iterator &operator=(zipped_iterator &&__t) {
return operator=(static_cast<zipped_iterator const &>(__t));
}
template <size_t N>
friend constexpr decltype(auto) get(
zipped_iterator<Iter_tuple> const &__z) noexcept {
return *std::get<N>(__z);
}
template <size_t N>
friend constexpr decltype(auto) get(
zipped_iterator<Iter_tuple> &&__z) noexcept {
return *std::get<N>(__z);
}
};
} // namespace internal
} // namespace workspace
namespace std {
template <size_t N, class Iter_tuple>
struct tuple_element<N, workspace::internal::zipped_iterator<Iter_tuple>> {
using type = typename remove_reference<typename iterator_traits<
typename tuple_element<N, Iter_tuple>::type>::reference>::type;
};
template <class Iter_tuple>
struct tuple_size<workspace::internal::zipped_iterator<Iter_tuple>>
: tuple_size<Iter_tuple> {};
} // namespace std
namespace workspace {
template <class... Args> constexpr decltype(auto) zip(Args &&...args) noexcept {
return internal::zipped<Args...>(std::forward<Args>(args)...);
}
template <class... Args>
constexpr decltype(auto) zip(
std::initializer_list<Args> const &...args) noexcept {
return internal::zipped<const std::initializer_list<Args>...>(args...);
}
} // namespace workspace
#endif
#line 10 "Library\\src\\utils\\py-like\\enumerate.hpp"
#if __cplusplus >= 201703L
namespace workspace {
namespace _enumerate_impl {
constexpr size_t min_size() noexcept { return SIZE_MAX; }
template <class _Container, class... _Args>
constexpr size_t min_size(_Container const &__cont,
_Args &&... __args) noexcept {
return std::min(std::size(__cont), min_size(std::forward<_Args>(__args)...));
}
} // namespace _enumerate_impl
template <class... _Args>
constexpr decltype(auto) enumerate(_Args &&... __args) noexcept {
return zip(range(_enumerate_impl::min_size(__args...)),
std::forward<_Args>(__args)...);
}
template <class... _Args>
constexpr decltype(auto) enumerate(
std::initializer_list<_Args> const &... __args) noexcept {
return zip(range(_enumerate_impl::min_size(__args...)),
std::vector(__args)...);
}
} // namespace workspace
#endif
#line 16 "Library\\lib\\utils"
// #include "src/utils/py-like/reversed.hpp"
// #include "src/utils/py-like/zip.hpp"
#line 2 "Library\\src\\utils\\rand\\rng.hpp"
/**
* @file rng.hpp
* @brief Random Number Generator
*/
#line 9 "Library\\src\\utils\\rand\\rng.hpp"
namespace workspace {
template <typename _Arithmetic>
using uniform_distribution = typename std::conditional<
std::is_integral<_Arithmetic>::value,
std::uniform_int_distribution<_Arithmetic>,
std::uniform_real_distribution<_Arithmetic>>::type;
template <typename _Arithmetic, class _Engine = std::mt19937>
class random_number_generator : uniform_distribution<_Arithmetic> {
using base = uniform_distribution<_Arithmetic>;
_Engine __engine;
public:
random_number_generator(_Arithmetic __min, _Arithmetic __max)
: base(__min, __max), __engine(std::random_device{}()) {}
random_number_generator(_Arithmetic __max = 1)
: random_number_generator(0, __max) {}
random_number_generator(typename base::param_type const& __param)
: base(__param), __engine(std::random_device{}()) {}
decltype(auto) operator()() noexcept { return base::operator()(__engine); }
};
} // namespace workspace
#line 2 "Library\\src\\utils\\rand\\shuffle.hpp"
/**
* @file shuffle.hpp
* @brief Shuffle
*/
#line 10 "Library\\src\\utils\\rand\\shuffle.hpp"
namespace workspace {
template <class _RAIter, class _Engine = std::mt19937>
void shuffle(_RAIter __first, _RAIter __last) {
static _Engine __engine(std::random_device{}());
std::shuffle(__first, __last, __engine);
}
} // namespace workspace
#line 2 "Library\\src\\utils\\round_div.hpp"
/*
* @file round_div.hpp
* @brief Round Integer Division
*/
#line 9 "Library\\src\\utils\\round_div.hpp"
#line 11 "Library\\src\\utils\\round_div.hpp"
namespace workspace {
/*
* @fn floor_div
* @brief floor of fraction.
* @param x the numerator
* @param y the denominator
* @return maximum integer z s.t. z <= x / y
* @note y must be nonzero.
*/
template <typename T1, typename T2>
constexpr typename std::enable_if<(is_integral_ext<T1>::value &&
is_integral_ext<T2>::value),
typename std::common_type<T1, T2>::type>::type
floor_div(T1 x, T2 y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return x < 0 ? (x - y + 1) / y : x / y;
}
/*
* @fn ceil_div
* @brief ceil of fraction.
* @param x the numerator
* @param y the denominator
* @return minimum integer z s.t. z >= x / y
* @note y must be nonzero.
*/
template <typename T1, typename T2>
constexpr typename std::enable_if<(is_integral_ext<T1>::value &&
is_integral_ext<T2>::value),
typename std::common_type<T1, T2>::type>::type
ceil_div(T1 x, T2 y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return x < 0 ? x / y : (x + y - 1) / y;
}
} // namespace workspace
#line 21 "Library\\lib\\utils"
// #include "src\utils\rand\tree.hpp"
// #include "src\utils\reference_list.hpp"
#line 2 "Library\\src\\utils\\io\\input.hpp"
/**
* @file input.hpp
* @brief Input
*/
#line 10 "Library\\src\\utils\\io\\input.hpp"
namespace workspace {
namespace _input_impl {
template <class _Tp, bool _Is_class = false> class input {
_Tp __value;
template <class... _Args> struct is_convertible : std::false_type {};
template <class _Arg>
struct is_convertible<_Arg> : std::is_convertible<_Arg, _Tp> {};
public:
operator _Tp &() noexcept { return __value; }
operator const _Tp &() const noexcept { return __value; }
template <class... _Args>
input(_Args &&...__args) noexcept : __value(std::forward<_Args>(__args)...) {
if _CXX17_CONSTEXPR (not is_convertible<_Args...>::value) cin >> __value;
}
};
template <class _Tp> class input<_Tp, true> : public _Tp {
template <class... _Args> struct is_convertible : std::false_type {};
template <class _Arg>
struct is_convertible<_Arg> : std::is_convertible<_Arg, _Tp> {};
public:
operator _Tp &() noexcept { return *this; }
operator const _Tp &() const noexcept { return *this; }
template <class... _Args>
input(_Args &&...__args) noexcept : _Tp(std::forward<_Args>(__args)...) {
if _CXX17_CONSTEXPR (not is_convertible<_Args...>::value) cin >> *this;
}
template <class _E>
input(std::initializer_list<_E> __l) noexcept : _Tp(__l) {}
};
} // namespace _input_impl
// Standard input.
template <class _Tp = int_least64_t>
class input : public _input_impl::input<_Tp, std::is_class<_Tp>::value> {
public:
using _input_impl::input<_Tp, std::is_class<_Tp>::value>::input;
};
// Integrality.
template <class _Tp>
struct is_integral_ext<input<_Tp>> : is_integral_ext<_Tp> {};
} // namespace workspace
#line 16 "atcoder-workspace\\yuki.cc"
//*/
signed main() {
using namespace workspace;
io_setup(15);
/* given
case_info.read(); //*/
/* unspecified
case_info.total = -1; //*/
return case_info.iterate();
}
#line 2 "Library\\src\\graph\\forest.h"
/**
* @file forest.h
* @brief Forest
*/
#line 2 "Library\\src\\graph\\graph.h"
/**
* @file graph.h
* @brief Graph
*/
#line 2 "Library\\src\\graph\\digraph.h"
/**
* @file digraph.h
* @brief Digraph
*/
#line 13 "Library\\src\\graph\\digraph.h"
#line 2 "Library\\src\\graph\\edge.h"
/**
* @file edge.h
* @brief Edge
*/
#line 9 "Library\\src\\graph\\edge.h"
namespace workspace {
struct null_attribute {};
template <class _Weight, class _Attr = null_attribute>
struct weighted_edge : _Attr {
using attribute = _Attr;
using value_type = _Weight;
using node_type = size_t;
node_type tail, head;
value_type weight{};
constexpr weighted_edge() = default;
template <class... _Args>
constexpr weighted_edge(node_type __u, node_type __v, value_type __c = 0,
_Args &&...__args) noexcept
: _Attr(std::forward<_Args>(__args)...),
tail(__u),
head(__v),
weight(__c) {}
constexpr bool operator<(const weighted_edge &__e) const noexcept {
return weight < __e.weight;
}
constexpr bool operator>(const weighted_edge &__e) const noexcept {
return weight > __e.weight;
}
};
template <class _Attr = null_attribute>
struct edge : weighted_edge<int, _Attr> {
using base_type = weighted_edge<int, _Attr>;
using typename base_type::node_type;
using base_type::operator<;
using base_type::operator>;
constexpr edge() = default;
template <class... _Args>
constexpr edge(node_type __u, node_type __v, _Args &&...__args) noexcept
: base_type(__u, __v, __u != __v, std::forward<_Args>(__args)...) {}
};
template <size_t _Nm, class _Attr>
constexpr std::tuple_element_t<_Nm, edge<_Attr>> &get(
edge<_Attr> &__e) noexcept {
if _CXX17_CONSTEXPR (_Nm > 1)
return __e;
else if _CXX17_CONSTEXPR (_Nm)
return __e.head;
else
return __e.tail;
}
template <size_t _Nm, class _Attr>
constexpr const std::tuple_element_t<_Nm, edge<_Attr>> &get(
const edge<_Attr> &__e) noexcept {
if _CXX17_CONSTEXPR (_Nm > 1)
return __e;
else if _CXX17_CONSTEXPR (_Nm)
return __e.head;
else
return __e.tail;
}
template <size_t _Nm, class _Attr>
constexpr std::tuple_element_t<_Nm, edge<_Attr>> &&get(
edge<_Attr> &&__e) noexcept {
return std::move(get<_Nm>(__e));
}
template <size_t _Nm, class _Weight, class _Attr>
constexpr const std::tuple_element_t<_Nm, weighted_edge<_Weight, _Attr>> &get(
const weighted_edge<_Weight, _Attr> &__e) noexcept {
if _CXX17_CONSTEXPR (_Nm > 2)
return __e;
else if _CXX17_CONSTEXPR (_Nm > 1)
return __e.weight;
else if _CXX17_CONSTEXPR (_Nm)
return __e.head;
else
return __e.tail;
}
template <size_t _Nm, class _Weight, class _Attr>
constexpr std::tuple_element_t<_Nm, weighted_edge<_Weight, _Attr>> &get(
weighted_edge<_Weight, _Attr> &__e) noexcept {
if _CXX17_CONSTEXPR (_Nm > 2)
return __e;
else if _CXX17_CONSTEXPR (_Nm > 1)
return __e.weight;
else if _CXX17_CONSTEXPR (_Nm)
return __e.head;
else
return __e.tail;
}
template <size_t _Nm, class _Weight, class _Attr>
constexpr std::tuple_element_t<_Nm, weighted_edge<_Weight, _Attr>> &&get(
weighted_edge<_Weight, _Attr> &&__e) noexcept {
return std::move(get<_Nm>(__e));
}
} // namespace workspace
namespace std {
template <class _Attr>
struct tuple_size<workspace::edge<_Attr>> : integral_constant<size_t, 3> {};
template <>
struct tuple_size<workspace::edge<>> : integral_constant<size_t, 2> {};
template <class _Weight, class _Attr>
struct tuple_size<workspace::weighted_edge<_Weight, _Attr>>
: integral_constant<size_t, 4> {};
template <class _Weight>
struct tuple_size<workspace::weighted_edge<_Weight>>
: integral_constant<size_t, 3> {};
template <size_t _Nm, class _Attr>
struct tuple_element<_Nm, workspace::edge<_Attr>> {
using type = std::conditional_t<(_Nm < 2), size_t, _Attr>;
};
template <size_t _Nm, class _Weight, class _Attr>
struct tuple_element<_Nm, workspace::weighted_edge<_Weight, _Attr>> {
using type = std::conditional_t<(_Nm < 2), size_t,
std::conditional_t<_Nm == 2, _Weight, _Attr>>;
};
} // namespace std
#line 15 "Library\\src\\graph\\digraph.h"
namespace workspace {
template <class _Attr = null_attribute, class _List = std::vector<edge<_Attr>>>
class digraph : std::vector<_List> {
public:
using container_type = std::vector<_List>;
using size_type = typename container_type::size_type;
using node_type = size_type;
using edge_type = typename _List::value_type;
using container_type::operator[];
using container_type::begin;
using container_type::end;
using container_type::empty;
using container_type::size;
digraph(size_type __n = 0) : container_type(__n) {}
/**
* @brief Add some nodes to the graph.
* @param __n Number of nodes added
* @return List of indices of the nodes.
*/
auto add_nodes(size_type __n) noexcept {
std::vector<node_type> __ret(__n);
std::iota(__ret.begin(), __ret.end(), size());
container_type::resize(__n + size());
return __ret;
}
node_type add_node() noexcept { return add_nodes(1).front(); }
template <class... _Args>
decltype(auto) add_edge(node_type __u, node_type __v,
_Args &&...__args) noexcept {
return operator[](__u).emplace_back(__u, __v,
std::forward<_Args>(__args)...);
}
decltype(auto) add_edge(const edge_type &__e) noexcept {
return operator[](__e.tail).emplace_back(__e);
}
/**
* @brief Single-source DFS.
* @return Edges of DFS-tree in the search_from order.
*/
decltype(auto) dfs(node_type __r) noexcept {
node_type __a[]{__r};
return dfs(__a, __a + 1);
}
/**
* @brief Multi-source DFS.
* @return Edges of DFS-tree in the search_from order.
*/
template <class _Iterator>
decltype(auto) dfs(_Iterator __first, _Iterator __last) noexcept {
return search_from<std::stack<edge_type, std::vector<edge_type>>>(__first,
__last);
}
/**
* @brief Single-source BFS.
* @return Edges of BFS-tree in the search_from order.
*/
decltype(auto) bfs(node_type __r) noexcept {
node_type __a[]{__r};
return bfs(__a, __a + 1);
}
/**
* @brief Multi-source BFS.
* @return Edges of BFS-tree in the search_from order.
*/
template <class _Iterator>
decltype(auto) bfs(_Iterator __first, _Iterator __last) noexcept {
return search_from<std::queue<edge_type>>(__first, __last);
}
/**
* @brief Prim's algorithm.
* @param __r Starting vertex. Defalut: 0.
* @return Edges of a minimum spanning tree (of the connected component).
*/
decltype(auto) prim(node_type __r = 0) noexcept {
node_type __a[]{__r};
return prim(__a, __a + 1);
}
/**
* @brief Prim's algorithm.
* @param __r Starting vertices. Defalut: 0.
* @return Edges of a minimum spanning tree (of the connected component).
*/
template <class _Iterator>
decltype(auto) prim(_Iterator __first, _Iterator __last) noexcept {
return search_from<
std::priority_queue<edge_type, std::vector<edge_type>, std::greater<>>>(
__first, __last);
}
/**
* @brief Single-source Dijkstra's algorithm.
* @return Edges of shortest path tree in the search_from order.
*/
decltype(auto) dijkstra(node_type __r) noexcept {
node_type __a[]{__r};
return dijkstra(__a, __a + 1);
}
/**
* @brief Multi-source Dijkstra's algorithm.
* @return Edges of shortest path tree in the search_from order.
*/
template <class _Iterator>
decltype(auto) dijkstra(_Iterator __first, _Iterator __last) noexcept {
return distance_from<std::priority_queue<edge_type, std::vector<edge_type>,
std::greater<edge_type>>>(__first,
__last);
}
/**
* @brief Single-source Bellman-Ford algorithm.
* @return Edges of shortest path tree in the search_from order.
*/
decltype(auto) bellman_ford() noexcept {
std::vector<node_type> __a(size());
return bellman_ford(__a.begin(), __a.end());
}
/**
* @brief Multi-source Bellman-Ford algorithm.
* @return Edges of shortest path tree in the search_from order.
*/
decltype(auto) bellman_ford(node_type __r) noexcept {
node_type __a[]{__r};
return bellman_ford(__a, __a + 1);
}
template <class _Iterator>
decltype(auto) bellman_ford(_Iterator __first, _Iterator __last) noexcept {
return distance_from<std::queue<edge_type>>(__first, __last);
}
decltype(auto) warshall_floyd(node_type __r) noexcept;
protected:
/**
* @brief Search from given vertex set.
* @tparam _Add_weight Need distance or not.
* @tparam _Container Queue.
*/
template <class _Container, class _Iterator>
auto search_from(_Iterator __first, _Iterator __last) const noexcept {
static std::vector<int_fast8_t> __visited;
__visited.resize(size());
std::vector<edge_type> __tree;
queue_wrapper<_Container> __queue;
for (auto __s = __first; __s != __last; __visited[*__s++] = true)
for (auto &&__e : operator[](*__s)) __queue.emplace(__e);
while (!__queue.empty()) {
auto &&__p = __queue.pop();
if (__visited[__p.head]) continue;
__visited[__p.head] = true;
for (auto __e : operator[](__p.head)) __queue.emplace(std::move(__e));
__tree.emplace_back(__p);
}
for (auto __s = __first; __s != __last; __visited[*__s++] = false) continue;
for (auto &&__e : __tree) __visited[__e.head] = false;
return __tree;
}
template <class _Container, class _Iterator>
auto distance_from(_Iterator __first, _Iterator __last) const noexcept {
using iterator = typename std::list<edge_type>::iterator;
struct info : iterator {
bool empty = true;
};
static std::vector<info> __prev;
__prev.resize(size());
std::list<edge_type> __tree;
queue_wrapper<_Container> __queue;
for (; __first != __last; ++__first) __queue.emplace(*__first, *__first);
while (!__queue.empty()) {
auto &&__p = __queue.pop();
auto &&__l = __prev[__p.head];
if (!__l.empty && !(__p.weight < __l->weight)) continue;
if (__l.empty)
__l.empty = false;
else
__tree.erase((iterator &)__l);
for (auto __e : operator[](__p.head))
__e.weight += __p.weight, __queue.emplace(std::move(__e));
(iterator &)__l = __tree.emplace(__tree.end(), __p);
}
for (auto &&__e : __tree) __prev[__e.head].empty = true;
__tree.remove_if([](auto &&__e) { return __e.tail == __e.head; });
return __tree;
}
template <class _Base, class = void> struct queue_wrapper : _Base {
auto pop() noexcept {
auto __tmp = std::move(_Base::front());
_Base::pop();
return __tmp;
}
};
template <class _Base>
struct queue_wrapper<_Base,
std::__void_t<decltype(std::declval<_Base>().top())>>
: _Base {
auto pop() noexcept {
auto __tmp = std::move(_Base::top());
_Base::pop();
return __tmp;
}
};
};
template <class _Weight, class _Attr = null_attribute,
class _List = std::vector<weighted_edge<_Weight, _Attr>>>
class weighted_digraph : public digraph<_Attr, _List> {
using digraph<_Attr, _List>::digraph;
};
} // namespace workspace
#line 9 "Library\\src\\graph\\graph.h"
namespace workspace {
template <class _Attr = null_attribute, class _List = std::vector<edge<_Attr>>>
class graph : public digraph<_Attr, _List> {
using base_type = digraph<_Attr, _List>;
public:
using typename base_type::node_type;
using typename base_type::size_type;
constexpr graph(size_type __n = 0) noexcept : base_type(__n) {}
template <class... _Args>
constexpr decltype(auto) add_edge(node_type __u, node_type __v,
_Args &&...__args) noexcept {
base_type::add_edge(__v, __u, __args...);
return base_type::add_edge(__u, __v, std::forward<_Args>(__args)...);
}
};
template <class _Weight, class _Attr = null_attribute,
class _List = std::vector<weighted_edge<_Weight, _Attr>>>
class weighted_graph : public graph<_Attr, _List> {
using graph<_Attr, _List>::graph;
};
} // namespace workspace
#line 9 "Library\\src\\graph\\forest.h"
namespace workspace {
template <class _Attr = null_attribute, class _List = std::vector<edge<_Attr>>>
class forest : public graph<_Attr, _List> {
using base_type = graph<_Attr, _List>;
public:
using typename base_type::edge_type;
using typename base_type::node_type;
using typename base_type::size_type;
using weight_type = typename edge_type::value_type;
using base_type::size;
forest(size_type __n = 0) : base_type(__n) {}
auto distance_from(node_type __v) const noexcept {
std::vector<weight_type> __dist(size(),
std::numeric_limits<weight_type>::max());
auto __stack = new edge_type[size()], __top = __stack;
__top->head = __v, __top->tail = size();
++__top;
__dist[__v] = {};
while (__top != __stack) {
auto __p = *--__top;
for (const auto &__e : (*this)[__p.head]) {
if (__e.head == __p.tail) continue;
__dist[__e.head] = __dist[__e.tail] + __e.weight;
*__top++ = __e;
}
}
delete[] __stack;
return __dist;
}
auto parents(node_type __r) const noexcept {}
auto diameter(node_type __v = 0) noexcept {
auto __dist = distance_from(__v);
node_type __u = __v;
for (node_type __i = 0; __i != size(); ++__i)
if (__dist[__u] < __dist[__i]) __u = __i;
}
};
} // namespace workspace
#line 33 "atcoder-workspace\\yuki.cc"
namespace workspace {
void main() {
// start here!
input n;
forest tree(n);
for (auto i : range(1, tree.size())) {
tree.add_edge(input() - 1, input() - 1);
}
vector<i32> non(tree.size());
for (auto [s, t] : reversed(tree.dfs(0))) {
if (!non[t]) non[s] = 1;
}
cout << accumulate(begin(non), end(non), 0) << "\n";
}
} // namespace workspace