codeforce 429A Xor-tree

Xor-tree

Limit 1s 256M

Iahub is very proud of his recent discovery, propagating trees. Right now, he invented a new tree, called xor-tree. After this new revolutionary discovery, he invented a game for kids which uses xor-trees.
The game is played on a tree having n nodes, numbered from 1 to n. Each node i has an initial value initi, which is either 0 or 1. The root of the tree is node 1.
One can perform several (possibly, zero) operations on the tree during the game. The only available type of operation is to pick a node x. Right after someone has picked node x, the value of node x flips, the values of sons of x remain the same, the values of sons of sons of x flips, the values of sons of sons of sons of x remain the same and so on.
The goal of the game is to get each node i to have value goali, which can also be only 0 or 1. You need to reach the goal of the game by using minimum number of operations.

Input
The first line contains an integer n (1 ≤ n ≤ 105). Each of the next n - 1 lines contains two integers ui and vi (1 ≤ ui, vi ≤ n; ui ≠ vi) meaning there is an edge between nodes ui and vi.
The next line contains n integer numbers, the i-th of them corresponds to initi (initi is either 0 or 1). The following line also contains n integer numbers, the i-th number corresponds to goali (goali is either 0 or 1).

Output
In the first line output an integer number cnt, representing the minimal number of operations you perform. Each of the next cnt lines should contain an integer xi, representing that you pick a node xi.


Example
Input
10
2 1
3 1
4 2
5 1
6 2
7 5
8 6
9 8
10 5
1 0 1 1 0 1 0 1 0 1
1 0 1 0 0 1 1 1 0 1

Output
2
4
7

题意
给定一棵01树的初始节点值和目标节点值，每一次可以对某一节点做“异或”操作，并且使得该节点的子节点不变，子节点的子节点异或……以此类推，求使得整棵树所有节点值变为目标节点值的最小步数。

题解
从根节点开始DFS就好了，关键是代码技巧
关键点
1.DFS的参数中应该有前驱节点，防止无限递归

2.“异或”的使用使得代码简洁

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;
const int maxn=1e5;

int init[maxn+5];
vector <int> m[maxn+5];
vector <int> p;

void dfs(int now_node,int g,int f,int pre_node)
{
	if (g^init[now_node])
	{
		g^=1;
		p.push_back(now_node);
	}
	for (int i=0;i<m[now_node].size();++i)
	{
		int next=m[now_node][i];
		if (next!=pre_node)
		{
			dfs(next,f,g,now_node);
		}
	}
}
int main(void)
{
	#ifdef ex
	freopen("in.txt","r",stdin);
	#endif
	
	int n;
	int u,v,x;
	
	scanf("%d",&n);
	for (int i=1;i<=n-1;++i)
	{
		scanf("%d%d",&u,&v);
		m[u].push_back(v);
		m[v].push_back(u);
	}
	
	for (int i=1;i<=n;++i)
	{
		scanf("%d",&init[i]);
	}
	for (int i=1;i<=n;++i)
	{
		scanf("%d",&x);
		init[i]^=x;
	}
	
	dfs(1,0,0,0);
	
	int ans=p.size();
	printf("%d\n",ans);
	for (int i=0;i<=ans-1;++i)
	{
		printf("%d\n",p[i]);
	}
	
}

PS:本质上来说，这份代码是膜了晚上大神的结果……