oj.uz

답안 #467072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467072 2021-08-21T15:35:56 Z MVP_Harry The Xana coup (BOI21_xanadu) C++17
100 / 100
 100 ms 21984 KB 
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define rep(i, m, n) for (int i = m; i <= n; i++)
#define per(i, m, n) for (int i = m; i >= n; i--)
#define sz(v) (int) v.size()
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const int maxn = 1e5 + 5;

int N;
ll dp[maxn][2][2], a[maxn];
vector<int> G[maxn];

void dfs(int u, int k) {
	ll sum1 = 0, sum2 = 0, mn1 = 1e18, mn2 = 1e18, cnt1 = 0, cnt2 = 0;
	for (auto v : G[u]) {
		if (v == k) continue;
		dfs(v, u);
		sum1 += min(dp[v][0][0], dp[v][0][1]);
		mn1 = min(mn1, abs(dp[v][0][0] - dp[v][0][1]));
		if (dp[v][0][1] < dp[v][0][0]) cnt1++;
		sum2 += min(dp[v][1][0], dp[v][1][1]);
		mn2 = min(mn2, abs(dp[v][1][0] - dp[v][1][1]));
		if (dp[v][1][1] < dp[v][1][0]) cnt2++;
	}
	if ((cnt1 + a[u]) % 2 == 0) {
		dp[u][0][0] = min(dp[u][0][0], sum1);
		dp[u][1][0] = min(dp[u][1][0], sum1 + mn1);
	} else {
		dp[u][0][0] = min(dp[u][0][0], sum1 + mn1);
		dp[u][1][0] = min(dp[u][1][0], sum1);
	}
	if ((cnt2 + a[u]) % 2 == 1) {
		dp[u][0][1] = min(dp[u][0][1], sum2 + 1);
		dp[u][1][1] = min(dp[u][1][1], sum2 + mn2 + 1);
	} else {
		dp[u][0][1] = min(dp[u][0][1], sum2 + mn2 + 1);
		dp[u][1][1] = min(dp[u][1][1], sum2 + 1);
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> N;
	rep(i, 1, N - 1) {
		int u, v;
		cin >> u >> v;
		G[u].pb(v), G[v].pb(u);
	}
	rep(i, 1, N) cin >> a[i];
	rep(i, 1, N) rep(j, 0, 1) rep(k, 0, 1) dp[i][j][k] = 1e9;
	dfs(1, 0);
	ll ans = min(dp[1][0][0], dp[1][0][1]);
	if (ans == (ll) 1e9) {
		cout << "impossible\n";
	} else cout << ans << "\n";
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 2612 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 2612 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2676 KB Output is correct
7 Correct 2 ms 2664 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 2684 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

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 21880 KB Output is correct
2 Correct 66 ms 21748 KB Output is correct
3 Correct 67 ms 21888 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 21828 KB Output is correct
2 Correct 70 ms 21656 KB Output is correct
3 Correct 69 ms 21984 KB Output is correct
4 Correct 77 ms 10052 KB Output is correct
5 Correct 80 ms 10924 KB Output is correct
6 Correct 99 ms 10948 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 21 ms 5452 KB Output is correct
9 Correct 71 ms 10948 KB Output is correct
10 Correct 92 ms 11128 KB Output is correct
11 Correct 100 ms 11736 KB Output is correct
12 Correct 80 ms 12048 KB Output is correct
13 Correct 74 ms 10516 KB Output is correct
14 Correct 71 ms 11000 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 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 2612 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2676 KB Output is correct
7 Correct 2 ms 2664 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 2684 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 65 ms 21880 KB Output is correct
18 Correct 66 ms 21748 KB Output is correct
19 Correct 67 ms 21888 KB Output is correct
20 Correct 68 ms 21828 KB Output is correct
21 Correct 70 ms 21656 KB Output is correct
22 Correct 69 ms 21984 KB Output is correct
23 Correct 77 ms 10052 KB Output is correct
24 Correct 80 ms 10924 KB Output is correct
25 Correct 99 ms 10948 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 21 ms 5452 KB Output is correct
28 Correct 71 ms 10948 KB Output is correct
29 Correct 92 ms 11128 KB Output is correct
30 Correct 100 ms 11736 KB Output is correct
31 Correct 80 ms 12048 KB Output is correct
32 Correct 74 ms 10516 KB Output is correct
33 Correct 71 ms 11000 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 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 3 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2732 KB Output is correct
41 Correct 2 ms 2672 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 2676 KB Output is correct
45 Correct 63 ms 21828 KB Output is correct
46 Correct 62 ms 21624 KB Output is correct
47 Correct 68 ms 21956 KB Output is correct
48 Correct 60 ms 10096 KB Output is correct
49 Correct 67 ms 10864 KB Output is correct
50 Correct 70 ms 10928 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 24 ms 5528 KB Output is correct
53 Correct 75 ms 11020 KB Output is correct
54 Correct 72 ms 11116 KB Output is correct
55 Correct 70 ms 11688 KB Output is correct
56 Correct 94 ms 12052 KB Output is correct
57 Correct 62 ms 10488 KB Output is correct
58 Correct 87 ms 10948 KB Output is correct
59 Correct 19 ms 5376 KB Output is correct
60 Correct 65 ms 10196 KB Output is correct
61 Correct 89 ms 10872 KB Output is correct
62 Correct 82 ms 11128 KB Output is correct
63 Correct 86 ms 11164 KB Output is correct
64 Correct 73 ms 11056 KB Output is correct
65 Correct 63 ms 11492 KB Output is correct
66 Correct 66 ms 11460 KB Output is correct
67 Correct 53 ms 11452 KB Output is correct
68 Correct 51 ms 11344 KB Output is correct
69 Correct 48 ms 11448 KB Output is correct
70 Correct 49 ms 11448 KB Output is correct