結果
問題 | No.912 赤黒木 |
ユーザー |
![]() |
提出日時 | 2019-10-19 14:19:16 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 282 ms / 3,000 ms |
コード長 | 11,372 bytes |
コンパイル時間 | 1,829 ms |
コンパイル使用メモリ | 129,484 KB |
実行使用メモリ | 64,128 KB |
最終ジャッジ日時 | 2024-06-27 03:53:06 |
合計ジャッジ時間 | 10,462 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
コンパイルメッセージ
main.cpp:297:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] 297 | main() | ^~~~
ソースコード
#ifdef stderr_path#define LOCAL#endif#ifdef LOCAL#define _GLIBCXX_DEBUG#else#pragma GCC optimize("Ofast")#endif#include <algorithm>#include <bitset>#include <cassert>#include <chrono>#include <complex>#include <cstring>#include <deque>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <unordered_map>#include <unordered_set>// #define NDEBUG#define __precision__ 10#define debug_stream std::cerr#define iostream_untie true#define all(v) std::begin(v), std::end(v)#define rall(v) std::rbegin(v), std::rend(v)#define __odd(n) ((n) & 1)#define __even(n) (not __odd(n))#define __popcount(n) __builtin_popcountll(n)#define __clz32(n) __builtin_clz(n)#define __clz64(n) __builtin_clzll(n)#define __ctz32(n) __builtin_ctz(n)#define __ctz64(n) __builtin_ctzll(n)using i32 = int_fast32_t;using i64 = int_fast64_t;using ui32 = uint_fast32_t;using ui64 = uint_fast64_t;using pii = std::pair<i32, i32>;using pll = std::pair<i64, i64>;template <class T> using heap = std::priority_queue<T>;template <class T> using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>;template <class T> constexpr T inf = std::numeric_limits<T>::max() / T(2) - T(1123456);namespace execution{std::chrono::system_clock::time_point start_time, end_time;void print_elapsed_time(){end_time = std::chrono::system_clock::now();std::cerr << "\n----- Exec time : ";std::cerr << std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time).count();std::cerr << " ms -----\n\n";}struct setupper{setupper(){if(iostream_untie){std::ios::sync_with_stdio(false);std::cin.tie(nullptr);}std::cout << std::fixed << std::setprecision(__precision__);#ifdef stderr_pathif(freopen(stderr_path, "a", stderr)){std::cerr << std::fixed << std::setprecision(__precision__);}#endif#ifdef stdout_pathif(not freopen(stdout_path, "w", stdout)){freopen("CON", "w", stdout);std::cerr << "Failed to open the stdout file\n\n";}std::cout << "";#endif#ifdef stdin_pathif(not freopen(stdin_path, "r", stdin)){freopen("CON", "r", stdin);std::cerr << "Failed to open the stdin file\n\n";}#endif#ifdef LOCALstd::cerr << "----- stderr at LOCAL -----\n\n";atexit(print_elapsed_time);start_time = std::chrono::system_clock::now();#elsefclose(stderr);#endif}} __setupper;} // namespace executionclass myclock_t{std::chrono::system_clock::time_point built_pt, last_pt;int built_ln, last_ln;std::string built_func, last_func;bool is_built;public:explicit myclock_t() : is_built(false) {}void build(int crt_ln, const std::string &crt_func){is_built = true;last_pt = built_pt = std::chrono::system_clock::now();last_ln = built_ln = crt_ln, last_func = built_func = crt_func;}void set(int crt_ln, const std::string &crt_func){if(is_built){last_pt = std::chrono::system_clock::now();last_ln = crt_ln, last_func = crt_func;}else{debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "<< "myclock_t::set failed (yet to be built!)\n";}}void get(int crt_ln, const std::string &crt_func){if(is_built){std::chrono::system_clock::time_point crt_pt(std::chrono::system_clock::now());int64_t diff =std::chrono::duration_cast<std::chrono::milliseconds>(crt_pt -last_pt).count();debug_stream << diff << " ms elapsed from"<< " [ " << last_ln << " : " << last_func << " ]";if(last_ln == built_ln) debug_stream << " (when built)";debug_stream << " to"<< " [ " << crt_ln << " : " << crt_func << " ]"<< "\n";last_pt = built_pt, last_ln = built_ln, last_func = built_func;}else{debug_stream << "[ " << crt_ln << " : " << crt_func << " ] "<< "myclock_t::get failed (yet to be built!)\n";}}};#ifdef LOCALmyclock_t __myclock;#define build_clock() __myclock.build(__LINE__, __func__)#define set_clock() __myclock.set(__LINE__, __func__)#define get_clock() __myclock.get(__LINE__, __func__)#else#define build_clock() ((void)0)#define set_clock() ((void)0)#define get_clock() ((void)0)#endifnamespace std{template <class RAitr> void rsort(RAitr __first, RAitr __last) { sort(__first, __last, greater<>()); }template <class T> size_t hash_combine(size_t seed, T const &key) { return seed ^ (hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2)); }template <class T, class U>struct hash<pair<T, U>>{size_t operator()(pair<T, U> const &pr) const{return hash_combine(hash_combine(0, pr.first), pr.second);}};template <class tuple_t, size_t index = tuple_size<tuple_t>::value - 1>struct tuple_hash_calc{static size_t apply(size_t seed, tuple_t const &t){return hash_combine(tuple_hash_calc<tuple_t, index - 1>::apply(seed, t),get<index>(t));}};template <class tuple_t>struct tuple_hash_calc<tuple_t, 0>{static size_t apply(size_t seed, tuple_t const &t){return hash_combine(seed, get<0>(t));}};template <class... T>struct hash<tuple<T...>>{size_t operator()(tuple<T...> const &t) const { return tuple_hash_calc<tuple<T...>>::apply(0, t); }};template <class T, class U> istream &operator>>(std::istream &s, pair<T, U> &p) { return s >> p.first >> p.second; }template <class T, class U> ostream &operator<<(std::ostream &s, const pair<T, U> &p) { return s << p.first << " " << p.second; }template <class T> istream &operator>>(istream &s, vector<T> &v) { for(T &e : v) s >> e; return s; }template <class T>ostream &operator<<(ostream &s, const vector<T> &v){bool is_front = true;for(const T &e : v){if(not is_front) s << ' ';else is_front = false;s << e;}return s;}template <class tuple_t, size_t index>struct tupleos{static ostream &apply(ostream &s, const tuple_t &t){tupleos<tuple_t, index - 1>::apply(s, t);return s << " " << get<index>(t);}};template <class tuple_t>struct tupleos<tuple_t, 0>{static ostream &apply(ostream &s, const tuple_t &t) { return s << get<0>(t); }};template <class... T>ostream &operator<<(ostream &s, const tuple<T...> &t){ return tupleos<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(s, t); }template <> ostream &operator<<(ostream &s, const tuple<> &t) { return s; }string revstr(string str) { reverse(str.begin(), str.end()); return str; }} // namespace std#ifdef LOCAL#define dump(...) \debug_stream << "[ " << __LINE__ << " : " << __FUNCTION__ << " ]\n", \dump_func(#__VA_ARGS__, __VA_ARGS__)template <class T>void dump_func(const char *ptr, const T &x){debug_stream << '\t';for(char c = *ptr; c != '\0'; c = *++ptr){if(c != ' ') debug_stream << c;}debug_stream << " : " << x << '\n';}template <class T, class... rest_t>void dump_func(const char *ptr, const T &x, rest_t... rest){debug_stream << '\t';for(char c = *ptr; c != ','; c = *++ptr){if(c != ' ') debug_stream << c;}debug_stream << " : " << x << ",\n";dump_func(++ptr, rest...);}#else#define dump(...) ((void)0)#endiftemplate <class P>void read_range(P __first, P __second) { for(P i = __first; i != __second; ++i) std::cin >> *i; }template <class P> void write_range(P __first, P __second){ for(P i = __first; i != __second; std::cout << (++i == __second ? '\n' : ' ')) std::cout << *i; }// substitue y for x if x > y.template <class T> bool chmin(T &x, const T &y) { return x > y ? x = y, true : false; }// substitue y for x if x < y.template <class T> bool chmax(T &x, const T &y) { return x < y ? x = y, true : false; }// binary search.int_fast64_t bin(int_fast64_t ok, int_fast64_t ng,const std::function<bool(int_fast64_t)> &f){while(std::abs(ok - ng) > 1){int_fast64_t mid = (ok + ng) / 2;(f(mid) ? ok : ng) = mid;}return ok;}// be careful that val is type-sensitive.template <class T, class A, size_t N> void init(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); }template <class A> void reset(A &array) { memset(array, 0, sizeof(array)); }/* The main code follows. */using namespace std;main(){void __solve();ui32 t = 1;#ifdef LOCALt = 1;#endif// cin >> t;while(t--){__solve();}}vector<i32> t[1<<18];bool deg[1<<18];i32 dp[1<<18][2][4];void dfs(i32 v,i32 p){init(dp[v],inf<i32>);dp[v][deg[v]][deg[v]]=0;for(i32 u : t[v]){if(u!=p){dfs(u,v);i32 nx[2][4];init(nx,inf<i32>);for(i32 i=3; i>=0; --i){for(i32 j=0; j<=3; ++j){for(i32 k=0; k<2; k++){for(i32 l=0; l<2; l++){i32 dv=dp[v][k][i],du=dp[u][l][j];if(i+j<=3) chmin(nx[k][i+j],dv+du);if(k!=l and i+j<=3) chmin(nx[!k][i+j],du+dv+1);}}if(i+j<=5 and i+j>=2){chmin(nx[0][i+j-2],dp[v][1][i]+dp[u][1][j]+1);}if(i+j<=1){chmin(nx[1][i+j+2],dp[v][0][i]+dp[u][0][j]+1);}}}swap(nx,dp[v]);}}}void __solve(){i32 n; cin>>n;for(i32 i = 0; i < n-1; ++i){i32 u,v; cin>>u>>v; u--,v--;t[u].emplace_back(v);t[v].emplace_back(u);}for(i32 i=1; i<n; i++){i32 u,v; cin>>u>>v; u--,v--;deg[u]^=1,deg[v]^=1;}dfs(0,-1);i32 ans=inf<i32>;for(i32 i = 0; i < 2; ++i){for(i32 j = 0; j <= 2; ++j){chmin(ans,dp[0][i][j]);}}cout << ans+n-1 << "\n";}