UVa OJ 10054 Necklace

题意：给你一些两端各有一种颜色的珠子，只有颜色相同的端才可以相邻，时候可以组成一条项链

方法：eulerian cycle 欧拉回路

把颜色当作端点，珠子看作边，求是否存在欧拉回路。只有当图为联通而且每个点的degree均为偶数时，才存在欧拉回路。注意，寻找欧拉回路的时候要逆序。

code:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#include <fstream>
#include <cassert>

#include <cmath>
#include <sstream>
#include <time.h>
#include <complex>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define DFOR(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define rep(i,n) FOR(i,0,n)
#define repn(i,n) FORN(i,1,n)
#define drep(i,n) DFOR(i,n-1,0)
#define drepn(i,n) DFOR(i,n,1)
#define MAX(a,b) a = Max(a,b)
#define MIN(a,b) a = Min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define Reset(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(all(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)
#define forever for(;;)
#define PINF 1000000000000
#define newline '\n'

#define test if(1)if(0)cerr
using namespace std;

using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<double,double> dd;
typedef pair<char,char> cc;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l4;
const double pi = acos(-1.0);

const int max_c = 50+1;
int adj[max_c][max_c];
bitset<max_c> vis;
int degree[max_c];
struct dsu
{
    int pa[max_c];
    int total_cnt;
    void init()
    {
        total_cnt = max_c;
        rep(i, max_c)
        {
            pa[i] = i;
        }
    }
    int findpa(int id)
    {
        return id==pa[id]?id:pa[id]=findpa(pa[id]);
    }
    void merge(int x, int y)
    {
        x = findpa(x), y = findpa(y);
        if (x != y)
        {
            pa[x] = y;
            total_cnt -= 1;
        }
    }
} solver;
bool valid()
{
    if (solver.total_cnt != 1+max_c-vis.count())
        return false;
    rep(i, max_c) if (degree[i] % 2) return false;
    return true;
}
void dfs(int cur)
{
    rep(i, max_c) if (adj[cur][i])
    {

        adj[cur][i] -= 1;
        adj[i][cur] -= 1;

        dfs(i);
        cout << i << " " << cur << newline;
    }
}
int main()
{
    int T;  cin >> T;
    repn(kase, T)
    {
        vis.reset();
        Reset(adj, 0);
        Reset(degree, 0);
        solver.init();
        int n;  cin >> n;
        rep(i, n)
        {
            int a, b;   cin >> a >> b;
            adj[a][b] += 1;
            adj[b][a] += 1;
            degree[a] += 1;
            degree[b] += 1;
            vis[a] = vis[b] = true;
            solver.merge(a, b);
        }
        cout << "Case #" << kase << newline;
        if (!valid())
        {
            cout << "some beads may be lost\n";
        }
        else
        {
            rep(i, max_c) if (vis[i])
            {
                dfs(i);
                break;
            }
        }
        
        
        if (kase != T)
            cout << newline;
    }
}

/*
 2
 5 
 1 2
 2 3
 3 4
 4 5
 5 6
 5 
 2 1
 2 2
 3 4
 3 1
 2 4
*/