和之前那一篇次短路有相似之处:次短路
len[0]表示偶数最短路
len[1]表示奇数最短路
/*
* @Description:
* @Autor: Kadia
* @Date: 2020-07-06 20:13:40
* @LastEditors: Kadia
* @Connect: vx:ccz1354 qq:544692713
* @LastEditTime: 2020-07-06 23:47:49
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
struct _edge
{
int from;
int to;
int cost;
};
int len[2][100005];
int vis[2][100005];
int main()
{
int n,m,q;
cin >> n >> m >> q;
vector<_edge>save[100005];
int x,y;
for(int i=1;i<=m;i++)
{
cin >> x >> y;
save[x].push_back(_edge{x,y,1});
save[y].push_back(_edge{y,x,1});
}
for(int i=0;i<=1;i++)
for(int j=1;j<=n;j++)
len[i][j]=inf;
priority_queue<pair<int,int>,vector<pair<int,int> > ,greater<pair<int,int> > > que;
que.push({0,1});
len[0][1]=0;
while(que.size())
{
int w=que.top().second;
int v=que.top().first;
que.pop();
if(vis[v%2][w])
continue;
vis[v%2][w]++;
for(int i=0;i<save[w].size();i++)
{
_edge e=save[w][i];
if(v+e.cost<len[(v+e.cost)%2][e.to])
{
len[(v+e.cost)%2][e.to]=v+e.cost;
que.push({v+e.cost,e.to});
}
}
}
int l;
while(q--)
{
cin >> x >> l;
if(len[l%2][x]<=l)
cout << "Yes" << endl;
else
cout << "No" << endl ;
}
return 0;
}