洛谷P2770 航空路线问题(费用流)

题意

$n$个点从左向右依次排列，有$m$条双向道路

问从起点到终点，再从终点回到起点，在经过的点不同的情况下最多能经过几个点

Sol

首先，问题可以转化为求两条互不相交的路径，使得点数最多

为了满足流量的限制，肯定会想到拆点，把每个点拆为两个，连流量为$1$,费用为$1$的边

起点和终点连费用为1，流量为2的边

输出方案比较蛋疼，我是dfs两次，然后第二次倒着输出

但是$a->c->a$这种情况会WA，so只好打表喽

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<map>
#include<iostream>
using namespace std;
const int MAXN = 1e4 + , INF = 1e9 + ;
inline int read() {
    char c = getchar(); int x = , f = ;
    while(c < '' || c > '') {if(c == '-') f = ; c = getchar();}
    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();
    return x * f;
}
int N, M, S, T;
map<string, int> ID;
map<int, string> nam;
int flag[MAXN];
struct Edge {
    int u, v, w, f, nxt, vi;
}E[MAXN];
int head[MAXN], num = ;
inline void add_edge(int x, int y, int w, int f) {
    E[num] = (Edge) {x, y, -w, f, head[x], };
    head[x] = num++;
}
inline void AddEdge(int x, int y, int w, int f) {
    add_edge(x, y, w, f); add_edge(y, x, -w, );
}
int dis[MAXN], vis[MAXN], Pre[MAXN];
bool SPFA() {
    memset(dis, 0x3f, sizeof(dis));
    memset(vis, , sizeof(vis));
    queue<int> q; q.push(S); dis[S] = ;
    while(!q.empty()) {
        int p = q.front(); q.pop(); vis[p] = ;
        for(int i = head[p]; i != -; i = E[i].nxt) {
            int to = E[i].v;
            if(E[i].f && dis[to] > dis[p] + E[i].w) {
                dis[to] = dis[p] + E[i].w; Pre[to] = i;
                if(!vis[to]) vis[to] = , q.push(to);
            }
        }
    }
    return dis[T] <= INF;
}
int F() {
    int flow = INF;
    for(int i = T; i != S; i = E[Pre[i]].u) flow = min(flow, E[Pre[i]].f);
    for(int i = T; i != S; i = E[Pre[i]].u) E[Pre[i]].f -= flow, E[Pre[i] ^ ].f += flow;
    return flow * dis[T];
}
int MCMF() {
    int ans = ;
    while(SPFA()) ans += F();
    return ans;
}
int out[][MAXN], tot[];
void dfs(int now, int opt) {
    if(vis[now] || now == N) return ;
    vis[now] = ;
    for(int i = head[now]; i != -; i = E[i].nxt) {
        int to = E[i].v;
        if((E[i].u <= N && E[i].v >= N && (E[i].u + N != to)) || (to > N && to - N < out[opt][tot[opt]])) continue;
        if(!vis[to] && E[i].f < ) {
            E[i].vi = ;
            if(to == E[i].u + N) out[opt][++tot[opt]] = E[i].u;
            dfs(E[i].v, opt);
        }
    }
}
int main() {
    memset(head, -, sizeof(head));
    N = read(); M = read(); S = ; T = N + N;
    for(int i = ; i <= N; i++) {
        string s; cin >> s; ID[s] = i; nam[i] = s;
        AddEdge(i, i + N, , (i ==  || i == N) ?  : );
    }
    for(int i = ; i <= M; i++) {
        string a, b; cin >> a >> b;
        if(ID[a] > ID[b]) swap(a, b);
        AddEdge(ID[a] + N, ID[b], , );
    }
    int ans = -MCMF() - ;
    if(ans <= -) {puts("No Solution!"); return ;}
    if(ans == ) {
        printf("2\n");
        cout << nam[] << endl;
        cout << nam[N] << endl;
        cout << nam[] << endl;
        return ;
    }
    printf("%d\n", ans);
    memset(vis, , sizeof(vis)); dfs(, );
    memset(vis, , sizeof(vis));
    for(int i = ; i <= tot[]; i++) vis[out[][i]] = ; vis[] = ;
    dfs(, );
    for(int i = ; i <= tot[]; i++)
        cout << nam[out[][i]] << endl;
    cout << nam[N] << endl;
    for(int i = tot[]; i >= ; i--)
        cout << nam[out[][i]] << endl;
    return ;
}
/*
 
*/