Dinic后四个MLE

#include<cstdio>
#define N 5009
#define M 100009

inline int read()
{
	register int ret = 0;
	register bool f = 1;
	register char ch = getchar();
	while (ch < '0' || ch > '9')
		(ch == '-') ? f = 0 : 0, ch = getchar();
	while (ch >= '0' && ch <= '9')
		ret = (ret << 1) + (ret << 3) + (ch ^ 48), ch = getchar();
	return f ? ret : -ret;
}

struct node
{
	int v, w, c, nxt;
}e[M];

int head[N], cnt = 1;

inline void add(int u, int v, int w, int c)
{
	e[++ cnt].v = v, e[cnt].w = w, e[cnt].c = c, e[cnt].nxt = head[u], head[u] = cnt;
}

#include<queue>

using std::queue;

#include<cstring>

using std::memset;

int dis[N], now[N];

bool vis[N];

int s, t;

inline bool SPFA()
{
	memset(dis, 11451419, sizeof dis);
	register int kkk = dis[0];
	queue < int > q;
	q.push(s);
	dis[s] = 0;
	now[s] = head[s];
	register int u, v, c, i;
	while (!q.empty())
	{
		u = q.front();
		q.pop();
		vis[u] = 0;
		for (i = head[u];i;i = e[i].nxt)
		{
			v = e[i].v, c = e[i].c;
			if (e[i].w > 0 && dis[v] > dis[u] + c)
			{
				now[v] = head[v];
				dis[v] = dis[u] + c;
				if (!vis[v])
					q.push(v), vis[v] = 1;
			}
		}
	}
	return dis[t] != kkk;
}

#define min(a, b) (a < b ? a : b)

int MC = 0, MF = 0;

int dfs(register int u, register int flow)
{
	if (u == t)
	{
		MF += flow;
		return flow;
	}
	register int lost = flow, i, v, w, k, c;
	for (i = now[u];i && lost;i = e[i].nxt)
	{
		now[u] = i;
		v = e[i].v, w = e[i].w, c = e[i].c;
		if (w > 0 && dis[v] == dis[u] + c)
		{
			k = dfs(v, min(lost, w));
			if (!k)
			{
				dis[v] = -1;
				continue;
			}
			MC += k * c;
			lost -= k;
			e[i].w -= k;
			e[i ^ 1].w += k;
		}
	}
	return flow - lost;
}

int main()
{
	register int n = read(), m = read(), u, v, w, c, i;
	s = read(), t = read();
	for (i = 1;i <= m;++ i)
		u = read(), v = read(), w = read(), c = read(), add(u, v, w, c), add(v, u, 0, -c);
	while (SPFA())
		dfs(s, 1e9);
	printf("%d %d", MF, MC);
	
	return 0;
}