[最短路] BZOJ 4239 巴士走读

暴力最短路

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int,int> abcd;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=1000005;

namespace hashmap{
	const int M=3000;
	struct node{
		int x,y,val;
		int next;
	}G[N];
	int head[M][M],inum;
	int Hash(int x,int y){
		int sx=(x%M+M)%M,sy=(y%M+M)%M;
		for (int p=head[sx][sy];p;p=G[p].next)
			if (G[p].x==x && G[p].y==y)
				return G[p].val;
		G[++inum].x=x; G[inum].y=y; G[inum].val=inum; G[inum].next=head[sx][sy]; head[sx][sy]=inum;
		return inum;
	}
}

struct edge{
	int u,v,next;
};

edge G[N];
int head[N],inum;

inline void add(int u,int v,int p){
	G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}

int n,m;
abcd ans[N];
int top;

vector<int> t[300005];

bool vst[N];
int Q[N],l,r;


int ret=-1;

#define V G[p].v
inline void bfs(){
	while(l<r){
		int u=Q[++l];
		for(int p=head[u];p;p=G[p].next)
			if(!vst[V])
				vst[V]=1,Q[++r]=V;
		if(hashmap::G[u].x==1)
			ret=max(ret,hashmap::G[u].y);
	}
}

int main()
{
	int T,u,v,z,w;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(m);
	for (int i=1;i<=m;i++)
	{
		read(u); read(v); read(z); read(w);
		t[u].push_back(z);
		t[v].push_back(w);
		add(hashmap::Hash(v,w),hashmap::Hash(u,z),++inum);
	}
	for (int i=1;i<=n;i++)
	{
		sort(t[i].begin(),t[i].end());
		for(int j=1;j<(signed)t[i].size();j++)
			if(t[i][j]!=t[i][j-1])
				add(hashmap::Hash(i,t[i][j]),hashmap::Hash(i,t[i][j-1]),++inum);
	}
	for (int i=0;i<(signed)t[n].size();i++)
	{
		int iu=hashmap::Hash(n,t[n][i]);
		if (vst[iu]) continue;
		vst[iu]=1; Q[++r]=iu;
		bfs();
		ans[++top]=abcd(t[n][i],ret);
	}
	ans[0].second=-1;
	read(T);
	while (T--)
	{
		read(z);
		printf("%d\n",(lower_bound(ans+1,ans+top+1,abcd(z,1<<30))-1)->second);
	}
	return 0;
}