oj.uz

답안 #647156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647156 2022-10-01T17:01:16 Z Ronin13 The Xana coup (BOI21_xanadu) C++14
100 / 100
 141 ms 16928 KB 
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;

const int NMAX = 1e5 + 1;
const int inf = 1e9 + 1;
int dp[NMAX][2][2];
int a[NMAX];
vector <vector <int> > g(NMAX);

void dfs(int v, int e = -1){
    int ind = 0;
    for(int to : g[v]){
        if(to == e) continue;
        dfs(to, v);
        ind++;
    }
    if(!ind){
        dp[v][a[v]][0] = 0;
        dp[v][1 ^ a[v]][1] = 1;
        return;
    }
    for(int x = 0; x < 2; x++){
        for(int y = 0; y < 2; y++){
            int mn = inf;
            int cnt = 0;
            int sum = 0;
            for(int to : g[v]){
                if(to == e) continue;
                if(dp[to][y][0] > dp[to][y][1])
                    sum += dp[to][y][1], cnt++, mn = min(mn, dp[to][y][0] - dp[to][y][1]);
                else sum += dp[to][y][0], mn = min(dp[to][y][1] - dp[to][y][0], mn);
                sum = min(sum, inf);
            }
            if((cnt + y + a[v]) % 2 == x) dp[v][x][y] = min(dp[v][x][y], sum + y);
            else dp[v][x][y] = min(dp[v][x][y], sum + mn + y);
        }
    }
}

int main(){
    int n; cin >> n;
    for(int i = 1; i <= n; i++){
        for(int x = 0; x < 2; x++){
            for(int y = 0; y < 2;y++) dp[i][x][y] = inf;
        }
    }
    for(int i = 1; i < n; i++){
        int u, v; cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    for(int i = 1; i <= n; i++) cin >> a[i];
    dfs(1);
    /*for(int i= 1; i <= n; i++){
        for(int x = 0; x < 2; x++){
            for(int y = 0; y < 2; y++) cout << dp[i][x][y] << ' ';
        }
        cout << "\n";
    }*/
    int v =  min(dp[1][0][1], dp[1][0][0]);
    if(v == inf){
        cout << "impossible\n";
        return 0;
    }
    cout << v;
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 2644 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 2644 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 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 2644 KB Output is correct
12 Correct 2 ms 2660 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 2664 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 16756 KB Output is correct
2 Correct 111 ms 16660 KB Output is correct
3 Correct 109 ms 16880 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 16928 KB Output is correct
2 Correct 110 ms 16608 KB Output is correct
3 Correct 119 ms 16892 KB Output is correct
4 Correct 93 ms 8476 KB Output is correct
5 Correct 109 ms 8940 KB Output is correct
6 Correct 117 ms 8960 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 39 ms 4756 KB Output is correct
9 Correct 106 ms 9000 KB Output is correct
10 Correct 105 ms 9136 KB Output is correct
11 Correct 110 ms 9564 KB Output is correct
12 Correct 132 ms 9740 KB Output is correct
13 Correct 101 ms 8616 KB Output is correct
14 Correct 106 ms 9192 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 2644 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 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 2644 KB Output is correct
12 Correct 2 ms 2660 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 2664 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 110 ms 16756 KB Output is correct
18 Correct 111 ms 16660 KB Output is correct
19 Correct 109 ms 16880 KB Output is correct
20 Correct 124 ms 16928 KB Output is correct
21 Correct 110 ms 16608 KB Output is correct
22 Correct 119 ms 16892 KB Output is correct
23 Correct 93 ms 8476 KB Output is correct
24 Correct 109 ms 8940 KB Output is correct
25 Correct 117 ms 8960 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 39 ms 4756 KB Output is correct
28 Correct 106 ms 9000 KB Output is correct
29 Correct 105 ms 9136 KB Output is correct
30 Correct 110 ms 9564 KB Output is correct
31 Correct 132 ms 9740 KB Output is correct
32 Correct 101 ms 8616 KB Output is correct
33 Correct 106 ms 9192 KB Output is correct
34 Correct 3 ms 2668 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 2 ms 2672 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2672 KB Output is correct
45 Correct 130 ms 16808 KB Output is correct
46 Correct 96 ms 16624 KB Output is correct
47 Correct 110 ms 16804 KB Output is correct
48 Correct 89 ms 8268 KB Output is correct
49 Correct 120 ms 8944 KB Output is correct
50 Correct 132 ms 9020 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 36 ms 4720 KB Output is correct
53 Correct 123 ms 8956 KB Output is correct
54 Correct 118 ms 9208 KB Output is correct
55 Correct 136 ms 9508 KB Output is correct
56 Correct 128 ms 9676 KB Output is correct
57 Correct 101 ms 8624 KB Output is correct
58 Correct 108 ms 9060 KB Output is correct
59 Correct 31 ms 4684 KB Output is correct
60 Correct 118 ms 8360 KB Output is correct
61 Correct 106 ms 8948 KB Output is correct
62 Correct 115 ms 9256 KB Output is correct
63 Correct 141 ms 9256 KB Output is correct
64 Correct 107 ms 9080 KB Output is correct
65 Correct 94 ms 9500 KB Output is correct
66 Correct 119 ms 9736 KB Output is correct
67 Correct 94 ms 9412 KB Output is correct
68 Correct 115 ms 9432 KB Output is correct
69 Correct 88 ms 9464 KB Output is correct
70 Correct 87 ms 9412 KB Output is correct