oj.uz

답안 #782714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782714 2023-07-14T08:16:08 Z kebine The Xana coup (BOI21_xanadu) C++17
100 / 100
 49 ms 15560 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 1e5 + 5;

int N;
int c[MX];
vector<int> g[MX];
ll dp[MX][2][2];

void dfs(int v, int p) {
      if(g[v].size() == 1 && v != 1) {
            dp[v][c[v]][0] = 0;
            dp[v][c[v] ^ 1][1] = 1;

            return;     
      }

      for(auto u : g[v]) {
            if(u == p) continue;

            dfs(u, v);
      }


      ll sum = 0, cnt = 0, mn = 1e18;
      for(auto u : g[v]) {
            if(u == p) continue;

            if(dp[u][0][0] < dp[u][0][1]) {
                  sum += dp[u][0][0];
                  mn = min(mn, dp[u][0][1] - dp[u][0][0]);
            } else {
                  sum += dp[u][0][1];
                  mn = min(mn, dp[u][0][0] - dp[u][0][1]);
                  cnt++;
            }
      }

      cnt &= 1;
      dp[v][cnt ^ c[v]][0] = min(dp[v][cnt ^ c[v]][0], sum);
      cnt ^= 1;
      dp[v][cnt ^ c[v]][0] = min(dp[v][cnt ^ c[v]][0], sum + mn);

      sum = 0, cnt = 0, mn = 1e18;
      for(auto u : g[v]) {
            if(u == p) continue;

            if(dp[u][1][0] < dp[u][1][1]) {
                  sum += dp[u][1][0];
                  mn = min(mn, dp[u][1][1] - dp[u][1][0]);
            } else {
                  sum += dp[u][1][1];
                  mn = min(mn, dp[u][1][0] - dp[u][1][1]);
                  cnt++;
            }
      }

      cnt &= 1;
      cnt ^= 1;

      dp[v][cnt ^ c[v]][1] = min(dp[v][cnt ^ c[v]][1], sum + 1);
      cnt ^= 1;
      dp[v][cnt ^ c[v]][1] = min(dp[v][cnt ^ c[v]][1], sum + mn + 1);
}     

int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);

      for(int i = 0; i < MX; i++) 
            for(int j = 0; j < 2; j++)
                  for(int k = 0; k < 2; k++)
                        dp[i][j][k] = 1e18;

      cin >> N;
      for(int i = 0; i < N - 1; i++) {
            int 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, 0);

      ll res = min(dp[1][0][0], dp[1][0][1]);

      if(res == 1e18) {
            cout << "impossible\n";
      } else {
            cout << res << '\n';
      }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15508 KB Output is correct
2 Correct 32 ms 15288 KB Output is correct
3 Correct 34 ms 15512 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15508 KB Output is correct
2 Correct 35 ms 15380 KB Output is correct
3 Correct 36 ms 15560 KB Output is correct
4 Correct 31 ms 8836 KB Output is correct
5 Correct 34 ms 9152 KB Output is correct
6 Correct 34 ms 9304 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 13 ms 6996 KB Output is correct
9 Correct 36 ms 9304 KB Output is correct
10 Correct 37 ms 9316 KB Output is correct
11 Correct 36 ms 9680 KB Output is correct
12 Correct 37 ms 9804 KB Output is correct
13 Correct 33 ms 9044 KB Output is correct
14 Correct 33 ms 9240 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 2 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 2 ms 5716 KB Output is correct
7 Correct 2 ms 5716 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 2 ms 5716 KB Output is correct
10 Correct 4 ms 5716 KB Output is correct
11 Correct 2 ms 5716 KB Output is correct
12 Correct 2 ms 5716 KB Output is correct
13 Correct 2 ms 5716 KB Output is correct
14 Correct 2 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 2 ms 5716 KB Output is correct
17 Correct 36 ms 15508 KB Output is correct
18 Correct 32 ms 15288 KB Output is correct
19 Correct 34 ms 15512 KB Output is correct
20 Correct 40 ms 15508 KB Output is correct
21 Correct 35 ms 15380 KB Output is correct
22 Correct 36 ms 15560 KB Output is correct
23 Correct 31 ms 8836 KB Output is correct
24 Correct 34 ms 9152 KB Output is correct
25 Correct 34 ms 9304 KB Output is correct
26 Correct 3 ms 5716 KB Output is correct
27 Correct 13 ms 6996 KB Output is correct
28 Correct 36 ms 9304 KB Output is correct
29 Correct 37 ms 9316 KB Output is correct
30 Correct 36 ms 9680 KB Output is correct
31 Correct 37 ms 9804 KB Output is correct
32 Correct 33 ms 9044 KB Output is correct
33 Correct 33 ms 9240 KB Output is correct
34 Correct 3 ms 5824 KB Output is correct
35 Correct 3 ms 5716 KB Output is correct
36 Correct 2 ms 5716 KB Output is correct
37 Correct 2 ms 5716 KB Output is correct
38 Correct 3 ms 5716 KB Output is correct
39 Correct 3 ms 5716 KB Output is correct
40 Correct 3 ms 5708 KB Output is correct
41 Correct 3 ms 5780 KB Output is correct
42 Correct 3 ms 5716 KB Output is correct
43 Correct 3 ms 5716 KB Output is correct
44 Correct 3 ms 5716 KB Output is correct
45 Correct 37 ms 15444 KB Output is correct
46 Correct 33 ms 15304 KB Output is correct
47 Correct 34 ms 15532 KB Output is correct
48 Correct 37 ms 8876 KB Output is correct
49 Correct 34 ms 9236 KB Output is correct
50 Correct 49 ms 9400 KB Output is correct
51 Correct 2 ms 5716 KB Output is correct
52 Correct 16 ms 6996 KB Output is correct
53 Correct 38 ms 9236 KB Output is correct
54 Correct 36 ms 9372 KB Output is correct
55 Correct 36 ms 9744 KB Output is correct
56 Correct 34 ms 9804 KB Output is correct
57 Correct 31 ms 8996 KB Output is correct
58 Correct 33 ms 9192 KB Output is correct
59 Correct 13 ms 6980 KB Output is correct
60 Correct 31 ms 8956 KB Output is correct
61 Correct 35 ms 10568 KB Output is correct
62 Correct 35 ms 10668 KB Output is correct
63 Correct 35 ms 10700 KB Output is correct
64 Correct 42 ms 10688 KB Output is correct
65 Correct 34 ms 11132 KB Output is correct
66 Correct 31 ms 11204 KB Output is correct
67 Correct 28 ms 10972 KB Output is correct
68 Correct 29 ms 11084 KB Output is correct
69 Correct 28 ms 10976 KB Output is correct
70 Correct 30 ms 11084 KB Output is correct