sgu156

神奇的哈密尔顿回路转欧拉回路。
WA了差不多一天，最后发现欧拉回路写错了，我还是太弱。
题解参见logic大神。

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

inline int read()
{
    int x = 0, f = 1, t = getchar();
    while(t < 48 || t > 57) t == 45 ? f = -1 : 0, t = getchar();
    while(t >= 48 && t <= 57) x = (x<<1) + (x<<3) + t - 48, t = getchar();
    return x * f;
}

const int maxn = 10005;
const int maxm = 200005;

int n, m, et, top, color;
int head[maxn];
int next[maxm], v[maxm];
int deg[maxn], col[maxn];
bool vis[maxn], vise[maxm];

inline void addedge(int a, int b)
{
    v[et] = b, next[et] = head[a], head[a] = et++;
}
void dfs(int x, int c)
{
    vis[x] = 1;
    for(int i = head[x]; i != -1; i = next[i])
    {
        int k = v[i];
        if(!vis[k] && !vise[i])
        {
            if(c && col[x] == col[k])
            {
                vise[i] = vise[i^1] = 1;
                dfs(k, 0);
            }
            else if((!c && col[x] != col[k]) || deg[x] == 2)
            {
                vise[i] = vise[i^1] = 1;
                dfs(k, 1);
            }
        }
    }
    printf("%d ", x);
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    n = read(), m = read();
    memset(head, -1, sizeof(head));
    for(int i = 1; i <= m; ++i)
    {
        int a = read(), b = read();
        addedge(a, b), addedge(b, a);
        deg[a]++, deg[b]++;
    }
    for(int i = 1; i <= n; ++i)
        if(deg[i] & 1) return puts("-1"), 0;
    for(int i = 1; i <= n; ++i)
    {
        if(deg[i] > 2 && !col[i])
        {
            col[i] = ++color;
            for(int j = head[i]; j != -1; j = next[j])
            {
                if(deg[v[j]] > 2)
                    col[v[j]] = color;
            }
        }
        else if(deg[i] == 2)
        {
            col[i] = ++color;
        }
    }
    dfs(1, 0);

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