WA掉第二个点，不是萌新

#include<bits/stdc++.h>
using namespace std;

const int N=202;

int n,m,pre[N],p[N],dis[N][N],res;

int bfs(int s,int t)
{
	queue<int>q;	memset(p,0,sizeof(p));
	p[s]=10000000*N;	q.push(s);
	while(!q.empty())
	{
		int u=q.front();	q.pop();
		for(int i=1;i<=m;i++)
			if(!p[i]&&dis[u][i])
			{
				p[i]=min(p[u],dis[u][i]);
				pre[i]=u;	q.push(i);
				if(i==t) return p[i];
			}
	}
	return 0;
}
int main()
{
//	freopen("ditch.in","r",stdin);
//	freopen("ditch.out","w",stdout);
	int mi;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		dis[a][b]=c;
	}
	while(1)
	{
		mi=bfs(1,m);
		if(!mi) break;
		res+=mi;
		for(int i=m;i!=1;i=pre[i])
			dis[pre[i]][i]-=mi,
			dis[i][pre[i]]+=mi;
	}
	printf("%d\n",res);
	return 0;
}