考虑环的两侧,如发现在异侧则表明,边i和边j的关系是i^j=1
另需特判3*n-6
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-5
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
//#define ls(p) e[p].l
//#define rs(p) e[p].r
//#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int >
#define mk make_pair
#define fi first
#define se second
using namespace std;
const int mod=1e9+7;
const int N=2e6+5;//?????????? 4e8.
struct node
{
int ver,next;
}e[N];
int tot,head[N];
int cnt;
int n,m,a[N],b[N],g[2005][2005],aa[N],bb[N],pos[N],cir[N];
int dfn[N],low[N],ins[N];
int c[N],instack[N];
int num,top,res;
void init()
{
for(re i=1;i<=2*max(n,m);i++) c[i]=instack[i]=pos[i]=head[i]=dfn[i]=low[i]=ins[i]=0;
for(re i=1;i<=n;i++) for(re j=1;j<=n;j++) g[i][j]=0;
tot=res=cnt=top=0;
}
void add(int x,int y)
{
e[++tot].ver=y;
e[tot].next=head[x];
head[x]=tot;
}
void addedge(int x,int y)
{
add(x+m,y); add(x,y+m);
add(y,x+m); add(y+m,x);
}
void tarjan(int x)
{
dfn[x]=low[x]=++num;
ins[x]=1;
instack[++top]=x;
for(re i=head[x];i;i=e[i].next)
{
int y=e[i].ver;
if(!dfn[y])
{
tarjan(y);
low[x]=min(low[x],low[y]);
}
else if(ins[y]) low[x]=min(low[x],dfn[y]);
}
if(dfn[x]==low[x])
{
int y;
res++;
do
{
y=instack[top--];
ins[y]=0;
c[y]=res;
}while(y!=x);
}
}
bool check()
{
for(re i=1;i<=(m<<1);i++) if(!dfn[i]) tarjan(i);
for(re i=1;i<=m;i++) if(c[i]==c[i+m]) return 1;
return 0;
}
void solve()
{
cin>>n>>m;
init();
for(re i=1;i<=m;i++)
{
scanf("%d%d",&a[i],&b[i]);
if(a[i]>b[i]) swap(a[i],b[i]);
}
for(re i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
cir[i]=x;
pos[x]=i;
}
if(m>3*n-6) {puts("NO");return;}
for(re i=2;i<=n;i++)
{
int x=cir[i],y=cir[i-1];
if(x>y) swap(x,y);
g[x][y]=1;
}
if(cir[n]>cir[1]) g[cir[1]][cir[n]]=1;
else g[cir[n]][cir[1]]=1;
for(re i=1;i<=m;i++)
{
if(g[a[i]][b[i]]) continue;
aa[++cnt]=a[i],bb[cnt]=b[i];
}
for(re i=1;i<=cnt;i++) for(re j=i+1;j<=cnt;j++)
{
int x=pos[aa[i]],y=pos[bb[i]];
int u=pos[aa[j]],v=pos[bb[j]];
if(u>v) swap(u,v);
if(x>y) swap(x,y);
if((u<x&&x<v&&v<y)||(x<u&&u<y&&y<v)) addedge(i,j);
}
puts(check()?"NO":"YES");
}
signed main()
{
// freopen("P1505_1.txt", "r", stdin);
// freopen("Aout.txt", "w", stdout);
int T=1;
cin>>T;
for(int index=1;index<=T;index++)
{
// printf("Case #%lld: ",index);
solve();
// puts("");
}
return 0;
}
/*
10 5
hbtngdflmj
1 10 1
2 9 0
3 8 1
4 7 0
5 6 1
*/