oj.uz

Submission #447300

# Submission time Handle Problem Language Result Execution time Memory
447300 2021-07-26T02:51:01 Z blue The Xana coup (BOI21_xanadu) C++17
100 / 100
 181 ms 30072 KB 
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i,n) for(int i = 1; i <= N; i++)
vector<int> edge[100001];
int sv[100001];
vector<int> p(100001, 0);
vector<int> children[100001];
int** dp[100001];
void dfs1(int u) {
    for(int v: edge[u]) {
        if(p[u] == v) continue;
        p[v] = u;
        children[u].push_back(v);
        dfs1(v);
    }
}
int** X;
void dfs2(int u) {
    dp[u][ sv[u] ][0] = dp[u][ sv[u] ][1] = 0;
    for(int v: children[u]) {
        dfs2(v);
        for(int f = 0; f <= 1; f++) for(int g = 0; g <= 1; g++) X[f][g] = min(dp[u][f][g] + dp[v][g][0], dp[u][!f][g] + dp[v][!g][1] + 1);
        swap(dp[u], X);
    }
}
int main() {
    X = new int*[2];
    for(int f = 0; f < 2; f++)  X[f] = new int[2];
    int N; cin >> N;
    for(int i = 1; i <= N-1; i++) {
        int a, b; cin >> a >> b;
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
    edge[1].push_back(0);
    edge[0].push_back(1);
    dfs1(0);
    for(int i = 0; i <= N; i++) {
        dp[i] = new int*[2];
        for(int f = 0; f <= 1; f++)
        {
            dp[i][f] = new int[2];
            for(int g = 0; g <= 1; g++) dp[i][f][g] = N+1;
        }
    }
    FOR(i, N) cin >> sv[i];
    dp[0][0][0] = dp[0][0][1] = dp[0][1][0] = dp[0][1][1] = 0;
    dfs2(0);
    int res = min(dp[0][0][0], dp[0][1][0]);
    if(res >= N+1) cout << "impossible\n";
    else cout << res << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 29820 KB Output is correct
2 Correct 138 ms 29568 KB Output is correct
3 Correct 145 ms 30072 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 29896 KB Output is correct
2 Correct 140 ms 29564 KB Output is correct
3 Correct 135 ms 29920 KB Output is correct
4 Correct 145 ms 19300 KB Output is correct
5 Correct 173 ms 20740 KB Output is correct
6 Correct 163 ms 20888 KB Output is correct
7 Correct 4 ms 5452 KB Output is correct
8 Correct 47 ms 10740 KB Output is correct
9 Correct 158 ms 21312 KB Output is correct
10 Correct 157 ms 21444 KB Output is correct
11 Correct 158 ms 21608 KB Output is correct
12 Correct 161 ms 22112 KB Output is correct
13 Correct 147 ms 19596 KB Output is correct
14 Correct 153 ms 20640 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB Output is correct
2 Correct 3 ms 5328 KB Output is correct
3 Correct 3 ms 5324 KB Output is correct
4 Correct 3 ms 5324 KB Output is correct
5 Correct 3 ms 5324 KB Output is correct
6 Correct 4 ms 5324 KB Output is correct
7 Correct 3 ms 5324 KB Output is correct
8 Correct 3 ms 5300 KB Output is correct
9 Correct 3 ms 5324 KB Output is correct
10 Correct 3 ms 5324 KB Output is correct
11 Correct 4 ms 5324 KB Output is correct
12 Correct 3 ms 5324 KB Output is correct
13 Correct 3 ms 5324 KB Output is correct
14 Correct 3 ms 5324 KB Output is correct
15 Correct 3 ms 5324 KB Output is correct
16 Correct 3 ms 5324 KB Output is correct
17 Correct 138 ms 29820 KB Output is correct
18 Correct 138 ms 29568 KB Output is correct
19 Correct 145 ms 30072 KB Output is correct
20 Correct 134 ms 29896 KB Output is correct
21 Correct 140 ms 29564 KB Output is correct
22 Correct 135 ms 29920 KB Output is correct
23 Correct 145 ms 19300 KB Output is correct
24 Correct 173 ms 20740 KB Output is correct
25 Correct 163 ms 20888 KB Output is correct
26 Correct 4 ms 5452 KB Output is correct
27 Correct 47 ms 10740 KB Output is correct
28 Correct 158 ms 21312 KB Output is correct
29 Correct 157 ms 21444 KB Output is correct
30 Correct 158 ms 21608 KB Output is correct
31 Correct 161 ms 22112 KB Output is correct
32 Correct 147 ms 19596 KB Output is correct
33 Correct 153 ms 20640 KB Output is correct
34 Correct 3 ms 5324 KB Output is correct
35 Correct 3 ms 5324 KB Output is correct
36 Correct 3 ms 5324 KB Output is correct
37 Correct 3 ms 5324 KB Output is correct
38 Correct 4 ms 5324 KB Output is correct
39 Correct 4 ms 5324 KB Output is correct
40 Correct 4 ms 5324 KB Output is correct
41 Correct 4 ms 5324 KB Output is correct
42 Correct 3 ms 5324 KB Output is correct
43 Correct 3 ms 5324 KB Output is correct
44 Correct 4 ms 5324 KB Output is correct
45 Correct 132 ms 29904 KB Output is correct
46 Correct 138 ms 29596 KB Output is correct
47 Correct 138 ms 30020 KB Output is correct
48 Correct 138 ms 19264 KB Output is correct
49 Correct 176 ms 20652 KB Output is correct
50 Correct 167 ms 20972 KB Output is correct
51 Correct 4 ms 5452 KB Output is correct
52 Correct 49 ms 10720 KB Output is correct
53 Correct 162 ms 21292 KB Output is correct
54 Correct 181 ms 21572 KB Output is correct
55 Correct 165 ms 21636 KB Output is correct
56 Correct 177 ms 22212 KB Output is correct
57 Correct 168 ms 19564 KB Output is correct
58 Correct 174 ms 20548 KB Output is correct
59 Correct 47 ms 10504 KB Output is correct
60 Correct 139 ms 19488 KB Output is correct
61 Correct 160 ms 20752 KB Output is correct
62 Correct 169 ms 21096 KB Output is correct
63 Correct 155 ms 21060 KB Output is correct
64 Correct 158 ms 21056 KB Output is correct
65 Correct 152 ms 20116 KB Output is correct
66 Correct 151 ms 20076 KB Output is correct
67 Correct 130 ms 19776 KB Output is correct
68 Correct 126 ms 19904 KB Output is correct
69 Correct 125 ms 19776 KB Output is correct
70 Correct 134 ms 19844 KB Output is correct