NaNa

code#include <bits/stdc++.h>using namespace std;typedef long long ll;const int INF = 0x3f3f3f3f;const ll INFF = 0x3f3f3f3f3f3f3f3f;const ll MOD = 1e9 + 7;const int M = 1e6 + 5;const int N = 1e5 + 5;int n, m, s, t;// Dinic 每次寻找最短的增广路，并沿着..