답안 #525223

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525223 2022-02-11T06:51:00 Z pokmui9909 The Xana coup (BOI21_xanadu) C++17
100 / 100
56 ms 25168 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
const ll INF = 1e9 + 7;
ll N;
vector<ll> G[100005];
ll C[100005];
ll D[100005][2][2];
void dfs(ll u, ll p){
    D[u][0][C[u]] = 0, D[u][1][C[u] ^ 1] = 1;
    D[u][0][C[u] ^ 1] = D[u][1][C[u]] = INF;
    for(auto v : G[u]){ 
        if(v == p) continue;
        dfs(v, u);
        ll T[2][2];
        for(int i = 0; i < 2; i++){
            for(int j = 0; j < 2; j++){
                T[i][j] = INF;
                for(int k = 0; k < 2; k++){
                    T[i][j] = min(T[i][j], D[u][i][j ^ k] + D[v][k][i]);
                }
            }
        }
        for(int i = 0; i < 2; i++){
            for(int j = 0; j < 2; j++){
                D[u][i][j] = T[i][j];
            }
        }
    }
}
 
int main(){
    cin.tie(0) -> sync_with_stdio(false);
 
    cin >> N;
    for(int i = 1; i < N; i++){
        ll u, v; cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    for(int i = 1; i <= N; i++){
        cin >> C[i];
    }
    dfs(1, -1);
    ll r = min(D[1][0][0], D[1][1][0]);
    if(r <= N){
        cout << r << '\n';
    } else {
        cout << "impossible\n";
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2672 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2672 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 1 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2672 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 1 ms 2636 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 24908 KB Output is correct
2 Correct 52 ms 24748 KB Output is correct
3 Correct 55 ms 25168 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 24904 KB Output is correct
2 Correct 49 ms 24644 KB Output is correct
3 Correct 53 ms 25056 KB Output is correct
4 Correct 43 ms 10848 KB Output is correct
5 Correct 56 ms 11768 KB Output is correct
6 Correct 53 ms 11896 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 15 ms 5628 KB Output is correct
9 Correct 56 ms 11580 KB Output is correct
10 Correct 52 ms 11740 KB Output is correct
11 Correct 50 ms 12364 KB Output is correct
12 Correct 54 ms 12804 KB Output is correct
13 Correct 49 ms 11520 KB Output is correct
14 Correct 54 ms 12252 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2672 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 1 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 1 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2672 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 1 ms 2636 KB Output is correct
17 Correct 49 ms 24908 KB Output is correct
18 Correct 52 ms 24748 KB Output is correct
19 Correct 55 ms 25168 KB Output is correct
20 Correct 49 ms 24904 KB Output is correct
21 Correct 49 ms 24644 KB Output is correct
22 Correct 53 ms 25056 KB Output is correct
23 Correct 43 ms 10848 KB Output is correct
24 Correct 56 ms 11768 KB Output is correct
25 Correct 53 ms 11896 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 15 ms 5628 KB Output is correct
28 Correct 56 ms 11580 KB Output is correct
29 Correct 52 ms 11740 KB Output is correct
30 Correct 50 ms 12364 KB Output is correct
31 Correct 54 ms 12804 KB Output is correct
32 Correct 49 ms 11520 KB Output is correct
33 Correct 54 ms 12252 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2672 KB Output is correct
36 Correct 1 ms 2636 KB Output is correct
37 Correct 1 ms 2636 KB Output is correct
38 Correct 1 ms 2676 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 1 ms 2672 KB Output is correct
43 Correct 1 ms 2636 KB Output is correct
44 Correct 2 ms 2668 KB Output is correct
45 Correct 53 ms 25008 KB Output is correct
46 Correct 49 ms 24696 KB Output is correct
47 Correct 51 ms 25156 KB Output is correct
48 Correct 47 ms 10856 KB Output is correct
49 Correct 52 ms 11720 KB Output is correct
50 Correct 52 ms 11844 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 14 ms 5704 KB Output is correct
53 Correct 52 ms 11628 KB Output is correct
54 Correct 50 ms 11720 KB Output is correct
55 Correct 48 ms 12400 KB Output is correct
56 Correct 53 ms 12772 KB Output is correct
57 Correct 49 ms 11504 KB Output is correct
58 Correct 50 ms 12092 KB Output is correct
59 Correct 15 ms 5620 KB Output is correct
60 Correct 43 ms 10692 KB Output is correct
61 Correct 47 ms 11468 KB Output is correct
62 Correct 50 ms 11604 KB Output is correct
63 Correct 56 ms 11588 KB Output is correct
64 Correct 51 ms 11552 KB Output is correct
65 Correct 45 ms 12092 KB Output is correct
66 Correct 49 ms 12016 KB Output is correct
67 Correct 38 ms 11728 KB Output is correct
68 Correct 37 ms 11732 KB Output is correct
69 Correct 35 ms 11748 KB Output is correct
70 Correct 38 ms 11840 KB Output is correct