oj.uz

Submission #403311

# Submission time Handle Problem Language Result Execution time Memory
403311 2021-05-13T02:58:08 Z Leonardo_Paes The Xana coup (BOI21_xanadu) C++17
100 / 100
 91 ms 24452 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10, inf = 0x3f3f3f3f;
bool s[maxn];
int dp[maxn][2][2], aux[maxn][2][2];
vector<int> grafo[maxn];
void solve(int u, int p = 0){
    for(int i : {0, 1}){
        for(int j : {0, 1}){
            dp[u][i][j] = (s[u] ^ i == j ? i : inf);
        }
    }
    for(int v : grafo[u]){
        if(v == p) continue;
        solve(v, u);
        for(int i : {0, 1}){ // ligo ou nao o u
            for(int j : {0, 1}){ // vou ficar ligado ou n dependendo da minha subarvore
                for(int k : {0, 1}){
                    for(int l : {0, 1}){
                        if(i^l) continue; // n pode
                        aux[u][i][j^k] = min(aux[u][i][j^k], dp[u][i][j] + dp[v][k][l]);
                    }
                }
            }
        }
        for(int i : {0, 1}){
            for(int j : {0, 1}){
                dp[u][i][j] = aux[u][i][j];
                aux[u][i][j] = inf;
            }
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    memset(aux, inf, sizeof aux);
    int n;
    cin >> n;
    for(int i=1; i<n; i++){
        int u, v;
        cin >> u >> v;
        grafo[u].push_back(v);
        grafo[v].push_back(u);
    }
    for(int i=1; i<=n; i++) cin >> s[i];
    solve(1);
    int ans = min(dp[1][0][0], dp[1][1][0]);
    if(ans == inf) cout << "impossible\n";
    else cout << ans << "\n";
    return 0;
}

Compilation message

xanadu.cpp: In function 'void solve(int, int)':
xanadu.cpp:10:37: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   10 |             dp[u][i][j] = (s[u] ^ i == j ? i : inf);
      |                                   ~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4232 KB Output is correct
4 Correct 4 ms 4240 KB Output is correct
5 Correct 4 ms 4232 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 24260 KB Output is correct
2 Correct 78 ms 24024 KB Output is correct
3 Correct 71 ms 24452 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 24280 KB Output is correct
2 Correct 70 ms 24020 KB Output is correct
3 Correct 79 ms 24440 KB Output is correct
4 Correct 71 ms 9668 KB Output is correct
5 Correct 80 ms 10204 KB Output is correct
6 Correct 74 ms 10336 KB Output is correct
7 Correct 3 ms 4236 KB Output is correct
8 Correct 21 ms 6256 KB Output is correct
9 Correct 81 ms 10324 KB Output is correct
10 Correct 75 ms 10432 KB Output is correct
11 Correct 90 ms 11380 KB Output is correct
12 Correct 80 ms 11636 KB Output is correct
13 Correct 66 ms 9912 KB Output is correct
14 Correct 69 ms 10232 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4172 KB Output is correct
2 Correct 3 ms 4172 KB Output is correct
3 Correct 3 ms 4232 KB Output is correct
4 Correct 4 ms 4240 KB Output is correct
5 Correct 4 ms 4232 KB Output is correct
6 Correct 3 ms 4172 KB Output is correct
7 Correct 3 ms 4172 KB Output is correct
8 Correct 3 ms 4172 KB Output is correct
9 Correct 3 ms 4240 KB Output is correct
10 Correct 3 ms 4172 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 3 ms 4232 KB Output is correct
13 Correct 3 ms 4172 KB Output is correct
14 Correct 3 ms 4172 KB Output is correct
15 Correct 3 ms 4240 KB Output is correct
16 Correct 3 ms 4232 KB Output is correct
17 Correct 73 ms 24260 KB Output is correct
18 Correct 78 ms 24024 KB Output is correct
19 Correct 71 ms 24452 KB Output is correct
20 Correct 72 ms 24280 KB Output is correct
21 Correct 70 ms 24020 KB Output is correct
22 Correct 79 ms 24440 KB Output is correct
23 Correct 71 ms 9668 KB Output is correct
24 Correct 80 ms 10204 KB Output is correct
25 Correct 74 ms 10336 KB Output is correct
26 Correct 3 ms 4236 KB Output is correct
27 Correct 21 ms 6256 KB Output is correct
28 Correct 81 ms 10324 KB Output is correct
29 Correct 75 ms 10432 KB Output is correct
30 Correct 90 ms 11380 KB Output is correct
31 Correct 80 ms 11636 KB Output is correct
32 Correct 66 ms 9912 KB Output is correct
33 Correct 69 ms 10232 KB Output is correct
34 Correct 3 ms 4240 KB Output is correct
35 Correct 3 ms 4236 KB Output is correct
36 Correct 3 ms 4172 KB Output is correct
37 Correct 3 ms 4172 KB Output is correct
38 Correct 3 ms 4172 KB Output is correct
39 Correct 3 ms 4172 KB Output is correct
40 Correct 3 ms 4236 KB Output is correct
41 Correct 4 ms 4168 KB Output is correct
42 Correct 3 ms 4172 KB Output is correct
43 Correct 3 ms 4172 KB Output is correct
44 Correct 3 ms 4172 KB Output is correct
45 Correct 67 ms 24300 KB Output is correct
46 Correct 69 ms 24064 KB Output is correct
47 Correct 73 ms 24436 KB Output is correct
48 Correct 66 ms 9696 KB Output is correct
49 Correct 70 ms 10156 KB Output is correct
50 Correct 70 ms 10340 KB Output is correct
51 Correct 3 ms 4172 KB Output is correct
52 Correct 21 ms 6368 KB Output is correct
53 Correct 75 ms 10392 KB Output is correct
54 Correct 84 ms 10464 KB Output is correct
55 Correct 75 ms 11332 KB Output is correct
56 Correct 75 ms 11652 KB Output is correct
57 Correct 72 ms 9968 KB Output is correct
58 Correct 75 ms 10348 KB Output is correct
59 Correct 26 ms 6268 KB Output is correct
60 Correct 90 ms 9808 KB Output is correct
61 Correct 91 ms 10268 KB Output is correct
62 Correct 70 ms 10436 KB Output is correct
63 Correct 71 ms 10404 KB Output is correct
64 Correct 72 ms 10468 KB Output is correct
65 Correct 74 ms 10940 KB Output is correct
66 Correct 59 ms 10820 KB Output is correct
67 Correct 55 ms 10680 KB Output is correct
68 Correct 55 ms 10664 KB Output is correct
69 Correct 51 ms 10644 KB Output is correct
70 Correct 61 ms 10716 KB Output is correct