【POJ1637】Sightseeing tour（混合图欧拉回路）

Description

判断混合图是否存在欧拉回路。

---

Solution

我们先对每条无向边任意定向，算出每条边的入度、出度差，我们现在可以将一些无向边反向来使入度出度相等。
$S$向所有入度大于$0$的点连边，入度小于$0$的点向$T$连边，流量为$\frac{|indeg-outdeg|}{2}$（如果不是$2$的倍数，那么直接判断为无解），中间连无向边，流量为$1$。
如果满流那么存在欧拉回路。

---

Code

/************************************************
 * Au: Hany01
 * Date: Aug 14th, 2018
 * Prob: POJ1637
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cassert>
#include<queue>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 305, maxm = maxn * maxn << 1;

int n, m, e, S, T, beg[maxn], nex[maxm], v[maxm], f[maxm], lev[maxn], deg[maxn], w[maxn][maxn];

inline void add(int uu, int vv, int ff, int ty = 1) {
    v[++ e] = vv, f[e] = ff, nex[e] = beg[uu], beg[uu] = e;
    if (ty) add(vv, uu, 0, 0);
}

inline int BFS() {
    static queue<int> q; q.push(S), Set(lev, 0), lev[S] = 1;
    while (!q.empty()) {
        register int u = q.front(); q.pop();
        for (register int i = beg[u]; i; i = nex[i])
            if (f[i] && !lev[v[i]]) lev[v[i]] = lev[u] + 1, q.push(v[i]);
    }
    return lev[T];
}

int DFS(int u, int flow) {
    if (u == T) return flow;
    int t, res = flow;
    for (register int i = beg[u]; i; i = nex[i])
        if (f[i] && lev[v[i]] == lev[u] + 1) {
            f[i] -= (t = DFS(v[i], min(f[i], res))), f[i ^ 1] += t;
            if (!(res -= t)) return flow;
        }
    return flow - res;
}

int main()
{
#ifdef hany01
    freopen("poj1637.in", "r", stdin);
    freopen("poj1637.out", "w", stdout);
#endif

    for (static int Case = read(), uu, vv, ty, Ans, full, mk; Case --; ) {
        n = read(), m = read(), e = 1, Set(beg, 0), T = (S = n + 1) + 1, Set(deg, 0), Set(w, 0), Ans = full = mk = 0;
        For(i, 1, m) {
            -- deg[uu = read()], ++ deg[vv = read()], ty = read();
            if (ty != 1) ++ w[vv][uu];
        }
        For(i, 1, n) {
            if (deg[i] % 2) { mk = 1; break; }
            if (deg[i] > 0) add(S, i, deg[i] >> 1), full += (deg[i] >> 1);
            else if (deg[i] < 0) add(i, T, -deg[i] >> 1);
        }
        if (mk) { puts("impossible"); continue; }
        For(i, 1, n) For(j, 1, n) if (w[i][j]) add(i, j, w[i][j]);
        while (BFS()) Ans += DFS(S, INF);
        puts(full == Ans ? "possible" : "impossible");
    }

    return 0;
}