#include<bits/stdc++.h>
using namespace std;
int m,n,k;
int a[100];
int b[100];
struct node{
int x;int y;
}kk[100];
int q;
int ka,kb;
int main()
{
scanf("%d%d%d",&m,&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%d",&q);
a[q]=1;
}
for(int i=1;i<=k;i++)
{
scanf("%d%d",&kk[i].x,&kk[i].y);
if(kk[i].x==0)
{
b[kk[i].y]=1;
}
else if(b[kk[i].x]==1)
{
b[kk[i].y]=1;
}
else if(b[kk[i].y]==1)
{
b[kk[i].x]=1;
}
else if(kk[i].y==0)
{
b[kk[i].x]=1;
}
}
scanf("%d%d",&ka,&kb);
if(a[kb]!=1)printf("The city %d is not safe!",kb);
else
{
if(b[kb]==1)printf("The city %d can arrive safely!",kb);
else printf("The city %d can not arrive safely!",kb);
}
return 0;
}
生化危机 (20 分)
最新推荐文章于 2024-07-24 14:05:37 发布