-
Notifications
You must be signed in to change notification settings - Fork 0
/
270C.cpp
99 lines (95 loc) · 2.52 KB
/
270C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/* Ankit Srivastava */
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define FF first
#define SS second
#define s(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define sc(n) {char temp[4]; ss(temp); n=temp[0];}
#define INF (int)1e9
#define LINF (long long)1e18
#define EPS 1e-9
#define maX(a,b) ((a)>(b)?(a):(b))
#define miN(a,b) ((a)<(b)?(a):(b))
#define abS(x) ((x)<0?-(x):(x))
typedef long long ll;
typedef unsigned long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,PII> TRI;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<ll> vl;
typedef vector<PII> VII;
typedef vector<TRI> VT;
int n;
int p[100005];
int a[100005][2];
int rev[100005];
int dp[100005][2];
map<pair<string, int>, int> ma;
void precompute() {
}
void read() {
s(n);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
ma[make_pair(s, i)] = 1;
cin >> s;
ma[make_pair(s, i + n)] = 1;
}
for (int i = 0; i < n; ++i) {
s(p[i]);
p[i] --;
rev[p[i]] = i;
}
}
void preprocess() {
int rank = 0;
for (std::map<pair<string, int>, int>::iterator i = ma.begin(); i != ma.end(); ++i) {
pair<string, int> p = i -> FF;
int ind = (p.SS >= n) ? p.SS - n : p.SS;
int sind = (p.SS >= n);
a[ind][sind] = rank ++;
//printf("%d %d %d\n", ind, sind, rank - 1);
}
memset(dp, -1, sizeof dp);
}
int go(int i, int last) {
//cout << "go "<< i << " " << last << " "<< dp[i][last] << endl;
if(i == n) return 1;
if(dp[i][last] == -1) {
int mn = -1;
int now = p[i];
int prev = -1;
if(i > 0) {
prev = p[i - 1];
mn = a[prev][last];
}
int &ok = dp[i][last];
ok = 0;
//cout << now<< " " << mn << " " <<endl;
for (int j = 0; j < 2; ++j) {
if(a[now][j] > mn) ok |= go(i + 1, j);
}
}
return dp[i][last];
}
void solve() {
int res = go(0, 0);
if(res) puts("YES");
else puts("NO");
}
int main() {
precompute();
read();
preprocess();
solve();
return 0;
}