[贪心+dfs] Codeforces 429A A. Xor-tree

题目链接：

http://codeforces.com/problemset/problem/429/A

A. Xor-tree

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard 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 nodex. 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 ninteger 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.

Sample test(s)

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

题目意思：

给一颗n个节点的树，每个节点有一个值要么是0要么是1，改变某个节点的值时，它的儿子不变，它儿子的儿子翻转，它儿子的儿子的儿子不变，如此类推。给定各个节点的目标值，求最少的翻转次数，使得达到要求。

题解思路：

贪心+dfs

先建树，然后从根节点开始dfs,维护一个从根传过来的奇数层改变的次数，从根传过来的偶数层改变的次数，根据当前节点所在层的奇偶性以及原始值和目标值的差异，判断该节点是否需要改变，如果要改变就一定改变，然后更新传给叶子的参数。

父亲一定要改，儿子不一定改。

代码：

//#include<CSpreadSheet.h>

#include<iostream>
#include<cmath>
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<ctime>
#include<bitset>
#include<cmath>
#define eps 1e-6
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define ll __int64
#define LL long long
#define lson l,m,(rt<<1)
#define rson m+1,r,(rt<<1)|1
#define M 1000000007
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

#define Maxn 110000

vector<int>myv[Maxn];
vector<int>ans;
int s[Maxn],e[Maxn],n;

void dfs(int cur,int odd,int en,int tt,int fa)
{
    //printf("cur:%d odd:%d en:%d tt:%d fa:%d size():%d\n",cur,odd,en,tt,fa,ans.size());
    //system("pause");

    if(tt) //当前层是奇数层
    {
        if(odd) //奇数层改变奇数次，要改变
        {
            if(s[cur]==e[cur]) //改变奇数次后，变成不相等的了，需要再改变
            {
                ans.push_back(cur);
                odd^=1; //奇数层改变的次数增加
            }
        }
        else  //奇数层改变偶数次
        {
            if(s[cur]!=e[cur]) //不相等的要改
            {
                ans.push_back(cur);
                odd^=1;
            }
        }
    }
    else  //当前层是偶数层
    {
        if(en)  //偶数层改变奇数次时，
        {
            if(s[cur]==e[cur]) //相等的需要再改变
            {
                ans.push_back(cur);
                en^=1;
            }
        }
        else
        {
            if(s[cur]!=e[cur])
            {
                ans.push_back(cur);
                en^=1;
            }
        }
    }
    for(int i=0;i<myv[cur].size();i++)
    {
        if(myv[cur][i]==fa)
            continue;
        dfs(myv[cur][i],odd,en,tt^1,cur);
    }
}
int main()
{
   //freopen("in.txt","r",stdin);
   //freopen("out.txt","w",stdout);
   while(~scanf("%d",&n))
   {
       for(int i=1;i<n;i++)
       {
           int a,b;

           scanf("%d%d",&a,&b);
           myv[a].push_back(b);
           myv[b].push_back(a);
       }

       for(int i=1;i<=n;i++)
            scanf("%d",&s[i]);
       for(int i=1;i<=n;i++)
            scanf("%d",&e[i]);

       dfs(1,0,0,1,-1);
       printf("%d\n",ans.size());
       for(int i=0;i<ans.size();i++)
            printf("%d\n",ans[i]);
   }
   return 0;
}