oj.uz

답안 #444122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444122 2021-07-13T06:30:29 Z 8e7 The Xana coup (BOI21_xanadu) C++17
100 / 100
 116 ms 28572 KB 
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <set>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
void debug() {cout << endl;}
template<class T, class ... U> void debug(T a, U ... b) {cout << a << " ", debug(b ...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#define int long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);
const int inf = 1<<30;
vector<int> adj[maxn];
int a[maxn], dp[maxn][2][2];
void build(vector<int> &v, int &even, int &odd) {
	int cur = even;
	for (int i = 0;i < v.size();i++) {
		cur += v[i];
		if (i % 2 == 0) odd = min(odd, cur);
		else even = min(even, cur);
	}
}
void dfs(int n, int par) {
	dp[n][0][0] = dp[n][0][1] = dp[n][1][0] = dp[n][1][1] = inf;
	int s0 = 0, s1 = 0;
	vector<int> c0, c1;
	for (int v:adj[n]) {
		if (v != par) {
			dfs(v, n);
			s0 += dp[v][0][0], s1 += dp[v][0][1];
			c0.push_back(dp[v][1][0] - dp[v][0][0]);
			c1.push_back(dp[v][1][1] - dp[v][0][1]);
		}
	}
	sort(c0.begin(), c0.end()), sort(c1.begin(), c1.end());
	int even = s0, odd = inf;
	build(c0, even, odd);
	dp[n][0][0] = min(dp[n][0][0], a[n] ? odd : even), dp[n][0][1] = min(dp[n][0][1], a[n] ? even : odd);

	even = s1, odd = inf;
	build(c1, even, odd);
	dp[n][1][0] = min(dp[n][1][0], 1 + (a[n] ? even : odd)), dp[n][1][1] = min(dp[n][1][1], 1 + (a[n] ? odd : even));
}
signed main() {
	io
	int n;
	cin >> n;
	for (int i = 0;i < n - 1;i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for (int i = 1;i <= n;i++) cin >> a[i];
	dfs(1, 0);
	int ans = min(dp[1][0][0], dp[1][1][0]);
	if (ans > n) cout << "impossible\n";
	else cout << ans << "\n";
}
/*
5
1 2
1 3
2 4
2 5
0 1 0 1 1
*/

Compilation message

xanadu.cpp: In function 'void build(std::vector<long long int>&, long long int&, long long int&)':
xanadu.cpp:29:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for (int i = 0;i < v.size();i++) {
      |                 ~~^~~~~~~~~~

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 2636 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 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 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 28268 KB Output is correct
2 Correct 76 ms 27972 KB Output is correct
3 Correct 86 ms 28396 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 28244 KB Output is correct
2 Correct 82 ms 28028 KB Output is correct
3 Correct 91 ms 28572 KB Output is correct
4 Correct 83 ms 9708 KB Output is correct
5 Correct 110 ms 10308 KB Output is correct
6 Correct 84 ms 10576 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 24 ms 5324 KB Output is correct
9 Correct 77 ms 10180 KB Output is correct
10 Correct 85 ms 10452 KB Output is correct
11 Correct 81 ms 11672 KB Output is correct
12 Correct 116 ms 11972 KB Output is correct
13 Correct 79 ms 10308 KB Output is correct
14 Correct 82 ms 10844 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 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 2 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 81 ms 28268 KB Output is correct
18 Correct 76 ms 27972 KB Output is correct
19 Correct 86 ms 28396 KB Output is correct
20 Correct 79 ms 28244 KB Output is correct
21 Correct 82 ms 28028 KB Output is correct
22 Correct 91 ms 28572 KB Output is correct
23 Correct 83 ms 9708 KB Output is correct
24 Correct 110 ms 10308 KB Output is correct
25 Correct 84 ms 10576 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 24 ms 5324 KB Output is correct
28 Correct 77 ms 10180 KB Output is correct
29 Correct 85 ms 10452 KB Output is correct
30 Correct 81 ms 11672 KB Output is correct
31 Correct 116 ms 11972 KB Output is correct
32 Correct 79 ms 10308 KB Output is correct
33 Correct 82 ms 10844 KB Output is correct
34 Correct 2 ms 2596 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 2 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2576 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 2688 KB Output is correct
45 Correct 77 ms 28244 KB Output is correct
46 Correct 81 ms 28128 KB Output is correct
47 Correct 78 ms 28364 KB Output is correct
48 Correct 78 ms 9668 KB Output is correct
49 Correct 92 ms 10304 KB Output is correct
50 Correct 81 ms 10564 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 22 ms 5268 KB Output is correct
53 Correct 83 ms 10300 KB Output is correct
54 Correct 81 ms 10388 KB Output is correct
55 Correct 82 ms 11808 KB Output is correct
56 Correct 92 ms 11976 KB Output is correct
57 Correct 76 ms 10316 KB Output is correct
58 Correct 94 ms 10764 KB Output is correct
59 Correct 22 ms 5196 KB Output is correct
60 Correct 68 ms 9532 KB Output is correct
61 Correct 75 ms 10132 KB Output is correct
62 Correct 87 ms 10364 KB Output is correct
63 Correct 81 ms 10308 KB Output is correct
64 Correct 81 ms 10284 KB Output is correct
65 Correct 71 ms 10700 KB Output is correct
66 Correct 71 ms 11996 KB Output is correct
67 Correct 60 ms 14136 KB Output is correct
68 Correct 60 ms 14212 KB Output is correct
69 Correct 72 ms 14156 KB Output is correct
70 Correct 62 ms 14244 KB Output is correct