oj.uz

답안 #673661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
673661 2022-12-21T15:22:04 Z stanislavpolyn The Xana coup (BOI21_xanadu) C++17
100 / 100
 89 ms 15016 KB 
#include <bits/stdc++.h>
 
#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
 
#define all(x) (x).begin(), (x).end()
#define pw(x) (1LL << (x))
#define sz(x) (int)(x).size()
 
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key
 
template <typename T>
bool umn(T& a, T b) { return (a > b ? (a = b, 1) : 0); }
template <typename T>
bool umx(T& a, T b) { return (a < b ? (a = b, 1) : 0); }
 
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;
 
const int N = 1e5 + 5;
 
int n;
ve<int> g[N];
bool a[N];
 
int dp[N][2][2];
 
void dfs(int v, int p) {
    bool leaf = 1;
    fe (to, g[v]) {
        if (to == p) continue;
        dfs(to, v);
        leaf = 0;
    }
 
    if (leaf) {
        dp[v][a[v]][0] = 0;
        dp[v][!a[v]][1] = 1;
        return;
    }
 
//    cout << dp[v][0][1] << "\n";
 
    // don't press
    ve<int> dp(2, 1e9), ndp(2, 1e9);
    dp[a[v]] = 0;
    fe (to, g[v]) {
        if (to == p) continue;
 
        fr (was, 0, 1) {
            umn(ndp[was ^ 1], dp[was] + ::dp[to][0][1]);
            umn(ndp[was], dp[was] + ::dp[to][0][0]);
        }
        fr (was, 0, 1) {
            dp[was] = ndp[was];
            ndp[was] = 1e9;
        }
    }
 
    umn(::dp[v][0][0], dp[0]);
    umn(::dp[v][1][0], dp[1]);
 
    fill(all(dp), 1e9);
    fill(all(ndp), 1e9);
    // press
    dp[!a[v]] = 1;
    fe (to, g[v]) {
        if (to == p) continue;
 
        fr (was, 0, 1) {
            umn(ndp[was ^ 1], dp[was] + ::dp[to][1][1]);
            umn(ndp[was], dp[was] + ::dp[to][1][0]);
        }
        fr (was, 0, 1) {
            dp[was] = ndp[was];
            ndp[was] = 1e9;
        }
    }
 
    umn(::dp[v][0][1], dp[0]);
    umn(::dp[v][1][1], dp[1]);
 
//    cout << v << " " << ::dp[v][0][0] << " " << ::dp[v][0][1] << " " << ::dp[v][1][0] << " " << ::dp[v][1][1] << "\n";
}
 
int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif
 
    cin >> n;
 
    fr (i, 1, n - 1) {
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
 
    fr (i, 1, n) {
        cin >> a[i];
    }
 
    fr (i, 1, n) {
        fr (j, 0, 1) {
            fr (k, 0, 1) {
                dp[i][j][k] = 1e9;
            }
        }
    }
 
    dfs(1, -1);
 
    int best = 1e9;
    fr (i, 0, 1) {
        umn(best, dp[1][0][i]);
    }
 
    if (best == 1e9) {
        cout << "impossible\n";
        return 0;
    }
 
    cout << best << "\n";
 
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2680 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2680 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2676 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2680 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 15004 KB Output is correct
2 Correct 47 ms 14784 KB Output is correct
3 Correct 55 ms 15016 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 14984 KB Output is correct
2 Correct 47 ms 14724 KB Output is correct
3 Correct 49 ms 14972 KB Output is correct
4 Correct 58 ms 8020 KB Output is correct
5 Correct 57 ms 8568 KB Output is correct
6 Correct 71 ms 8792 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 18 ms 4736 KB Output is correct
9 Correct 66 ms 8748 KB Output is correct
10 Correct 55 ms 8836 KB Output is correct
11 Correct 50 ms 9036 KB Output is correct
12 Correct 59 ms 9364 KB Output is correct
13 Correct 43 ms 8348 KB Output is correct
14 Correct 47 ms 8764 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2680 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 2 ms 2672 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2676 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2680 KB Output is correct
17 Correct 64 ms 15004 KB Output is correct
18 Correct 47 ms 14784 KB Output is correct
19 Correct 55 ms 15016 KB Output is correct
20 Correct 56 ms 14984 KB Output is correct
21 Correct 47 ms 14724 KB Output is correct
22 Correct 49 ms 14972 KB Output is correct
23 Correct 58 ms 8020 KB Output is correct
24 Correct 57 ms 8568 KB Output is correct
25 Correct 71 ms 8792 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 18 ms 4736 KB Output is correct
28 Correct 66 ms 8748 KB Output is correct
29 Correct 55 ms 8836 KB Output is correct
30 Correct 50 ms 9036 KB Output is correct
31 Correct 59 ms 9364 KB Output is correct
32 Correct 43 ms 8348 KB Output is correct
33 Correct 47 ms 8764 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2676 KB Output is correct
38 Correct 1 ms 2672 KB Output is correct
39 Correct 2 ms 2664 KB Output is correct
40 Correct 2 ms 2672 KB Output is correct
41 Correct 1 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2680 KB Output is correct
44 Correct 1 ms 2672 KB Output is correct
45 Correct 58 ms 14968 KB Output is correct
46 Correct 51 ms 14832 KB Output is correct
47 Correct 60 ms 15008 KB Output is correct
48 Correct 65 ms 8052 KB Output is correct
49 Correct 71 ms 8572 KB Output is correct
50 Correct 49 ms 8764 KB Output is correct
51 Correct 2 ms 2676 KB Output is correct
52 Correct 16 ms 4684 KB Output is correct
53 Correct 51 ms 8652 KB Output is correct
54 Correct 51 ms 8780 KB Output is correct
55 Correct 60 ms 9084 KB Output is correct
56 Correct 89 ms 9280 KB Output is correct
57 Correct 43 ms 8396 KB Output is correct
58 Correct 61 ms 8752 KB Output is correct
59 Correct 17 ms 4676 KB Output is correct
60 Correct 44 ms 8168 KB Output is correct
61 Correct 49 ms 8708 KB Output is correct
62 Correct 48 ms 8756 KB Output is correct
63 Correct 55 ms 8780 KB Output is correct
64 Correct 56 ms 8816 KB Output is correct
65 Correct 46 ms 9292 KB Output is correct
66 Correct 61 ms 9300 KB Output is correct
67 Correct 39 ms 9136 KB Output is correct
68 Correct 35 ms 9156 KB Output is correct
69 Correct 36 ms 9200 KB Output is correct
70 Correct 34 ms 9140 KB Output is correct