Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<cstdio>#include<cstring>#include<queue>#include<algorithm>#include<vector>using namespace std;const int N = 505;const int M = 20005;const int INF = 0x3f3f3f3f;int head[N];int to[2 * M];int nxt[2 * M];int flow[2 * M];int path[N];int predge[N];bool vis[N];int cnt = 0;int n, m;int s, t;vector<int> vec;void input(){memset(head, -1, sizeof(head));scanf("%d%d", &n, &m);s = 1;t = n;int a, b, c;for(int i = 1; i <= m; i++){scanf("%d%d%d", &a, &b, &c);to[cnt] = b;