网络扩容

 求最短路忘了把新的源点的dis初始化，只初始化了1到n

加了两倍的边，邻接表数组应该开M*4

#include 
#include 
#include 
#include 
using namespace std;
int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')  f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
const int N=1e3+5,M=6000,MAX=2147483647;
int n,m,k,a[M],b[M],c[M],d[M],cur[N],dis[N],ans,s,t,h[N];
int had[N],to[M*4],len[M*4],cost[M*4],nxt[M*4],p=1;
int pre[N],point[N],start;
bool f[N];
void add(int x,int y,int z,int w)
{
	nxt[++p]=had[x];
	to[p]=y;
	len[p]=z;
	cost[p]=w;
	had[x]=p;
}
int bfs(int s,int t)
{
	memset(dis,0,sizeof(dis));
	queue  que;
	que.push(s);  dis[s]=1;
	while(que.size())
	{
		int u=que.front();
		que.pop();  cur[u]=had[u];
		for(int i=had[u];i;i=nxt[i])
		{
			int v=to[i];
			if(!len[i]||dis[v])  continue;
			dis[v]=dis[u]+1;
			que.push(v);
		}
	}
	return dis[t];
}
int dfs(int u,int lim)
{
	if(u==t||!lim)  return lim;
	int flow=0;
	for(int i=cur[u];i;i=nxt[i])
	{
		int v=to[i];
		cur[u]=i;
		if(len[i]&&dis[v]==dis[u]+1)
		{
			int x=dfs(v,min(lim-flow,len[i]));
			flow+=x;
			len[i]-=x;
			len[i^1]+=x;
			if(flow==lim)  break;
		}
	}
	return flow;
}
bool dijkstra(int s,int t)
{
	priority_queue < pair > que;
	for(int i=0;i<=n;i++)  {
		dis[i]=MAX;
		f[i]=0;
	}
	dis[s]=0;  que.push(make_pair(0,s));
	while(que.size())
	{
		int u=que.top().second;
		que.pop();
		if(f[u])  continue;
		f[u]=1;
		for(int i=had[u];i;i=nxt[i])
		{
			int v=to[i];
			if(len[i]&&dis[v]>dis[u]+cost[i]+h[u]-h[v])
			{
				dis[v]=dis[u]+cost[i]+h[u]-h[v];
				pre[v]=u;
				point[v]=i;
				que.push(make_pair(-dis[v],v));
			}
		}
	}
	return dis[t]!=MAX;
}
int main()
{
	n=read();  m=read();  k=read();
	s=1;  t=n;
	for(int i=1;i<=m;i++)
	{
		a[i]=read();  b[i]=read();
		c[i]=read();  d[i]=read();
		add(a[i],b[i],c[i],0);  add(b[i],a[i],0,0);
	}
	while(bfs(s,t))  ans+=dfs(s,MAX);
	cout<