Submission #960959

# Submission time Handle Problem Language Result Execution time Memory
960959 2024-04-11T09:53:17 Z ach00 The Xana coup (BOI21_xanadu) C++14
100 / 100
203 ms 57504 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000
#define DP dp[p][s][v]
vector<bool> state;
vector<vector<int>> adj;
vector<vector<vector<int>>> dp(2, vector<vector<int>>(2, vector<int>(100005, -1)));
ll solve(int p, int s, int v, int parent) {
    if(DP != -1) return DP;
    vector<vector<ll>> temp(2, vector<ll>(2));
    temp[0][0] = 0;
    temp[1][0] = 0;
    temp[0][1] = INF;
    temp[1][1] = INF;
    for(auto &u : adj[v]) {
        if(u == parent) continue;
        vector<vector<ll>> ntemp(2,vector<ll>(2));
        ntemp[0][0] = min(solve(0, 0, u, v) + temp[0][0], solve(0, 1, u, v) + temp[0][1]);
        ntemp[0][1] = min(solve(0, 0, u, v) + temp[0][1], solve(0, 1, u, v) + temp[0][0]);
        ntemp[1][0] = min(solve(1, 0, u, v) + temp[1][0], solve(1, 1, u, v) + temp[1][1]);
        ntemp[1][1] = min(solve(1, 0, u, v) + temp[1][1], solve(1, 1, u, v) + temp[1][0]);
        temp = ntemp;
    }
    if((state[v] + s + p)&1 == 1) {
        DP = s + temp[s][1];
    } else {
        DP = s + temp[s][0];
    }
    return DP;
}

int main() {
    int n; cin >> n;
    adj.resize(n+2);
    state.resize(n+2);
    for(int i = 1; i < n; i++) {
        int a,b; cin >> a >> b;
        a--; b--;
        adj[b].push_back(a);
        adj[a].push_back(b);
    }
    for(int i = 0; i < n; i++) {
        int a; cin >> a;
        if(a) state[i] = true;
        else state[i] = false;
    }
    long long ans = min(solve(0, 0, 0, -1), solve(0, 1, 0, -1));
    if(ans >= INF) {
        cout << "impossible";
    } else {
        cout << ans;
    }
}

Compilation message

xanadu.cpp: In function 'long long int solve(int, int, int, int)':
xanadu.cpp:25:29: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   25 |     if((state[v] + s + p)&1 == 1) {
      |                           ~~^~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3160 KB Output is correct
2 Correct 2 ms 3164 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3160 KB Output is correct
2 Correct 2 ms 3164 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 2 ms 3160 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 2 ms 3164 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 196 ms 55624 KB Output is correct
2 Correct 179 ms 56244 KB Output is correct
3 Correct 196 ms 57360 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 184 ms 55736 KB Output is correct
2 Correct 187 ms 56248 KB Output is correct
3 Correct 187 ms 57360 KB Output is correct
4 Correct 136 ms 8124 KB Output is correct
5 Correct 175 ms 8884 KB Output is correct
6 Correct 157 ms 8852 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 48 ms 4480 KB Output is correct
9 Correct 146 ms 8980 KB Output is correct
10 Correct 155 ms 9212 KB Output is correct
11 Correct 148 ms 12708 KB Output is correct
12 Correct 156 ms 13356 KB Output is correct
13 Correct 145 ms 8468 KB Output is correct
14 Correct 155 ms 8808 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3160 KB Output is correct
2 Correct 2 ms 3164 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 2 ms 3164 KB Output is correct
5 Correct 2 ms 3164 KB Output is correct
6 Correct 2 ms 3160 KB Output is correct
7 Correct 2 ms 3164 KB Output is correct
8 Correct 2 ms 3164 KB Output is correct
9 Correct 2 ms 3164 KB Output is correct
10 Correct 2 ms 3164 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 2 ms 3164 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 2 ms 3164 KB Output is correct
15 Correct 2 ms 3164 KB Output is correct
16 Correct 2 ms 3164 KB Output is correct
17 Correct 196 ms 55624 KB Output is correct
18 Correct 179 ms 56244 KB Output is correct
19 Correct 196 ms 57360 KB Output is correct
20 Correct 184 ms 55736 KB Output is correct
21 Correct 187 ms 56248 KB Output is correct
22 Correct 187 ms 57360 KB Output is correct
23 Correct 136 ms 8124 KB Output is correct
24 Correct 175 ms 8884 KB Output is correct
25 Correct 157 ms 8852 KB Output is correct
26 Correct 2 ms 3164 KB Output is correct
27 Correct 48 ms 4480 KB Output is correct
28 Correct 146 ms 8980 KB Output is correct
29 Correct 155 ms 9212 KB Output is correct
30 Correct 148 ms 12708 KB Output is correct
31 Correct 156 ms 13356 KB Output is correct
32 Correct 145 ms 8468 KB Output is correct
33 Correct 155 ms 8808 KB Output is correct
34 Correct 2 ms 3164 KB Output is correct
35 Correct 2 ms 3164 KB Output is correct
36 Correct 2 ms 3164 KB Output is correct
37 Correct 2 ms 3164 KB Output is correct
38 Correct 2 ms 3164 KB Output is correct
39 Correct 2 ms 3164 KB Output is correct
40 Correct 3 ms 3164 KB Output is correct
41 Correct 2 ms 3164 KB Output is correct
42 Correct 2 ms 3164 KB Output is correct
43 Correct 2 ms 3164 KB Output is correct
44 Correct 2 ms 3164 KB Output is correct
45 Correct 197 ms 57044 KB Output is correct
46 Correct 177 ms 56504 KB Output is correct
47 Correct 203 ms 57504 KB Output is correct
48 Correct 138 ms 7908 KB Output is correct
49 Correct 142 ms 8692 KB Output is correct
50 Correct 152 ms 8860 KB Output is correct
51 Correct 3 ms 3164 KB Output is correct
52 Correct 49 ms 4448 KB Output is correct
53 Correct 143 ms 9140 KB Output is correct
54 Correct 176 ms 9368 KB Output is correct
55 Correct 183 ms 12736 KB Output is correct
56 Correct 167 ms 13244 KB Output is correct
57 Correct 134 ms 8340 KB Output is correct
58 Correct 173 ms 8844 KB Output is correct
59 Correct 48 ms 4284 KB Output is correct
60 Correct 135 ms 8260 KB Output is correct
61 Correct 154 ms 9008 KB Output is correct
62 Correct 168 ms 9276 KB Output is correct
63 Correct 143 ms 9156 KB Output is correct
64 Correct 155 ms 8984 KB Output is correct
65 Correct 138 ms 9376 KB Output is correct
66 Correct 136 ms 9312 KB Output is correct
67 Correct 135 ms 9236 KB Output is correct
68 Correct 132 ms 9144 KB Output is correct
69 Correct 140 ms 9104 KB Output is correct
70 Correct 136 ms 9144 KB Output is correct