結果
問題 | No.912 赤黒木 |
ユーザー |
![]() |
提出日時 | 2019-10-18 21:58:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 503 ms / 3,000 ms |
コード長 | 2,926 bytes |
コンパイル時間 | 2,508 ms |
コンパイル使用メモリ | 203,384 KB |
最終ジャッジ日時 | 2025-01-07 22:52:54 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
コンパイルメッセージ
main.cpp: In function ‘void read()’: main.cpp:67:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 67 | scanf("%d%d",&a,&b); | ~~~~~^~~~~~~~~~~~~~ main.cpp: In function ‘int main()’: main.cpp:99:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 99 | scanf("%d",&n); | ~~~~~^~~~~~~~~
ソースコード
#include <bits/stdc++.h>#define fi first#define se second#define rep(i,n) for(int i = 0; i < (n); ++i)#define rrep(i,n) for(int i = 1; i <= (n); ++i)#define drep(i,n) for(int i = (n)-1; i >= 0; --i)#define srep(i,s,t) for (int i = s; i < t; ++i)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define maxs(x,y) (x = max(x,y))#define mins(x,y) (x = min(x,y))#define limit(x,l,r) max(l,min(x,r))#define lims(x,l,r) (x = max(l,min(x,r)))#define isin(x,l,r) ((l) <= (x) && (x) < (r))#define pb push_back#define eb emplace_back#define sz(x) (int)(x).size()#define pcnt __builtin_popcountll#define uni(x) x.erase(unique(rng(x)),x.end())#define snuke srand((unsigned)clock()+(unsigned)time(NULL));#define show(x) cout<<#x<<" = "<<x<<endl;#define PQ(T) priority_queue<T,v(T),greater<T> >#define bn(x) ((1<<x)-1)#define dup(x,y) (((x)+(y)-1)/(y))#define newline puts("")#define v(T) vector<T>#define vv(T) v(v(T))using namespace std;typedef long long int ll;typedef unsigned uint;typedef unsigned long long ull;typedef pair<int,int> P;typedef tuple<int,int,int> T;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<ll> vl;typedef vector<P> vp;typedef vector<T> vt;inline int in() { int x; scanf("%d",&x); return x;}template<typename T>inline istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#define dame { puts("-1"); return 0;}#define yn {puts("YES");}else{puts("NO");}const int MX = 200005;vvi to;vvi t2;vi x;int n;void read() {to = vvi(n);rep(i,n-1) {int a,b;scanf("%d%d",&a,&b);--a; --b;to[a].pb(b);to[b].pb(a);}}vi dp[MX];int dfs(int v, int p=-1) {int res = x[v];vi d(3,INF);d[0] = 0;if (x[v]) d[1] = 0;for (int u : to[v]) {if (u == p) continue;int r = dfs(u,v);res += r;vi e(3,INF); swap(d,e);vi& a = dp[u];rep(i,3)rep(j,3) {int ni = i+j;if (ni >= 3) continue;mins(d[ni],e[i]+a[j]);}}rep(i,3) if ((i+res)&1) d[i]++;dp[v] = d;// cerr<<v<<" "<<d<<endl;return res;}int main() {scanf("%d",&n);read();t2 = to;read();x = vi(n);rep(i,n) if (sz(to[i])%2) x[i] = 1;to = t2;dfs(0);cout<<dp[0][2]+(n-1)<<endl;return 0;}