This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
// #define int long long
#define fi first
#define se second
#define keish ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int n, u, v, x;
signed main(){
keish;
cin >> n;
vector<vector<int>> e(n);
for(int i = 1; i < n; i++){
cin >> u >> v; u--, v--;
e[u].push_back(v);
e[v].push_back(u);
}
vector<int> v(n);
for(auto &x : v) cin >> x;
auto can = [&](vector<int> v, int mask){
int i = 0;
while(mask){
if(mask & 1){
v[i] ^= 1;
for(auto x : e[i]){
v[x] ^= 1;
}
}
mask >>= 1; i++;
}
bool ok = 1;
for(auto x : v) ok &= !x;
return ok;
};
int ans = 1e9;
for(int i = 0; i < 1 << n; i++){
if(can(v, i)){
ans = min(ans, __builtin_popcount(i));
}
}
if(ans == 1e9) cout << "impossible\n";
else cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |