oj.uz

Submission #749067

# Submission time Handle Problem Language Result Execution time Memory
749067 2023-05-27T09:43:01 Z GrindMachine The Xana coup (BOI21_xanadu) C++17
100 / 100
 95 ms 23484 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<ll> a(N);
ll dp[N][2][2];

void dfs(ll u, ll p){
    ll dp1[2][2], dp2[2][2];
    memset(dp1,0x3f,sizeof dp1);
    memset(dp2,0x3f,sizeof dp2);

    dp1[0][a[u]] = 0;
    dp1[1][a[u]^1] = 1;

    trav(v, adj[u]){
        if(v == p) conts;
        dfs(v, u);

        memset(dp2,0x3f,sizeof dp2);

        rep(op1,2){
            rep(c1,2){
                rep(op2,2){
                    rep(c2,2){
                        if(op1^c2) conts;
                        amin(dp2[op1][c1^op2], dp1[op1][c1] + dp[v][op2][c2]);
                    }
                }
            }
        }

        rep(j,2){
            rep(k,2){
                dp1[j][k] = dp2[j][k];
            }
        }
    }

    rep(j,2){
        rep(k,2){
            dp[u][j][k] = dp1[j][k];
        }
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }
    rep1(i,n) cin >> a[i];

    memset(dp,0x3f,sizeof dp);
    dfs(1,-1);

    ll ans = inf2;
    rep(j,2){
        amin(ans, dp[1][j][0]);
    }

    if(ans > n) {
        cout << "impossible" << endl;
    }
    else{
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6556 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 4 ms 6552 KB Output is correct
4 Correct 3 ms 6548 KB Output is correct
5 Correct 4 ms 6548 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 23484 KB Output is correct
2 Correct 54 ms 23236 KB Output is correct
3 Correct 86 ms 23480 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 23388 KB Output is correct
2 Correct 61 ms 23284 KB Output is correct
3 Correct 76 ms 23468 KB Output is correct
4 Correct 74 ms 11276 KB Output is correct
5 Correct 69 ms 11768 KB Output is correct
6 Correct 95 ms 11872 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 18 ms 8348 KB Output is correct
9 Correct 76 ms 11540 KB Output is correct
10 Correct 84 ms 11732 KB Output is correct
11 Correct 71 ms 12340 KB Output is correct
12 Correct 73 ms 12748 KB Output is correct
13 Correct 66 ms 11836 KB Output is correct
14 Correct 62 ms 12140 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6556 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 4 ms 6552 KB Output is correct
4 Correct 3 ms 6548 KB Output is correct
5 Correct 4 ms 6548 KB Output is correct
6 Correct 8 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 5 ms 6484 KB Output is correct
11 Correct 3 ms 6484 KB Output is correct
12 Correct 3 ms 6484 KB Output is correct
13 Correct 5 ms 6484 KB Output is correct
14 Correct 3 ms 6548 KB Output is correct
15 Correct 5 ms 6552 KB Output is correct
16 Correct 5 ms 6552 KB Output is correct
17 Correct 86 ms 23484 KB Output is correct
18 Correct 54 ms 23236 KB Output is correct
19 Correct 86 ms 23480 KB Output is correct
20 Correct 68 ms 23388 KB Output is correct
21 Correct 61 ms 23284 KB Output is correct
22 Correct 76 ms 23468 KB Output is correct
23 Correct 74 ms 11276 KB Output is correct
24 Correct 69 ms 11768 KB Output is correct
25 Correct 95 ms 11872 KB Output is correct
26 Correct 4 ms 6612 KB Output is correct
27 Correct 18 ms 8348 KB Output is correct
28 Correct 76 ms 11540 KB Output is correct
29 Correct 84 ms 11732 KB Output is correct
30 Correct 71 ms 12340 KB Output is correct
31 Correct 73 ms 12748 KB Output is correct
32 Correct 66 ms 11836 KB Output is correct
33 Correct 62 ms 12140 KB Output is correct
34 Correct 3 ms 6484 KB Output is correct
35 Correct 3 ms 6552 KB Output is correct
36 Correct 3 ms 6484 KB Output is correct
37 Correct 3 ms 6484 KB Output is correct
38 Correct 4 ms 6484 KB Output is correct
39 Correct 4 ms 6548 KB Output is correct
40 Correct 4 ms 6484 KB Output is correct
41 Correct 4 ms 6484 KB Output is correct
42 Correct 3 ms 6484 KB Output is correct
43 Correct 4 ms 6544 KB Output is correct
44 Correct 3 ms 6540 KB Output is correct
45 Correct 66 ms 23476 KB Output is correct
46 Correct 65 ms 23248 KB Output is correct
47 Correct 64 ms 23468 KB Output is correct
48 Correct 57 ms 11292 KB Output is correct
49 Correct 60 ms 11788 KB Output is correct
50 Correct 65 ms 11864 KB Output is correct
51 Correct 4 ms 6612 KB Output is correct
52 Correct 20 ms 8308 KB Output is correct
53 Correct 76 ms 11608 KB Output is correct
54 Correct 64 ms 11648 KB Output is correct
55 Correct 76 ms 12384 KB Output is correct
56 Correct 64 ms 12568 KB Output is correct
57 Correct 63 ms 11768 KB Output is correct
58 Correct 71 ms 12144 KB Output is correct
59 Correct 18 ms 8248 KB Output is correct
60 Correct 52 ms 10996 KB Output is correct
61 Correct 72 ms 11456 KB Output is correct
62 Correct 76 ms 11604 KB Output is correct
63 Correct 81 ms 11680 KB Output is correct
64 Correct 77 ms 11632 KB Output is correct
65 Correct 60 ms 12068 KB Output is correct
66 Correct 54 ms 12080 KB Output is correct
67 Correct 45 ms 11820 KB Output is correct
68 Correct 41 ms 11840 KB Output is correct
69 Correct 58 ms 11812 KB Output is correct
70 Correct 48 ms 11768 KB Output is correct