답안 #760985

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760985 2023-06-19T01:46:06 Z jekuissolar743_ The Xana coup (BOI21_xanadu) C++14
100 / 100
107 ms 15216 KB
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+5;
const int INF = 1e5+10;
int dp[MAXN][2][2],n;
bool state[MAXN];
vector<int> adj[MAXN];


//let dp[u][p][t] be the minimum number of moves to turn off node u and its subtree where p is true if the parent toggled their bulb and false otherwise, t is if we intend to toggle the current nod

void dfs(int node, int par){
  for(int i = 0; i <= 1; i++){
    dp[node][i][state[node] ^ i] = i;
    dp[node][i][state[node] ^ i ^ 1] = INF;
  }
  for(int child:adj[node]){
    if(child == par) continue;

    dfs(child,node);

    for(int i = 0; i <= 1; i++){

      int odd = dp[node][i][1];
      int even = dp[node][i][0];
      
      dp[node][i][0] = min({INF, even + dp[child][0][i], odd + dp[child][1][i]});
      dp[node][i][1] = min({INF, even + dp[child][1][i], odd + dp[child][0][i]});
      
    }
  }
}

int main() {
  cin >> n;
  for(int i = 0; i < n-1; i++){
    int x,y; 
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  for(int i = 1; i <= n; i ++){
    cin >> state[i];
  }
  dfs(1,-1);
  int ans = min(dp[1][0][0],dp[1][1][0]);
  if(ans >= INF){
    cout << "impossible\n";
  }
  else{
    cout << ans << "\n";
  }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2660 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 15088 KB Output is correct
2 Correct 91 ms 14988 KB Output is correct
3 Correct 107 ms 15160 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 15152 KB Output is correct
2 Correct 88 ms 14956 KB Output is correct
3 Correct 82 ms 15216 KB Output is correct
4 Correct 66 ms 6888 KB Output is correct
5 Correct 78 ms 7296 KB Output is correct
6 Correct 78 ms 7420 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 24 ms 4204 KB Output is correct
9 Correct 75 ms 7340 KB Output is correct
10 Correct 98 ms 7508 KB Output is correct
11 Correct 70 ms 7860 KB Output is correct
12 Correct 80 ms 8152 KB Output is correct
13 Correct 73 ms 7092 KB Output is correct
14 Correct 76 ms 7416 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2640 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2660 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 90 ms 15088 KB Output is correct
18 Correct 91 ms 14988 KB Output is correct
19 Correct 107 ms 15160 KB Output is correct
20 Correct 84 ms 15152 KB Output is correct
21 Correct 88 ms 14956 KB Output is correct
22 Correct 82 ms 15216 KB Output is correct
23 Correct 66 ms 6888 KB Output is correct
24 Correct 78 ms 7296 KB Output is correct
25 Correct 78 ms 7420 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 24 ms 4204 KB Output is correct
28 Correct 75 ms 7340 KB Output is correct
29 Correct 98 ms 7508 KB Output is correct
30 Correct 70 ms 7860 KB Output is correct
31 Correct 80 ms 8152 KB Output is correct
32 Correct 73 ms 7092 KB Output is correct
33 Correct 76 ms 7416 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 1 ms 2644 KB Output is correct
40 Correct 1 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2644 KB Output is correct
44 Correct 1 ms 2644 KB Output is correct
45 Correct 67 ms 15076 KB Output is correct
46 Correct 72 ms 14996 KB Output is correct
47 Correct 90 ms 15216 KB Output is correct
48 Correct 64 ms 6852 KB Output is correct
49 Correct 64 ms 7288 KB Output is correct
50 Correct 99 ms 7348 KB Output is correct
51 Correct 3 ms 2556 KB Output is correct
52 Correct 23 ms 4196 KB Output is correct
53 Correct 89 ms 7344 KB Output is correct
54 Correct 84 ms 7484 KB Output is correct
55 Correct 82 ms 7880 KB Output is correct
56 Correct 92 ms 8092 KB Output is correct
57 Correct 78 ms 7112 KB Output is correct
58 Correct 74 ms 7300 KB Output is correct
59 Correct 34 ms 4176 KB Output is correct
60 Correct 58 ms 6876 KB Output is correct
61 Correct 63 ms 7372 KB Output is correct
62 Correct 84 ms 7480 KB Output is correct
63 Correct 71 ms 7504 KB Output is correct
64 Correct 77 ms 7468 KB Output is correct
65 Correct 83 ms 7872 KB Output is correct
66 Correct 60 ms 7864 KB Output is correct
67 Correct 61 ms 7796 KB Output is correct
68 Correct 71 ms 7996 KB Output is correct
69 Correct 101 ms 7812 KB Output is correct
70 Correct 59 ms 7748 KB Output is correct