题意分析
当时感觉就是网络流,然后学了如何建图,但是脑残+手残正反边都给建成INF了,凉凉。
代码总览
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nmax = 100000;
const int INF = 0x3f3f3f3f;
typedef struct {
int to,nxt;
ll w;
}Edge;
Edge e[nmax<<1];
int head[nmax<<1];
int cur[nmax];
int dep[nmax];
ll val[nmax];
ll cost[nmax];
int tot = 0, tt, n, m, n1, n2, S ,T;
ll ans = 0;
void add(int u, int v, ll w){
e[tot].to = v;
e[tot].nxt = head[u];
e[tot].w = w;
head[u] = tot++