/* made by amunduzbaev */
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
using namespace std;
//~ using namespace __gnu_pbds;
#define ff first
#define ss second
#define vv vector
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define mem(arr, v) memset(arr, v, sizeof arr)
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T,
//~ null_type, less_equal<T>, rb_tree_tag,
//~ tree_order_statistics_node_update> ordered_set;
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int dp[N][2][2];
vii edges[N];
void dfs(int u, int p = -1){
vii ch;
for(auto x : edges[u]){
if(x == p) continue;
ch.pb(x), dfs(x, u);
}
if(!sz(ch)) dp[u][a[u]][0] = 0, dp[u][a[u] ^ 1][1] = 1;
if(sz(ch) == 1){ int x = ch[0];
dp[u][a[u]][0] = dp[x][0][0];
dp[u][a[u]^1][0] = dp[x][0][1];
dp[u][a[u]^1][1] = dp[x][1][0] + 1;
} if(sz(ch) == 2){
int lx = ch[0], rx = ch[1];
dp[u][a[u]][0] = min(dp[lx][0][0] + dp[rx][0][0], dp[lx][0][1] + dp[rx][0][1]);
dp[u][a[u]][1] = min(dp[lx][1][0] + dp[rx][1][1], dp[lx][1][1] + dp[rx][1][0]) + 1;
dp[u][a[u]^1][0] = min(dp[lx][0][1] + dp[rx][0][0], dp[lx][0][0] + dp[rx][0][1]);
dp[u][a[u]^1][1] = min(dp[lx][1][1] + dp[rx][1][1], dp[lx][1][0] + dp[rx][1][0]) + 1;
} umin(dp[u][0][0], mod), umin(dp[u][0][1], mod), umin(dp[u][1][0], mod), umin(dp[u][1][1], mod);
}
void solve(int t_case){
cin>>n;
for(int i=1;i<n;i++){
int a, b; cin>>a>>b;
edges[a].pb(b), edges[b].pb(a);
} for(int i=1;i<=n;i++) cin>>a[i];
int root = 1;
for(int i=1;i<=n;i++) dp[i][0][0] = dp[i][0][1] = dp[i][1][0] = dp[i][1][1] = mod;
for(int i=1;i<=n;i++) if(sz(edges[i]) <= 2ll) { root = i; break; }
dfs(root);
int res = min(dp[root][0][0], dp[root][0][1]);
if(res == mod) cout<<"impossible\n";
else cout<<res<<"\n";
}
signed main(){
NeedForSpeed
if(MULTI){
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
} else solve(1);
return 0;
}
Compilation message
xanadu.cpp: In function 'void usaco(std::string)':
xanadu.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xanadu.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
4940 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
4940 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
69 ms |
24356 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
85 ms |
24352 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
4940 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
