Codeforces Round #245 (Div. 1) A /(Div.2 C) Xor-tree

最新推荐文章于 2020-02-01 12:09:43 发布

置顶旻宇

最新推荐文章于 2020-02-01 12:09:43 发布

阅读量1k

点赞数

分类专栏：搜索 codeforces 文章标签： codeforces DFS

本文链接：https://blog.csdn.net/u010129448/article/details/25745463

版权

搜索同时被 2 个专栏收录

11 篇文章 0 订阅

订阅专栏

codeforces

4 篇文章 0 订阅

订阅专栏

原题链接： http://codeforces.com/contest/429/problem/A 或 http://codeforces.com/contest/430/problem/C

Xor-tree

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 from1 ton. Each nodei has an initial valueinit_i, 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 nodex, the value of node x flips, the values of sons ofx remain the same, the values of sons of sons ofx flips, the values of sons of sons of sons ofx remain the same and so on.

The goal of the game is to get each node i to have valuegoal_i, 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 ≤ 10⁵). Each of the nextn - 1 lines contains two integersu_i andv_i (1 ≤ u_i, v_i ≤ n;u_i ≠ v_i) meaning there is an edge between nodesu_i andv_i.

The next line contains n integer numbers, thei-th of them corresponds toinit_i (init_i is either 0 or 1). The following line also containsn integer numbers, thei-th number corresponds togoal_i (goal_i 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 nextcnt lines should contain an integerx_i, representing that you pick a nodex_i.

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

这道题我自己做是没有任何思路的，无奈之下研究了大神的代码，解法实在是太漂亮了，我这种菜鸟想不到是很正常的！

#include <cstdio>
#include <vector>
#define maxn 100010

std::vector<int> Edge[maxn];
int n, a[maxn], b[maxn]; 
int cnt = 0, ans[maxn];

void dfs(int rt, int pre, int p1, int p2){
    if( a[rt]^ p1 != b[rt] ){      //(1/0)与0异或不翻转；与1异或 翻转
        ans[cnt++] = rt;    //a、b不同需要 flip
        p1 = 1- p1;    //翻转 flip
    }

    for(int i = 0; i < Edge[rt].size(); i++){
        int &e = Edge[rt][i];     //注意此处的引用
        if(e == pre) continue;    //父节点
        dfs(e, rt, p2, p1);     //p1 、p2参数位置的交换实现flip的“隔代遗传” 
    }
}

int main(){
    int i, x, y;
    scanf("%d", &n);
    for(i = 1; i < n; i++){
       scanf("%d %d",&x, &y);
       Edge[x].push_back(y);
       Edge[y].push_back(x);
    }
    for(i = 1; i <= n; i++)  scanf("%d", a + i); 
    for(i = 1; i <= n; i++)  scanf("%d", b + i);
    dfs(1, -1, 0, 0);
    printf("%d\n", cnt);
    for(i = 0; i < cnt; i++)
        printf("%d\n", ans[i]);
    return 0;
}