BZOJ 1997 HNOI 2010 Planar 2-SAT

已知图和其哈密尔顿回路，判断是否是平面图。

平面图要求边不相交，而哈密尔顿回路是圈（废话），其他的边都可以看作是在圈上，那么问题就变成POJ 3207了。。。

但是发现构出来的图是无向图所以并查集就好了
然而并查集比Tarjan慢，毕竟复杂度多了个$\log n$

Tarjan:

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define ms(i) memset(i,0,sizeof i)
#define rep(i,j,k) for(i=j;i<k;++i)
const int N = 1005, M = 600000;
int h[N], p[M], v[M], x[N], y[N], pos[N], cnt = 0;
int dfn[N], low[N], belong[N], ts = 0, top = 0, scc = 0;
int stack[N], instack[N];
void add(int a, int b) {
    p[++cnt] = h[a]; v[cnt] = b; h[a] = cnt;
}

void tarjan(int x) {
    int i;
    dfn[x] = low[x] = ++ts;
    instack[x] = 1; stack[++top] = x;
    for (i = h[x]; i; i = p[i])
        if (!dfn[v[i]]) {
            tarjan(v[i]);
            low[x] = min(low[v[i]], low[x]);
        } else if (instack[v[i]])
            low[x] = min(dfn[v[i]], low[x]);
    if (dfn[x] == low[x]) {
        ++scc;
        do {
            i = stack[top--];
            instack[i] = 0;
            belong[i] = scc;
        } while (i != x);
    }
}

int main() {
    int n, m, i, j, t;
    scanf("%d", &t);
    while (t--) {
        ms(h); ms(dfn); cnt = ts = scc = top = 0;
        scanf("%d%d", &n, &m);
        rep(i,0,m) scanf("%d%d", x + i, y + i);
        rep(i,0,n) scanf("%d", &j), pos[j] = i;
        if (m > 3 * n - 6) { puts("NO"); continue; }
        rep(i,0,m) {
            x[i] = pos[x[i]], y[i] = pos[y[i]];
            if (x[i] > y[i]) swap(x[i], y[i]);
            // 在哈密尔顿回路上的边不算 
            if (y[i] - x[i] == 1 || y[i] - x[i] == n - 1) continue;
            x[cnt] = x[i], y[cnt++] = y[i];
        }
        m = cnt; cnt = 0;
        rep(i,0,m) rep(j,i+1,m)
            if (x[i] < x[j] && y[i] > x[j] && y[i] < y[j] ||
                x[i] > x[j] && x[i] < y[j] && y[i] > y[j]) {
                add(i, j + m); add(j, i + m);
                add(i + m, j); add(j + m, i);
            }
        bool flag = true;
        rep(i,0,2*m) if (!dfn[i]) tarjan(i);
        rep(i,0,m) if (belong[i] == belong[i + m])
        { flag = false; break; }
        puts(flag ? "YES" : "NO");
    }
    return 0;
}

并查集

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define ms(i) memset(i,0,sizeof i)
#define rep(i,j,k) for(i=j;i<k;++i)
const int N = 10005;
int x[N], y[N], pos[N], fa[N], cnt = 0;
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
void merge(int a, int b) {
    a = find(a); b = find(b);
    if (a != b) fa[a] = b;
}
int main() {
    int n, m, i, j, t;
    scanf("%d", &t);
    while (t--) {
        cnt = 0;
        scanf("%d%d", &n, &m);
        rep(i,0,m) scanf("%d%d", x + i, y + i);
        rep(i,0,n) scanf("%d", &j), pos[j] = i;
        if (m > 3 * n - 6) { puts("NO"); continue; }
        rep(i,0,m) {
            x[i] = pos[x[i]], y[i] = pos[y[i]];
            if (x[i] > y[i]) swap(x[i], y[i]);
            // 在哈密尔顿回路上的边不算 
            if (y[i] - x[i] == 1 || y[i] - x[i] == n - 1) continue;
            x[cnt] = x[i], y[cnt++] = y[i];
        }
        m = cnt; cnt = 0;
        rep(i,0,2*m) fa[i] = i;
        rep(i,0,m) rep(j,i+1,m)
            if (x[i] < x[j] && y[i] > x[j] && y[i] < y[j] ||
                x[i] > x[j] && x[i] < y[j] && y[i] > y[j])
                merge(i, j + m), merge(i + m, j);
        bool flag = true;
        rep(i,0,m) if (find(i) == find(i + m))
        { flag = false; break; }
        puts(flag ? "YES" : "NO");
    }
    return 0;
}