oj.uz

답안 #639808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639808 2022-09-11T18:23:37 Z null_awe The Xana coup (BOI21_xanadu) C++14
100 / 100
 137 ms 41912 KB 
#include <iostream>
#include <vector>
#include <climits>
using namespace std;

#define vi vector<int>
#define vvi vector<vi>

vvi adj;
vi on;

vvi dfs(int v, int p) {
  vvi ans = vvi(2, vi(2, -1));
  bool start = false;
  for (int u : adj[v]) {
    if (u == p) continue;
    vvi res = dfs(u, v);
    if (!start) {
      ans = res, start = true;
      continue;
    }
    vvi nxt = vvi(2, vi(2, INT_MAX));
    for (int i = 0; i < 2; ++i) {
      for (int j = 0; j < 2; ++j)
        if (min(ans[i][j], res[i][j]) >= 0)
          nxt[i][0] = min(nxt[i][0], ans[i][j] + res[i][j]);
      for (int j = 0; j < 2; ++j)
        if (min(ans[i][j], res[i][1 - j]) >= 0)
          nxt[i][1] = min(nxt[i][1], ans[i][j] + res[i][1 - j]);
    }
    for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j)
      if (nxt[i][j] == INT_MAX) nxt[i][j] = -1;
    ans = nxt;
  }
  if (!start) ans[0][0] = ans[1][0] = 0;
  vvi copy = ans;
  if (on[v]) swap(copy[0][0], copy[0][1]), swap(copy[1][0], copy[1][1]);
  ans[0][0] = copy[0][0], ans[0][1] = copy[1][1] < 0 ? -1 : copy[1][1] + 1;
  ans[1][0] = copy[0][1], ans[1][1] = copy[1][0] < 0 ? -1 : copy[1][0] + 1;
  return ans;
}

int main() {
  int n; cin >> n;
  adj.resize(n), on.resize(n);
  for (int i = 0; i < n - 1; ++i) {
    int a, b; cin >> a >> b; --a, --b;
    adj[a].push_back(b), adj[b].push_back(a);
  }
  for (int i = 0; i < n; ++i) cin >> on[i];
  vi res = dfs(0, 0)[0];
  int ans = res[0] < 0 || res[1] < 0 ? max(res[0], res[1]) : min(res[0], res[1]);
  cout << (ans < 0 ? "impossible" : to_string(ans)) << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 40396 KB Output is correct
2 Correct 133 ms 39780 KB Output is correct
3 Correct 135 ms 40584 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 40332 KB Output is correct
2 Correct 129 ms 39900 KB Output is correct
3 Correct 136 ms 40652 KB Output is correct
4 Correct 100 ms 5452 KB Output is correct
5 Correct 115 ms 6056 KB Output is correct
6 Correct 109 ms 6084 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 35 ms 2488 KB Output is correct
9 Correct 111 ms 6324 KB Output is correct
10 Correct 108 ms 6528 KB Output is correct
11 Correct 118 ms 8852 KB Output is correct
12 Correct 118 ms 9252 KB Output is correct
13 Correct 137 ms 5728 KB Output is correct
14 Correct 111 ms 6092 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 133 ms 40396 KB Output is correct
18 Correct 133 ms 39780 KB Output is correct
19 Correct 135 ms 40584 KB Output is correct
20 Correct 130 ms 40332 KB Output is correct
21 Correct 129 ms 39900 KB Output is correct
22 Correct 136 ms 40652 KB Output is correct
23 Correct 100 ms 5452 KB Output is correct
24 Correct 115 ms 6056 KB Output is correct
25 Correct 109 ms 6084 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 35 ms 2488 KB Output is correct
28 Correct 111 ms 6324 KB Output is correct
29 Correct 108 ms 6528 KB Output is correct
30 Correct 118 ms 8852 KB Output is correct
31 Correct 118 ms 9252 KB Output is correct
32 Correct 137 ms 5728 KB Output is correct
33 Correct 111 ms 6092 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 127 ms 41636 KB Output is correct
46 Correct 126 ms 41164 KB Output is correct
47 Correct 137 ms 41912 KB Output is correct
48 Correct 95 ms 6724 KB Output is correct
49 Correct 111 ms 7356 KB Output is correct
50 Correct 116 ms 7460 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 34 ms 2892 KB Output is correct
53 Correct 116 ms 7672 KB Output is correct
54 Correct 112 ms 7884 KB Output is correct
55 Correct 116 ms 10264 KB Output is correct
56 Correct 127 ms 10648 KB Output is correct
57 Correct 106 ms 6956 KB Output is correct
58 Correct 113 ms 7504 KB Output is correct
59 Correct 34 ms 2772 KB Output is correct
60 Correct 99 ms 7008 KB Output is correct
61 Correct 107 ms 7568 KB Output is correct
62 Correct 122 ms 8028 KB Output is correct
63 Correct 112 ms 7776 KB Output is correct
64 Correct 109 ms 7676 KB Output is correct
65 Correct 113 ms 7948 KB Output is correct
66 Correct 110 ms 8028 KB Output is correct
67 Correct 105 ms 7980 KB Output is correct
68 Correct 105 ms 7876 KB Output is correct
69 Correct 102 ms 7904 KB Output is correct
70 Correct 102 ms 7912 KB Output is correct