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 permutationp?
More formally, if we denote the handle of the i-th person as hi, then the following condition must hold: .
The first line contains an integer n (1 ≤ n ≤ 105) — the number of people.
The next n lines each contains two strings. The i-th line contains strings fi and si (1 ≤ |fi|, |si| ≤ 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: p1, p2, ..., pn (1 ≤ pi ≤ n).
If it is possible, output "YES", otherwise output "NO".
3 gennady korotkevich petr mitrichev gaoyuan chen 1 2 3
NO
3 gennady korotkevich petr mitrichev gaoyuan chen 3 1 2
YES
2 galileo galilei nicolaus copernicus 2 1
YES
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
NO
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
YES
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.
这题就是一道简单的贪心,按照P[I]的顺序处理,记录前一个取得是FIRST NAME 还是LAST NAME ,优先取字典序小的那个,排序的时候注意下如果两个串前面全部相等的话,长的字典序大。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char f[100005][55],l[100005][55];
int n,p[100005],q[100005];
int com(char a[],char b[])
{
int l1=strlen(a),l2=strlen(b);
for (int i=0;i<min(l1,l2);i++)
if (a[i]>b[i])
{
return 1;
break;
}
else if (a[i]<b[i])
{
return 0;
break;
}
if (l1>l2) return 1;
else return 0;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%s%s",&f[i],&l[i]);
for (int i=1;i<=n;i++) scanf("%d",&p[i]);
for (int i=1;i<=n;i++) q[p[i]]=i;
int k,kk,last=0,j;
for (int i=1;i<=n;i++)
{
k=p[i]; kk=p[i-1];
if (i==1)
{
j=com(f[k],l[k]);
if (j) last=1;
else last=0;
}
else if (last)
{
j=com(f[k],l[k]);
if (j && com(l[kk],l[k])==0) last=1;
else if (j && com(l[kk],f[k])==0) last=0;
else if (!j && com(l[kk],f[k])==0) last=0;
else if (!j && com(l[kk],l[k])==0) last=1;
else
{
cout <<"NO"<<endl;
return 0;
}
}
else
{
j=com(f[k],l[k]);
if (j && com(f[kk],l[k])==0) last=1;
else if (j && com(f[kk],f[k])==0) last=0;
else if (!j && com(f[kk],f[k])==0) last=0;
else if (!j && com(f[kk],l[k])==0) last=1;
else
{
cout <<"NO"<<endl;
return 0;
}
}
}
cout <<"YES"<<endl;
return 0;
}