oj.uz

Submission #472112

# Submission time Handle Problem Language Result Execution time Memory
472112 2021-09-13T03:18:50 Z PurpleCrayon The Xana coup (BOI21_xanadu) C++17
100 / 100
 141 ms 34212 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int MAXN = 1e5+10, MOD = 1e9+7;
const int INF = 1e9+10;

int n, a[MAXN];
vector<int> adj[MAXN];

ar<ar<int, 2>, 2> dfs(int c, int p) { //par flipped[me flipped]
    vector<ar<ar<int, 2>, 2>> sub;
    for (auto nxt : adj[c]) if (nxt != p) sub.push_back(dfs(nxt, c));

    ar<ar<int, 2>, 2> ans;
    for (int rep : {0, 1}) {
        for (int me : {0, 1}) {
            ans[rep][me] = INF;

            ll base = 0;
            vector<ll> v;
            for (auto x : sub) {
                base += x[me][0];
                v.push_back(x[me][1]-x[me][0]);
            }
            sort(v.begin(), v.end());
            for (int i = 1; i < sz(v); i++) v[i] += v[i-1];
            for (int cnt = a[c]; cnt <= sz(v); cnt += 2) {
                ll cost = base + me;
                if (cnt) cost += v[cnt-1];

                ans[rep][me] = min<ll>(ans[rep][me], cost);
            }

            a[c] ^= 1;
        }
        a[c] ^= 1;
    }
    return ans;
}
void solve() {
    cin >> 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 >> a[i];
    auto dp = dfs(0, -1);
    int ans = min(dp[0][0], dp[0][1]);
    if (ans >= INF) cout << "impossible\n";
    else cout << ans << '\n';
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    int T=1;
    //cin >> T;
    while (T--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 32560 KB Output is correct
2 Correct 103 ms 32156 KB Output is correct
3 Correct 98 ms 32720 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 32620 KB Output is correct
2 Correct 95 ms 32164 KB Output is correct
3 Correct 105 ms 32700 KB Output is correct
4 Correct 106 ms 5808 KB Output is correct
5 Correct 84 ms 7420 KB Output is correct
6 Correct 88 ms 7536 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 29 ms 4456 KB Output is correct
9 Correct 102 ms 7600 KB Output is correct
10 Correct 97 ms 7952 KB Output is correct
11 Correct 91 ms 9844 KB Output is correct
12 Correct 100 ms 10028 KB Output is correct
13 Correct 85 ms 7100 KB Output is correct
14 Correct 100 ms 7616 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 107 ms 32560 KB Output is correct
18 Correct 103 ms 32156 KB Output is correct
19 Correct 98 ms 32720 KB Output is correct
20 Correct 104 ms 32620 KB Output is correct
21 Correct 95 ms 32164 KB Output is correct
22 Correct 105 ms 32700 KB Output is correct
23 Correct 106 ms 5808 KB Output is correct
24 Correct 84 ms 7420 KB Output is correct
25 Correct 88 ms 7536 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 29 ms 4456 KB Output is correct
28 Correct 102 ms 7600 KB Output is correct
29 Correct 97 ms 7952 KB Output is correct
30 Correct 91 ms 9844 KB Output is correct
31 Correct 100 ms 10028 KB Output is correct
32 Correct 85 ms 7100 KB Output is correct
33 Correct 100 ms 7616 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2636 KB Output is correct
38 Correct 2 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 3 ms 2636 KB Output is correct
42 Correct 3 ms 2636 KB Output is correct
43 Correct 2 ms 2668 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 98 ms 33876 KB Output is correct
46 Correct 96 ms 33588 KB Output is correct
47 Correct 106 ms 34212 KB Output is correct
48 Correct 95 ms 6976 KB Output is correct
49 Correct 99 ms 7316 KB Output is correct
50 Correct 88 ms 7528 KB Output is correct
51 Correct 3 ms 2636 KB Output is correct
52 Correct 28 ms 4492 KB Output is correct
53 Correct 113 ms 7620 KB Output is correct
54 Correct 85 ms 7828 KB Output is correct
55 Correct 93 ms 9724 KB Output is correct
56 Correct 124 ms 10052 KB Output is correct
57 Correct 103 ms 7216 KB Output is correct
58 Correct 97 ms 7476 KB Output is correct
59 Correct 37 ms 4384 KB Output is correct
60 Correct 98 ms 7088 KB Output is correct
61 Correct 141 ms 7764 KB Output is correct
62 Correct 126 ms 7740 KB Output is correct
63 Correct 98 ms 7800 KB Output is correct
64 Correct 87 ms 7752 KB Output is correct
65 Correct 87 ms 8032 KB Output is correct
66 Correct 85 ms 8072 KB Output is correct
67 Correct 68 ms 11320 KB Output is correct
68 Correct 63 ms 11304 KB Output is correct
69 Correct 66 ms 11392 KB Output is correct
70 Correct 62 ms 11272 KB Output is correct