oj.uz

Submission #970377

# Submission time Handle Problem Language Result Execution time Memory
970377 2024-04-26T12:54:52 Z NotLinux The Xana coup (BOI21_xanadu) C++17
100 / 100
 74 ms 25428 KB 
//author : FatihCihan
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
const int N = 1e5 + 7;
const int inf = 1e9 + 7;
int n , dp[N][4] , value[N];
vector < int > tree[N];
bool is_leaf(int node){
	if(node == 1 and sz(tree[node]) == 0)return 1;
	else if(sz(tree[node]) == 1)return 1;
	else return 0;
}
void dfs(int node , int par){
	for(auto itr : tree[node]){
		if(itr != par){
			dfs(itr , node);
		}
	}
	dp[node][0] = dp[node][1] = dp[node][2] = dp[node][3] = inf;
	// dp[node][0]
	{
		vector < int > v;
		int sum = 0;
		for(auto itr : tree[node]){
			if(itr != par){
				v.push_back(dp[itr][3] - dp[itr][0]);
				sum += dp[itr][0];
			}
		}
		sort(all(v));
		v.insert(v.begin() , 0);
		for(int x = value[node];x < sz(v);x+=2){
			if(x > 0)sum += v[x-1];
			sum += v[x];
			dp[node][0] = min(dp[node][0] , sum + x);
		}
	}
	// dp[node][1]
	{
		vector < int > v;
		int sum = 0;
		for(auto itr : tree[node]){
			if(itr != par){
				v.push_back(dp[itr][3] - dp[itr][0]);
				sum += dp[itr][0];
			}
		}
		sort(all(v));
		v.insert(v.begin() , 0);
		for(int x = 1 - value[node];x < sz(v);x+=2){
			if(x > 0)sum += v[x-1];
			sum += v[x];
			dp[node][1] = min(dp[node][1] , sum + x);
		}
	}
	// dp[node][2]
	{
		vector < int > v;
		int sum = 0;
		for(auto itr : tree[node]){
			if(itr != par){
				v.push_back(dp[itr][2] - dp[itr][1]);
				sum += dp[itr][1];
			}
		}
		sort(all(v));
		v.insert(v.begin() , 0);
		for(int x = value[node];x < sz(v);x+=2){
			if(x > 0)sum += v[x-1];
			sum += v[x];
			dp[node][2] = min(dp[node][2] , sum + x);
		}
	}
	// dp[node][3]
	{
		vector < int > v;
		int sum = 0;
		for(auto itr : tree[node]){
			if(itr != par){
				v.push_back(dp[itr][2] - dp[itr][1]);
				sum += dp[itr][1];
			}
		}
		sort(all(v));
		v.insert(v.begin() , 0);
		for(int x = 1 - value[node];x < sz(v);x+=2){
			if(x > 0)sum += v[x-1];
			sum += v[x];
			dp[node][3] = min(dp[node][3] , sum + x);
		}
	}
	if(sz(tree[node]) == 1 and node != 1){
		dp[node][0] = min(dp[node][0] , dp[node][2]);
		dp[node][2] = dp[node][0];

		dp[node][1] = min(dp[node][1] , dp[node][3]);
		dp[node][3] = dp[node][1];
	}
	// cout << node << " : " << dp[node][0] << " " << dp[node][1] << " " << dp[node][2] << " " << dp[node][3] << endl;
}	
void solve(){
	cin >> n;
	for(int i = 1;i<n;i++){
		int a,b;
		cin >> a >> b;
		tree[a].push_back(b);
		tree[b].push_back(a);
	}
	for(int i = 1;i<=n;i++){
		cin >> value[i];
	}
	dfs(1,0);
	int ans = min(dp[1][0] , dp[1][3] + 1);
	if(ans >= inf)cout << "impossible" << '\n';
	else cout << ans << '\n';
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int testcase = 1;//cin >> testcase;
	while(testcase--)solve();
	cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 24924 KB Output is correct
2 Correct 60 ms 24696 KB Output is correct
3 Correct 61 ms 25172 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 25100 KB Output is correct
2 Correct 62 ms 24756 KB Output is correct
3 Correct 72 ms 25428 KB Output is correct
4 Correct 58 ms 11136 KB Output is correct
5 Correct 57 ms 11900 KB Output is correct
6 Correct 58 ms 12064 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 20 ms 6332 KB Output is correct
9 Correct 58 ms 11664 KB Output is correct
10 Correct 56 ms 11832 KB Output is correct
11 Correct 58 ms 12624 KB Output is correct
12 Correct 62 ms 12744 KB Output is correct
13 Correct 58 ms 11816 KB Output is correct
14 Correct 59 ms 12308 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4744 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 61 ms 24924 KB Output is correct
18 Correct 60 ms 24696 KB Output is correct
19 Correct 61 ms 25172 KB Output is correct
20 Correct 63 ms 25100 KB Output is correct
21 Correct 62 ms 24756 KB Output is correct
22 Correct 72 ms 25428 KB Output is correct
23 Correct 58 ms 11136 KB Output is correct
24 Correct 57 ms 11900 KB Output is correct
25 Correct 58 ms 12064 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 20 ms 6332 KB Output is correct
28 Correct 58 ms 11664 KB Output is correct
29 Correct 56 ms 11832 KB Output is correct
30 Correct 58 ms 12624 KB Output is correct
31 Correct 62 ms 12744 KB Output is correct
32 Correct 58 ms 11816 KB Output is correct
33 Correct 59 ms 12308 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 1 ms 4740 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 1 ms 4696 KB Output is correct
39 Correct 1 ms 4696 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 1 ms 4748 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 1 ms 4700 KB Output is correct
44 Correct 1 ms 4696 KB Output is correct
45 Correct 68 ms 25072 KB Output is correct
46 Correct 67 ms 24660 KB Output is correct
47 Correct 61 ms 25168 KB Output is correct
48 Correct 50 ms 11160 KB Output is correct
49 Correct 56 ms 11852 KB Output is correct
50 Correct 57 ms 12060 KB Output is correct
51 Correct 1 ms 4700 KB Output is correct
52 Correct 18 ms 6400 KB Output is correct
53 Correct 73 ms 11696 KB Output is correct
54 Correct 56 ms 11872 KB Output is correct
55 Correct 58 ms 12572 KB Output is correct
56 Correct 59 ms 12724 KB Output is correct
57 Correct 52 ms 11832 KB Output is correct
58 Correct 58 ms 12384 KB Output is correct
59 Correct 18 ms 6236 KB Output is correct
60 Correct 53 ms 10828 KB Output is correct
61 Correct 74 ms 11672 KB Output is correct
62 Correct 56 ms 11600 KB Output is correct
63 Correct 57 ms 11780 KB Output is correct
64 Correct 55 ms 11792 KB Output is correct
65 Correct 44 ms 12240 KB Output is correct
66 Correct 52 ms 12456 KB Output is correct
67 Correct 44 ms 13732 KB Output is correct
68 Correct 58 ms 13784 KB Output is correct
69 Correct 44 ms 13736 KB Output is correct
70 Correct 46 ms 13748 KB Output is correct