oj.uz

Submission #897412

# Submission time Handle Problem Language Result Execution time Memory
897412 2024-01-03T04:20:16 Z LCJLY The Xana coup (BOI21_xanadu) C++14
0 / 100
 40 ms 23180 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;

vector<int>adj[100005];
int arr[100005];
int dp[2][2][100005];

void dfs(int index, int par){
	array<int,2>cnt;
	array<int,2>take;
	array<int,2>change;
	cnt={0,0};
	take={0,0};
	change={(int)1e15,(int)1e15};
	
	
	for(auto it:adj[index]){
		if(it==par) continue;
		dfs(it,index);
		
		for(int x=0;x<2;x++){
			if(dp[0][x][it]<dp[1][x][it]){
				take[x]+=dp[0][x][it];
				change[x]=min(change[x],dp[1][x][it]-dp[0][x][it]);
			}
			else{
				take[x]+=dp[1][x][it];
				cnt[x]++;
				change[x]=min(change[x],dp[0][x][it]-dp[1][x][it]);
			}
		}
	}
	
	int bit=arr[index];
	
	dp[0][0][index]=take[0]+((cnt[0]+bit)%2?change[0]:0);
	dp[0][1][index]=take[0]+(!((cnt[0]+bit)%2)?change[0]:0);
	dp[1][0][index]=1+take[1]+(!((cnt[1]+bit)%2)?change[1]:0);
	dp[1][1][index]=1+take[1]+((cnt[1]+bit)%2?change[1]:0);	
}

void solve(){	
	int n;
	cin >> n;
	
	int temp,temp2;
	for(int x=0;x<n-1;x++){
		cin >> temp >> temp2;
		adj[temp].push_back(temp2);
		adj[temp2].push_back(temp);
	}
	
	for(int x=1;x<=n;x++){
		cin >> arr[x];
	}
	
	dfs(1,-1);
	
	int best=min({dp[0][0][1],dp[1][0][1],dp[0][1][1],dp[1][1][1]});
	if(best>=1e12) cout << "impossible\n";
	else cout << best;
}
 
int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("tribool.in", "r", stdin);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 23180 KB Output is correct
2 Incorrect 38 ms 22880 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 23124 KB Output is correct
2 Incorrect 38 ms 22864 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6488 KB Output isn't correct
2 Halted 0 ms 0 KB -