Codeforces 472C Design Tutorial: Make It Nondeterministic【贪心】

C. Design Tutorial: Make It Nondeterministic

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A way to make a new task is to make it nondeterministic or probabilistic. For example, the hard task of Topcoder SRM 595, Constellation, is the probabilistic version of a convex hull.

Let's try to make a new task. Firstly we will use the following task. There are n people, sort them by their name. It is just an ordinary sorting problem, but we can make it more interesting by adding nondeterministic element. There are n people, each person will use either his/her first name or last name as a handle. Can the lexicographical order of the handles be exactly equal to the given permutation p?

More formally, if we denote the handle of the i-th person as h_i, then the following condition must hold: .

Input

The first line contains an integer n (1 ≤ n ≤ 10⁵) — the number of people.

The next n lines each contains two strings. The i-th line contains strings f_i and s_i (1 ≤ |f_i|, |s_i| ≤ 50) — the first name and last name of the i-th person. Each string consists only of lowercase English letters. All of the given 2n strings will be distinct.

The next line contains n distinct integers: p₁, p₂, ..., p_n (1 ≤ p_i ≤ n).

Output

If it is possible, output "YES", otherwise output "NO".

Examples

Input

3
gennady korotkevich
petr mitrichev
gaoyuan chen
1 2 3

Output

NO

Input

3
gennady korotkevich
petr mitrichev
gaoyuan chen
3 1 2

Output

YES

Input

2
galileo galilei
nicolaus copernicus
2 1

Output

YES

Input

10
rean schwarzer
fei claussell
alisa reinford
eliot craig
laura arseid
jusis albarea
machias regnitz
sara valestin
emma millstein
gaius worzel
1 2 3 4 5 6 7 8 9 10

Output

NO

Input

10
rean schwarzer
fei claussell
alisa reinford
eliot craig
laura arseid
jusis albarea
machias regnitz
sara valestin
emma millstein
gaius worzel
2 4 9 6 5 7 1 3 8 10

Output

YES

Note

In example 1 and 2, we have 3 people: tourist, Petr and me (cgy4ever). You can see that whatever handle is chosen, I must be the first, then tourist and Petr must be the last.

In example 3, if Copernicus uses "copernicus" as his handle, everything will be alright.

题目大意：

一共有N个人，每个人有两个字符串可以进行选择，问给定一个序列顺序，能否选择出一个按照字典序递增的顺序的一个结果。

思路：

贪心即可，我们首先将每个人可以选择的两个字符串按照从小到大排序，那么很显然，当到第i个人选择名字的时候 ，如果可以选小字典序的那个，就可以给后边的人更多选择的机会，所以直接选最小字典序的即可，否则再判断是否选择第二个字符串。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char a[100500][65];
char b[100500][65];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%s%s",a[i],b[i]);
            if(strcmp(a[i],b[i])>0)
            {
                swap(a[i],b[i]);
            }
        }
        int flag=0;
        char pre[65];
        for(int i=1;i<=n;i++)
        {
            int d;
            scanf("%d",&d);
            if(i==1)
            {
                strcpy(pre,a[d]);
            }
            else
            {
                if(strcmp(a[d],pre)<0)
                {
                    if(strcmp(b[d],pre)<0)
                    {
                        flag=1;
                    }
                    else strcpy(pre,b[d]);
                }
                else strcpy(pre,a[d]);
            }
        }
        if(flag==0)printf("YES\n");
        else printf("NO\n");
    }
}