oj.uz

답안 #861976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861976 2023-10-17T10:01:14 Z Trisanu_Das The Xana coup (BOI21_xanadu) C++17
100 / 100
 81 ms 43688 KB 
#include <bits/stdc++.h>
using namespace std;
 
int N, L[1000000], dp[1000000][2][2];
vector<int> e[1000000];
 
void dfs(int i = 0, int p = -1) {
  for (int s = 0; s < 2; s++) {
    dp[i][s][L[i] ^ s] = s;
    dp[i][s][L[i] ^ s ^ 1] = N + 1;
  }
  for (int j : e[i])
    if (j != p) {
      dfs(j, i);
      for (int s = 0; s < 2; s++) {
        int dp0 = dp[i][s][0], dp1 = dp[i][s][1];
        dp[i][s][0] = min(N + 1, min(dp0 + dp[j][0][s], dp1 + dp[j][1][s]));
        dp[i][s][1] = min(N + 1, min(dp0 + dp[j][1][s], dp1 + dp[j][0][s]));
      }
    }
}
 
int main() {
  cin >> N;
  int A, B;
  for (int i = 0; i < N - 1; i++) {
    cin >> A >> B;
    A--, B--;
    e[A].push_back(B);
    e[B].push_back(A);
  }
  for (int i = 0; i < N; i++) cin >> L[i];
  dfs();
  int r = min(dp[0][0][0], dp[0][1][0]);
  if (r > N) cout << "impossible\n";
  else cout << r << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27228 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 5 ms 27228 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27300 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27228 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 5 ms 27228 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27300 KB Output is correct
6 Correct 5 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27224 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 6 ms 27228 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27252 KB Output is correct
16 Correct 5 ms 27224 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 42068 KB Output is correct
2 Correct 73 ms 43376 KB Output is correct
3 Correct 73 ms 43688 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 42064 KB Output is correct
2 Correct 79 ms 43284 KB Output is correct
3 Correct 74 ms 43592 KB Output is correct
4 Correct 68 ms 35156 KB Output is correct
5 Correct 69 ms 35664 KB Output is correct
6 Correct 70 ms 35672 KB Output is correct
7 Correct 5 ms 27224 KB Output is correct
8 Correct 27 ms 30688 KB Output is correct
9 Correct 71 ms 35784 KB Output is correct
10 Correct 70 ms 35920 KB Output is correct
11 Correct 70 ms 36296 KB Output is correct
12 Correct 72 ms 36364 KB Output is correct
13 Correct 76 ms 35500 KB Output is correct
14 Correct 71 ms 35668 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 27228 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 5 ms 27228 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27300 KB Output is correct
6 Correct 5 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 5 ms 27228 KB Output is correct
9 Correct 5 ms 27224 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 6 ms 27228 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 5 ms 27228 KB Output is correct
14 Correct 5 ms 27228 KB Output is correct
15 Correct 5 ms 27252 KB Output is correct
16 Correct 5 ms 27224 KB Output is correct
17 Correct 73 ms 42068 KB Output is correct
18 Correct 73 ms 43376 KB Output is correct
19 Correct 73 ms 43688 KB Output is correct
20 Correct 78 ms 42064 KB Output is correct
21 Correct 79 ms 43284 KB Output is correct
22 Correct 74 ms 43592 KB Output is correct
23 Correct 68 ms 35156 KB Output is correct
24 Correct 69 ms 35664 KB Output is correct
25 Correct 70 ms 35672 KB Output is correct
26 Correct 5 ms 27224 KB Output is correct
27 Correct 27 ms 30688 KB Output is correct
28 Correct 71 ms 35784 KB Output is correct
29 Correct 70 ms 35920 KB Output is correct
30 Correct 70 ms 36296 KB Output is correct
31 Correct 72 ms 36364 KB Output is correct
32 Correct 76 ms 35500 KB Output is correct
33 Correct 71 ms 35668 KB Output is correct
34 Correct 5 ms 27224 KB Output is correct
35 Correct 5 ms 27296 KB Output is correct
36 Correct 5 ms 27224 KB Output is correct
37 Correct 6 ms 27280 KB Output is correct
38 Correct 5 ms 27228 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27228 KB Output is correct
41 Correct 5 ms 27228 KB Output is correct
42 Correct 5 ms 27292 KB Output is correct
43 Correct 5 ms 27228 KB Output is correct
44 Correct 5 ms 27252 KB Output is correct
45 Correct 74 ms 43604 KB Output is correct
46 Correct 72 ms 43348 KB Output is correct
47 Correct 81 ms 43600 KB Output is correct
48 Correct 68 ms 35372 KB Output is correct
49 Correct 80 ms 35920 KB Output is correct
50 Correct 71 ms 35868 KB Output is correct
51 Correct 5 ms 27228 KB Output is correct
52 Correct 26 ms 30804 KB Output is correct
53 Correct 73 ms 35784 KB Output is correct
54 Correct 73 ms 35920 KB Output is correct
55 Correct 74 ms 36296 KB Output is correct
56 Correct 72 ms 36584 KB Output is correct
57 Correct 66 ms 35408 KB Output is correct
58 Correct 70 ms 35664 KB Output is correct
59 Correct 26 ms 30812 KB Output is correct
60 Correct 64 ms 35412 KB Output is correct
61 Correct 79 ms 35924 KB Output is correct
62 Correct 71 ms 35920 KB Output is correct
63 Correct 71 ms 35928 KB Output is correct
64 Correct 73 ms 35924 KB Output is correct
65 Correct 69 ms 36180 KB Output is correct
66 Correct 75 ms 36440 KB Output is correct
67 Correct 65 ms 36044 KB Output is correct
68 Correct 66 ms 36272 KB Output is correct
69 Correct 65 ms 36044 KB Output is correct
70 Correct 67 ms 36076 KB Output is correct