A.
Xor-tree
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
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
题意
给你一棵树,根节点为1,每个节点上面有权值。要求通过翻转把权值变成指定的权值。翻转的规则是,如果该点翻转,那么该节点和它的孙子节点,和他的孙子的孙子节点。。。都要翻转。
思路:
水题。
直接bfs暴力,需要注意的是根节点为1这个条件,千万不要看掉了。
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int N=100007;
int n;
vector<int >ve[N],ans;
int a[N],b[N];
bool vis[N];
void dfs(int now,int c,int d)
{
if(vis[now])
return ;
vis[now]=1;
if(((b[now]+d)%2)!=a[now])
{
ans.push_back(now);
for(int i=0;i<ve[now].size();i++)
{
int to=ve[now][i];
dfs(to,d+1,c);
}
}
else
{
for(int i=0;i<ve[now].size();i++)
{
int to=ve[now][i];
dfs(to,d,c);
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
for(int i=0;i<=n;i++)
ve[i].clear();
memset(vis,0,sizeof vis);
for(int i=0;i<n-1;i++)
{
int x,y;
scanf("%d%d",&x,&y);
ve[x].push_back(y);
ve[y].push_back(x);
}
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
{
scanf("%d",&b[i]);
}
dfs(1,0,0);
printf("%d\n",ans.size());
for(int i=0;i<ans.size();i++)
{
printf("%d\n",ans[i]);
}
}
return 0;
}