sgu122

满足ore性质的哈密尔顿回路

题目大意：
给你一个n个点的无向图，满足每个点的度数不小于$\frac{n+1}{2}$

方法网上有，这里不赘述了。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

inline bool read(int &x)
{
    register int f = 1, t = getchar();
    x = 0;
    while(t < '0' || t > '9') {
        if(t == '-') f = -1;
        t = getchar();
    }
    while(t >= '0' && t <= '9') {
        x = (x<<1) + (x<<3) + t - '0';
        t = getchar();
    }
    x *= f;
    return t == ' ';
}

const int maxn = 1005;
int n, e[maxn][maxn];
int book[maxn], beside[maxn];
int head, tail, left[maxn], right[maxn], len;

inline void link(const int &x, const int &y)
{
    right[x] = y, left[y] = x;
}
bool add(int x, bool flag)
{
    register int i, j;
    for(i = 1; i <= n; ++i) {
        if(e[x][i] && !book[i])
        {
            book[i] = 1, ++len;
            for(j = 1; j <= n; ++j)
                if(e[i][j]) beside[j] = i;
            if(!flag) link(i, head), head = i;
            else link(tail, i), tail = i;
            return 1;
        }
    }
    return 0;
}
void init()
{
    register int i, x;
    read(n);
    for(i = 1; i <= n; ++i) {
        bool flag = 1;
        while(flag) {
            flag = read(x);
            if(i == 1 && !tail) tail = x;
            e[i][x] = e[x][i] = 1;
        }
    }
}
void work()
{
    register int i, j, k;
    memset(left, -1, sizeof(left));
    memset(right, -1, sizeof(right));
    link(head = 1, tail), len = 2;
    book[head] = book[tail] = 1;
    while(1) {
        while(add(head, 0));
        while(add(tail, 1));
        if(e[head][tail]) {
            if(len == n) {
                link(tail, head);
                break;
            }
            for(i = 1; i <= n; ++i) {
                if(!book[i] && beside[i]) {
                    book[i] = 1, ++len;
                    link(tail, head);
                    head = i, tail = left[beside[i]];
                    link(head, beside[i]);
                    break;
                }
            }
        }
        else for(i = right[head]; right[i] != tail; i = right[i]) {
            j = right[i];
            if(e[head][j] && e[i][tail]) {
                for(k = tail; k != i; k = right[k])
                    swap(left[k], right[k]);
                link(i, tail);
                tail = j;
                break;
            }
        }
    }
    for(i = 1; right[i] != 1; i = right[i])
        printf("%d ", i);
    printf("%d %d\n", i, 1);
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif

    init();
    work();

    #ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
    #endif
    return 0;
}