oj.uz

답안 #807547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807547 2023-08-04T19:14:53 Z dong_liu The Xana coup (BOI21_xanadu) C++17
100 / 100
 48 ms 20048 KB 
#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) static_cast<int>(v.size())
#define all(v) (v).begin(), (v).end()
typedef pair<int, int> pi;
typedef long long ll;
typedef vector<int> vi;

const int N = 1e5, INF = 1e9;

int n, a[N];
ar<int, 2> dp[N][2];
vi g[N];

ar<int, 2> operator+(const ar<int, 2> &u, const ar<int, 2> &v) {
  return {min({INF, u[0] + v[0], u[1] + v[1]}),
          min({INF, u[0] + v[1], u[1] + v[0]})};
}

void dfs(int p, int i) {
  ar<int, 2> op0{0, INF}, op1{INF, 1};
  for (int j : g[i])
    if (p ^ j) {
      dfs(i, j);
      op0 = op0 + dp[j][0];
      op1 = op1 + dp[j][1];
    }
  if (a[i]) {
    swap(op0[0], op0[1]);
    swap(op1[0], op1[1]);
  }
  dp[i][0][0] = op0[0];
  dp[i][1][0] = op0[1];
  dp[i][0][1] = op1[0];
  dp[i][1][1] = op1[1];
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int h = 0; h < n - 1; h++) {
    int i, j;
    cin >> i >> j, i--, j--;
    g[i].push_back(j), g[j].push_back(i);
  }
  for (int i = 0; i < n; i++) cin >> a[i];
  dfs(-1, 0);
  int x = min(dp[0][0][0], dp[0][0][1]);
  if (x == INF)
    cout << "impossible\n";
  else
    cout << x << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2672 KB Output is correct
2 Correct 2 ms 2680 KB Output is correct
3 Correct 3 ms 2676 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 19896 KB Output is correct
2 Correct 34 ms 19748 KB Output is correct
3 Correct 42 ms 19980 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 19916 KB Output is correct
2 Correct 35 ms 19628 KB Output is correct
3 Correct 35 ms 19972 KB Output is correct
4 Correct 37 ms 8344 KB Output is correct
5 Correct 33 ms 8900 KB Output is correct
6 Correct 34 ms 9084 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 12 ms 4820 KB Output is correct
9 Correct 32 ms 8972 KB Output is correct
10 Correct 33 ms 9216 KB Output is correct
11 Correct 32 ms 9764 KB Output is correct
12 Correct 33 ms 10028 KB Output is correct
13 Correct 29 ms 8688 KB Output is correct
14 Correct 32 ms 8980 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2672 KB Output is correct
2 Correct 2 ms 2680 KB Output is correct
3 Correct 3 ms 2676 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2672 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 34 ms 19896 KB Output is correct
18 Correct 34 ms 19748 KB Output is correct
19 Correct 42 ms 19980 KB Output is correct
20 Correct 34 ms 19916 KB Output is correct
21 Correct 35 ms 19628 KB Output is correct
22 Correct 35 ms 19972 KB Output is correct
23 Correct 37 ms 8344 KB Output is correct
24 Correct 33 ms 8900 KB Output is correct
25 Correct 34 ms 9084 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 12 ms 4820 KB Output is correct
28 Correct 32 ms 8972 KB Output is correct
29 Correct 33 ms 9216 KB Output is correct
30 Correct 32 ms 9764 KB Output is correct
31 Correct 33 ms 10028 KB Output is correct
32 Correct 29 ms 8688 KB Output is correct
33 Correct 32 ms 8980 KB Output is correct
34 Correct 2 ms 2684 KB Output is correct
35 Correct 2 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 2 ms 2680 KB Output is correct
40 Correct 2 ms 2676 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 1 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 37 ms 19964 KB Output is correct
46 Correct 34 ms 19748 KB Output is correct
47 Correct 35 ms 20048 KB Output is correct
48 Correct 29 ms 8384 KB Output is correct
49 Correct 48 ms 9000 KB Output is correct
50 Correct 33 ms 9056 KB Output is correct
51 Correct 1 ms 2644 KB Output is correct
52 Correct 11 ms 4820 KB Output is correct
53 Correct 33 ms 8976 KB Output is correct
54 Correct 32 ms 9128 KB Output is correct
55 Correct 34 ms 9764 KB Output is correct
56 Correct 44 ms 10060 KB Output is correct
57 Correct 36 ms 8604 KB Output is correct
58 Correct 31 ms 9080 KB Output is correct
59 Correct 12 ms 4804 KB Output is correct
60 Correct 29 ms 8504 KB Output is correct
61 Correct 44 ms 9052 KB Output is correct
62 Correct 32 ms 9080 KB Output is correct
63 Correct 33 ms 9100 KB Output is correct
64 Correct 33 ms 9072 KB Output is correct
65 Correct 28 ms 9512 KB Output is correct
66 Correct 29 ms 9624 KB Output is correct
67 Correct 28 ms 9412 KB Output is correct
68 Correct 25 ms 9380 KB Output is correct
69 Correct 25 ms 9420 KB Output is correct
70 Correct 26 ms 9444 KB Output is correct