bzoj 1449 && bzoj 2597 - 一类凸费用网络流

　　对于一个网络$G=(V,E)$，若其中的边权$W_{u,v}$与边$(u,v)$的流量$f_{u,v}$呈凸关系，则可以拆边来搞，设其费用与流量的关系为$g:f_{u,v}\rightarrow W_{u,v}$，那么第i条边容量为1，费用为$g(i)-g(i-1)$。
　　这两题有几个共同点，一是在于凸费用，二是在于需要分配点的流量。前一题我们可以建个二分图，左边的点是竞赛关系，右边是球队的“win”，每个竞赛关系可以让两个球队中的一个“win”，也就是可以流1的流量，球队流向汇点的时候有凸费用。后一题我们可以补集转化一下，将答案变成$maximum\ \ \binom{n}{3}-\sum_{k=1}^n\binom{deg[k]}{2}$，其中$deg[k]$表示k这个点的入度。那么我们就可以沿用上一题的建模来搞了。
　　还有一点要注意的就是边的方向有一些是确定的，所以有初始费用。

bzoj 1449 code:

#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = a , _ = b ; i <= _ ; i ++)
#define per(i,a,b) for (int i = a , _ = b ; i >= _ ; i --)
#define fore(i,u)  for (int i = head[u] ; i ; i = nxt[i])

inline int rd() {
    char c = getchar();
    while (!isdigit(c)) c = getchar() ; int x = c - '0';
    while (isdigit(c = getchar())) x = x * 10 + c - '0';
    return x;
}

inline void upmin(int&a , int b) { if (a > b) a = b; }

const int maxn = 15007;
const int maxm = 200007;
const int inf = 0x5fffffff;

typedef int arr[maxn];
typedef int adj[maxm];

arr head , dis , s , w , l , C , D , pre , vis;
adj fr , to , cap , cost , nxt , flow;

int n , m , S , T , ett , mx_flow , mn_cost;

inline int sqr(int x) { return x * x; }

inline void ins(int u , int v , int c , int w) {
    fr[++ ett] = u , to[ett] = v , cap[ett] = c , cost[ett] = w , nxt[ett] = head[u] , head[u] = ett;
    fr[++ ett] = v , to[ett] = u , cap[ett] = 0 , cost[ett] = -w, nxt[ett] = head[v] , head[v] = ett;
}

inline void ins_cost(int u , int v , int t , int w1 , int w2) {
    rep (i , w[t] + 1 , s[t] - l[t])
        ins(u , v , 1 , w1 * (2 * i - 1) - w2);
}

// n + m + 1 ~ n + m + n : extra points
// n + 1 ~ n + m : request
// 1 ~ n : win

void input() {
    ett = 1;
    n = rd() , m = rd();
    S = n + n + m + 1 , T = S + 1;
    rep (i , 1 , n) {
        int t1 = rd() , t2 = rd();
        C[i] = rd() , D[i] = rd();
        s[i] = t1 + t2;
        w[i] = t1 , l[i] = t2;
//      ins(S , n + m + i , t1 , 0);
//      ins(n + m + i , i , t1 , 0);
    }
    rep (i , 1 , m) {
        int a = rd() , b = rd();
        s[a] ++ , s[b] ++;
        ins(S , n + i , 1 , 0);
        ins(n + i , a , 1 , 0);
        ins(n + i , b , 1 , 0);
    }
    rep (i , 1 , n)
        ins_cost(i , T , i , C[i] + D[i] , 2 * D[i] * s[i]) ,
        mn_cost += C[i] * sqr(w[i]) + D[i] * sqr(s[i] - w[i]);
//  printf("%d\n" , mn_cost);
}

std::queue<int> Q;

bool spfa() {
    rep (i , 1 , T) dis[i] = inf;
    dis[S] = 0 , vis[S] = 1 , Q.push(S);
    while (!Q.empty()) {
        int u = Q.front() ; Q.pop();
        vis[u] = 0;
        fore (i , u) if (cap[i] > flow[i]) {
            int v = to[i];
            if (dis[v] > dis[u] + cost[i]) {
                dis[v] = dis[u] + cost[i];
                pre[v] = i;
                if (!vis[v]) Q.push(v) , vis[v] = 1;
            }
        }
    }
    if (dis[T] == inf) return 0;
    int a = inf;
    for (int e = pre[T] ; e ; e = pre[fr[e]]) upmin(a , cap[e] - flow[e]);
//  printf("%d %d\n" , a , dis[T]);
    mx_flow += a , mn_cost += dis[T] * a;
    for (int e = pre[T] ; e ; e = pre[fr[e]]) flow[e] += a , flow[e ^ 1] -= a;
    return 1;
}

void solve() {
    while (spfa());
    printf("%d\n" , mn_cost);
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("data.txt" , "r" , stdin);
    #endif
    input();
    solve();
    return 0;
}

bzoj 2597 code:

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = a , _ = b ; i <= _ ; i ++)
#define per(i,a,b) for (int i = a , _ = b ; i >= _ ; i --)
#define fore(i,u)  for (int i = head[u] ; i ; i = nxt[i])
#define fir first
#define sec second

inline int rd() {
    char c = getchar();
    while (!isdigit(c)) c = getchar() ; int x = c - '0';
    while (isdigit(c = getchar())) x = x * 10 + c - '0';
    return x;
}

inline void upmin(int&a , int b) { if (a > b) a = b; }

const int maxn = 18007;
const int maxm = 42007;

const int inf = 0x5fffffff;

typedef pair<int , int> pii;
typedef long long ll;

typedef int arr[maxn];
typedef int adj[maxm];

arr head , dis , vis , ind , oud , pre;
adj fr , to , cap , cost , nxt , flow , pp;
int g[207][207];

int tot , ett , S , T , n;

ll ans;

pii cp[maxm];

queue<int> Q;

inline void ins(int u , int v , int c , int w) {
    fr[++ ett] = u , to[ett] = v , cap[ett] = c , cost[ett] = w , nxt[ett] = head[u] , head[u] = ett;
    fr[++ ett] = v , to[ett] = u , cap[ett] = 0 , cost[ett] =-w , nxt[ett] = head[v] , head[v] = ett;
}

inline void ins_cost(int u , int v) {
    rep (i , ind[u] + 1 , n - oud[u])
        ins(u , v , 1 , i - 1);
}

void input() {
    n = rd() , ett = 1;
    rep (i , 1 , n) rep (j , 1 , n) {
        g[i][j] = rd();
        if (g[i][j] == 1) ind[j] ++ , oud[i] ++;
        else if (g[i][j] == 2 && i < j) cp[++ tot] = pii(i , j);
    }
    S = n + tot + 1 , T = S + 1;
//  rep (i , 1 , n) printf("%d %d\n" , ind[i] , oud[i]);
    rep (i , 1 , tot) {
        int a = cp[i].fir , b = cp[i].sec;
        ins(S , n + i , 1 , 0);
        ins(n + i , a , 1 , 0);
        ins(n + i , b , 1 , 0);
        pp[i] = ett - 3;
    }
    rep (i , 1 , n)
        ins_cost(i , T) , ans += 1ll * ind[i] * (ind[i] - 1) / 2;
}

bool spfa() {
    rep (i , 1 , T) dis[i] = inf;
    dis[S] = 0 , Q.push(S);
    while (!Q.empty()) {
        int u = Q.front() ; Q.pop();
        vis[u] = 0;
        fore (i , u) if (cap[i] > flow[i]) {
            int v = to[i];
            if (dis[v] > dis[u] + cost[i]) {
                dis[v] = dis[u] + cost[i];
                pre[v] = i;
                if (!vis[v]) Q.push(v) , vis[v] = 1;
            }
        }
    }
    if (dis[T] == inf) return false;
    int a = 1;
    ans += (ll) a * dis[T];
    for (int e = pre[T] ; e ; e = pre[fr[e]]) flow[e] += a , flow[e ^ 1] -= a;
    return true;
}

void solve() {
    while (spfa())/* printf("%lld\n" , ans)*/;
    ans = 1ll * n * (n - 1) * (n - 2) / 6 - ans;
    printf("%lld\n" , ans);
//  while(1);
    rep (i , 1 , tot) {
        int a = cp[i].fir , b = cp[i].sec;
        if (flow[pp[i]])
            g[a][b] = 0 , g[b][a] = 1;
        else
            g[a][b] = 1 , g[b][a] = 0;
    }
    rep (i , 1 , n) rep (j , 1 , n)
        printf("%d%c" , g[i][j] , j == n ? '\n' : ' ');
}

int main() {
    #ifndef ONLINE_JUDGE
        freopen("jsb10.in" , "r" , stdin);
    #endif
    input();
    solve();
    return 0;
}