結果
問題 | No.912 赤黒木 |
ユーザー |
![]() |
提出日時 | 2019-10-28 20:48:26 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 434 ms / 3,000 ms |
コード長 | 3,902 bytes |
コンパイル時間 | 2,077 ms |
コンパイル使用メモリ | 179,896 KB |
実行使用メモリ | 70,912 KB |
最終ジャッジ日時 | 2024-09-14 21:18:05 |
合計ジャッジ時間 | 13,272 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;/*#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace __gnu_pbds;template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)#define REP(i, n) FOR(i,0,n)#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)#define IREP(i, n) IFOR(i,0,n)#define Sort(v) sort(v.begin(), v.end())#define Reverse(v) reverse(v.begin(), v.end())#define all(v) v.begin(),v.end()#define SZ(v) ((int)v.size())#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))#define Max(a, b) a = max(a, b)#define Min(a, b) a = min(a, b)#define bit(n) (1LL<<(n))#define bit_exist(x, n) ((x >> n) & 1)#define debug(x) cout << #x << "=" << x << endl;#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout <<endl;}#define pb push_back#define f first#define s second#define int long long#define INF 1000000000000000000template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout <<endl; }; return os; }template<typename T> void Out(T x) { cout << x << endl; }template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }using vec = vector<int>;using mat = vector<vec>;using Pii = pair<int, int>;using PiP = pair<int, Pii>;using PPi = pair<Pii, int>;using bools = vector<bool>;using pairs = vector<Pii>;//int dx[4] = {1,0,-1,0};//int dy[4] = {0,1,0,-1};//char d[4] = {'D','R','U','L'};const int mod = 1000000007;//const int mod = 998244353;//#define Add(x, y) x = (x + (y)) % mod//#define Mult(x, y) x = (x * (y)) % modstruct edge{int to, cost, id;};class Graph{public:int N;vector<vector<edge>> G;Graph(int N): N(N){G = vector<vector<edge>>(N, vector<edge>(0));}void add_Directed_edge(int from, int to, int cost = 1, int id = 0){G[from].push_back(edge({to, cost, id}));}void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){add_Directed_edge(v1, v2, cost, id);add_Directed_edge(v2, v1, cost, id);}vec cnt;mat dp;void dfs(int v = 0, int p = -1){REP(i, cnt[v] + 1) dp[v][i] = 0;for(auto e: G[v]) if(e.to != p){dfs(e.to, v);vec dp0(3, INF);REP(i, min(2LL, cnt[v]) + 1) REP(j, min(2LL, cnt[e.to]) + 1){if(i + j <= 2) Min(dp0[i + j], dp[v][i] + dp[e.to][j] + (cnt[e.to] - j) % 2);}cnt[v] += cnt[e.to];dp[v].swap(dp0);}}};signed main(){int N; cin >> N;Graph R(N), B(N);REP(i, N - 1){int a, b; cin >> a >> b;R.add_Undirected_edge(a - 1, b - 1);}REP(i, N - 1){int a, b; cin >> a >> b;B.add_Undirected_edge(a - 1, b - 1);}vec cnt(N);REP(i, N) cnt[i] = SZ(B.G[i]) % 2;R.cnt = cnt;R.dp = mat(N, vec(3, INF));R.dfs();Out(R.dp[0][2] + N - 1);return 0;}