oj.uz

Submission #411542

# Submission time Handle Problem Language Result Execution time Memory
411542 2021-05-25T13:27:49 Z 최서현(#7473) The Xana coup (BOI21_xanadu) C++17
100 / 100
 92 ms 26248 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<long long, long long>
#define plll pair<long long, pll>
#define tiii tuple<int, int, int>
#define tiiii tuple<int, int, int, int>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
#define DEBUG

using namespace std;

#define int long long

const int INF = (int)1e8 + 7;
vector<int> gph[101010];
bool A[101010];
int dp[101010][2][2];

void f(int x, int p)
{
    bool leaf = true;
    int sum0 = 0, sum1 = 0;
    vector<int> v0, v1;
    bool f0 = true, f1 = true;
    for(auto y : gph[x]) if(y != p)
    {
        leaf = false;
        f(y, x);
        if(dp[y][0][0] < dp[y][0][1]) sum0 += dp[y][0][0], v0.push_back(dp[y][0][1] - dp[y][0][0]);
        else sum0 += dp[y][0][1], v0.push_back(dp[y][0][0] - dp[y][0][1]), f0 = !f0;
        if(dp[y][1][0] < dp[y][1][1]) sum1 += dp[y][1][0], v1.push_back(dp[y][1][1] - dp[y][1][0]);
        else sum1 += dp[y][1][1], v1.push_back(dp[y][1][0] - dp[y][1][1]), f1 = !f1;
    }

    if(leaf)
    {
        dp[x][0][0] = (A[x] ? 0 : INF);
        dp[x][0][1] = (A[x] ? INF : 1);
        dp[x][1][0] = (A[x] ? INF : 0);
        dp[x][1][1] = (A[x] ? 1 : INF);
        return;
    }

    (A[x] == f0 ? dp[x][0][0] : dp[x][1][0]) = sum0;
    (A[x] == f0 ? dp[x][1][0] : dp[x][0][0]) = sum0 + *min_element(v0.begin(), v0.end());
    (A[x] == f1 ? dp[x][1][1] : dp[x][0][1]) = sum1 + 1;
    (A[x] == f1 ? dp[x][0][1] : dp[x][1][1]) = sum1 + *min_element(v1.begin(), v1.end()) + 1;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    for(int i = 1; i < n; ++i)
    {
        int x, y; cin >> x >> y; --x; --y;
        gph[x].push_back(y);
        gph[y].push_back(x);
    }
    for(int i = 0; i < n; ++i)
    {
        int x; cin >> x;
        A[i] = (x == 0);
    }

    f(0, -1);
    int t = min(dp[0][0][0], dp[0][0][1]);
    if(t >= INF) cout << "impossible";
    else cout << t;
}

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 2636 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 2636 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 2636 KB Output is correct
13 Correct 3 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 84 ms 26024 KB Output is correct
2 Correct 78 ms 25840 KB Output is correct
3 Correct 76 ms 26168 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26064 KB Output is correct
2 Correct 73 ms 25816 KB Output is correct
3 Correct 80 ms 26248 KB Output is correct
4 Correct 77 ms 9148 KB Output is correct
5 Correct 90 ms 9668 KB Output is correct
6 Correct 78 ms 9868 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 25 ms 5056 KB Output is correct
9 Correct 75 ms 9540 KB Output is correct
10 Correct 89 ms 9668 KB Output is correct
11 Correct 79 ms 10920 KB Output is correct
12 Correct 79 ms 11192 KB Output is correct
13 Correct 70 ms 9628 KB Output is correct
14 Correct 80 ms 10248 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 2636 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 2636 KB Output is correct
13 Correct 3 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 84 ms 26024 KB Output is correct
18 Correct 78 ms 25840 KB Output is correct
19 Correct 76 ms 26168 KB Output is correct
20 Correct 74 ms 26064 KB Output is correct
21 Correct 73 ms 25816 KB Output is correct
22 Correct 80 ms 26248 KB Output is correct
23 Correct 77 ms 9148 KB Output is correct
24 Correct 90 ms 9668 KB Output is correct
25 Correct 78 ms 9868 KB Output is correct
26 Correct 3 ms 2636 KB Output is correct
27 Correct 25 ms 5056 KB Output is correct
28 Correct 75 ms 9540 KB Output is correct
29 Correct 89 ms 9668 KB Output is correct
30 Correct 79 ms 10920 KB Output is correct
31 Correct 79 ms 11192 KB Output is correct
32 Correct 70 ms 9628 KB Output is correct
33 Correct 80 ms 10248 KB Output is correct
34 Correct 3 ms 2636 KB Output is correct
35 Correct 3 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 2656 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 2 ms 2636 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 74 ms 26052 KB Output is correct
46 Correct 79 ms 25748 KB Output is correct
47 Correct 75 ms 26184 KB Output is correct
48 Correct 72 ms 9148 KB Output is correct
49 Correct 76 ms 9692 KB Output is correct
50 Correct 81 ms 9920 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 26 ms 5076 KB Output is correct
53 Correct 87 ms 9540 KB Output is correct
54 Correct 87 ms 9688 KB Output is correct
55 Correct 78 ms 10900 KB Output is correct
56 Correct 86 ms 11204 KB Output is correct
57 Correct 79 ms 9732 KB Output is correct
58 Correct 76 ms 10108 KB Output is correct
59 Correct 21 ms 5040 KB Output is correct
60 Correct 68 ms 8996 KB Output is correct
61 Correct 78 ms 9488 KB Output is correct
62 Correct 77 ms 9668 KB Output is correct
63 Correct 77 ms 9668 KB Output is correct
64 Correct 92 ms 9672 KB Output is correct
65 Correct 64 ms 10048 KB Output is correct
66 Correct 68 ms 10000 KB Output is correct
67 Correct 57 ms 12216 KB Output is correct
68 Correct 52 ms 12168 KB Output is correct
69 Correct 52 ms 12164 KB Output is correct
70 Correct 53 ms 12208 KB Output is correct