Codeforces Round #357 (Div. 2) D. Gifts by the List 水题

D. Gifts by the List

题目连接：

http://www.codeforces.com/contest/681/problem/D

Description

Sasha lives in a big happy family. At the Man's Day all the men of the family gather to celebrate it following their own traditions. There are n men in Sasha's family, so let's number them with integers from 1 to n.

Each man has at most one father but may have arbitrary number of sons.

Man number A is considered to be the ancestor of the man number B if at least one of the following conditions is satisfied:

A = B;
the man number A is the father of the man number B;
there is a man number C, such that the man number A is his ancestor and the man number C is the father of the man number B.
Of course, if the man number A is an ancestor of the man number B and A ≠ B, then the man number B is not an ancestor of the man number A.

The tradition of the Sasha's family is to give gifts at the Man's Day. Because giving gifts in a normal way is boring, each year the following happens.

A list of candidates is prepared, containing some (possibly all) of the n men in some order.
Each of the n men decides to give a gift.
In order to choose a person to give a gift to, man A looks through the list and picks the first man B in the list, such that B is an ancestor of A and gives him a gift. Note that according to definition it may happen that a person gives a gift to himself.
If there is no ancestor of a person in the list, he becomes sad and leaves the celebration without giving a gift to anyone.
This year you have decided to help in organizing celebration and asked each of the n men, who do they want to give presents to (this person is chosen only among ancestors). Are you able to make a list of candidates, such that all the wishes will be satisfied if they give gifts according to the process described above?

Input

In the first line of the input two integers n and m (0 ≤ m < n ≤ 100 000) are given — the number of the men in the Sasha's family and the number of family relations in it respectively.

The next m lines describe family relations: the (i + 1)th line consists of pair of integers pi and qi (1 ≤ pi, qi ≤ n, pi ≠ qi) meaning that the man numbered pi is the father of the man numbered qi. It is guaranteed that every pair of numbers appears at most once, that among every pair of two different men at least one of them is not an ancestor of another and that every man has at most one father.

The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n), ith of which means that the man numbered i wants to give a gift to the man numbered ai. It is guaranteed that for every 1 ≤ i ≤ n the man numbered ai is an ancestor of the man numbered i.

Output

Print an integer k (1 ≤ k ≤ n) — the number of the men in the list of candidates, in the first line.

Print then k pairwise different positive integers not exceeding n — the numbers of the men in the list in an order satisfying every of the men's wishes, one per line.

If there are more than one appropriate lists, print any of them. If there is no appropriate list print  - 1 in the only line.

Sample Input

3 2
1 2
2 3
1 2 1

Sample Output

-1

Hint

题意

给你一个森林

然后给你每个人想要给谁礼物的意愿

这些人给礼物是根据一个列表，他们会从上往下看，看到第一个是他祖先的人，就会给这个人礼物

你需要构造一个列表，满足所有人的意愿。

题解：

直接dfs

如果这个人的意愿不是他自己，或者这个人的意愿和他的父亲不同的话，那么就输出无解，因为这样必然会和他的父亲发生冲突。

为什么呢？

如果a要给b礼物，那么a和b之间的所有人，都必须给b礼物。

答案的话，按照dfs顺序倒序输出就好了

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+7;
int n,m,d[maxn],key[maxn],a[maxn],flag;
vector<int> E[maxn],ans;
void dfs(int x,int p)
{
    for(int v=0;v<E[x].size();v++)
    {
        int u=E[x][v];
        if(u==p)continue;
        if(a[u]!=a[x]&&a[u]!=u)flag=1;
        dfs(u,x);
    }
    if(a[x]==x)ans.push_back(x);
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int a,b;scanf("%d%d",&a,&b);
        E[a].push_back(b);
        E[b].push_back(a);
        d[b]++;
    }
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=n;i++)
        if(!d[i])dfs(i,0);
    if(flag)
    {
        cout<<"-1"<<endl;
        return 0;
    }
    cout<<ans.size()<<endl;
    for(int i=0;i<ans.size();i++)
        cout<<ans[i]<<endl;
}