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
|
const int inf=0x3f3f3f3f;
const int maxn=200050;
int n,m,k;
int p[maxn];
int head[maxn],num;
int d[maxn],vis[maxn],cnt[maxn];
struct node{
int v,nex;
}e[maxn];
void add(int u,int v)
{
e[++num].nex=head[u];
e[num].v=v;
head[u]=num;
}
void dij(int s)
{
memset(d,0x3f,sizeof(d));
memset(vis,0,sizeof(vis));
priority_queue<PII,vector<PII>,greater<PII> > q;
q.push(make_pair(0,s));
d[s]=0;
while(!q.empty())
{
int u=q.top().second;q.pop();
if(vis[u]) continue;
vis[u]=1;
for(int i=head[u];i;i=e[i].nex)
{
int v=e[i].v;
if(d[v]>d[u]+1)
{
d[v]=d[u]+1;
cnt[v]=1;
q.push(make_pair(d[v],v));
}
else if(d[v]==d[u]+1) cnt[v]++;
}
}
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;read(x),read(y);
add(y,x);
}
cin>>k;
for(int i=1;i<=k;i++) read(p[i]);
int ans1,ans2;
ans1=ans2=0;
dij(p[k]);
for(int i=2;i<=k;i++)
{
if(d[p[i-1]]-1!=d[p[i]]) ans1++,ans2++;
else if(cnt[p[i-1]]>1) ans2++;
}
cout<<ans1<<" "<<ans2<<endl;
return 0;
}
|