#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAX=1e9;
int n;
vector<vector<int>> adj;
bool can(vector<int> c, int mask) {
int i=0;
while(mask) {
if(mask&1) {
c[i]^=1;
for(int p : adj[i]) c[p]^=1;
}
mask>>=1; i++;
}
int sum=0;
for(int p : c) sum+=p;
return sum==0;
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n; adj.resize(n);
for(int i=1; i<n; i++) {
int u, v; cin >> u >> v; --u; --v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans=MAX;
vector<int> c(n); for(int &p : c) cin >> p;
for(int i=0; i<(1 << n); i++)
if(can(c, i)) ans=min(ans, (int)__builtin_popcount(i));
if(ans>=MAX) cout << "impossible\n";
else cout << ans << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
212 KB |
Output is correct |
3 |
Correct |
114 ms |
212 KB |
Output is correct |
4 |
Correct |
117 ms |
300 KB |
Output is correct |
5 |
Correct |
113 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
212 KB |
Output is correct |
3 |
Correct |
114 ms |
212 KB |
Output is correct |
4 |
Correct |
117 ms |
300 KB |
Output is correct |
5 |
Correct |
113 ms |
212 KB |
Output is correct |
6 |
Correct |
14 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
280 KB |
Output is correct |
8 |
Correct |
112 ms |
300 KB |
Output is correct |
9 |
Correct |
117 ms |
212 KB |
Output is correct |
10 |
Correct |
128 ms |
300 KB |
Output is correct |
11 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1081 ms |
7272 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1075 ms |
7216 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
212 KB |
Output is correct |
3 |
Correct |
114 ms |
212 KB |
Output is correct |
4 |
Correct |
117 ms |
300 KB |
Output is correct |
5 |
Correct |
113 ms |
212 KB |
Output is correct |
6 |
Correct |
14 ms |
212 KB |
Output is correct |
7 |
Correct |
2 ms |
280 KB |
Output is correct |
8 |
Correct |
112 ms |
300 KB |
Output is correct |
9 |
Correct |
117 ms |
212 KB |
Output is correct |
10 |
Correct |
128 ms |
300 KB |
Output is correct |
11 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |