Colored Sticks

http://poj.org/problem?id=2513 

总结：判断是否是欧拉图就是可以判断可不可以拉成一条链，记录颜色出现次数就是图的度数；

欧拉图：奇数度0或2

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/



const int maxn=2e6+9;
const int mod=1e9+7;

int tree[maxn][5],sum[maxn];
int flagg[maxn];
int tot;
vector<int>ans;
int p[maxn];
int Find(int x)
{
    return x==p[x]?x:p[x]=Find(p[x]);
}
void join(int u,int v)
{
    int ju=Find(u);
    int jv=Find(v);
    if(jv!=ju) p[jv]=ju;
}

int insert_str(char *str)
{
    int len=strlen(str);
    int rt=0;
    for(int i=0;i<len;i++)
    {
        int id=str[i]-'a';
        if(!tree[rt][id]) tree[rt][id]=++tot;
        rt=tree[rt][id];
    }
    sum[rt]++;
    if(!flagg[rt]) ans.pb(rt);
    flagg[rt]=1;
    return rt;
}
int find_str(char *str)
{
    int len=strlen(str);
    int rt=0;
    for(int i=0;i<len-1;i++)
    {
        int id=str[i]-'a';
        if(!tree[rt][id]) return 0;
        rt=tree[rt][id];
    }
    return 0;
}
void init()
{
    for(int i=0;i<=tot;i++)
    {
        sum[i]=0;
        flagg[i]=0;
        for(int j=0;j<30;j++) tree[i][j]=0;
    }
    tot=0;
}
char s1[100],s2[100];

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    init();
    ans.clear();
    for(int i=0;i<maxn;i++) p[i]=i;
    int num=0;
    while(~sfs(s1))
    {
        sfs(s2);
        int u=insert_str(s1);
        int v=insert_str(s2);
        join(u,v);
    }
    bool f=1;
    for(int i=0;i<ans.size();i++)
    {
        if(Find(ans[i])!=Find(ans[0])) f=0;
        if(sum[ans[i]]%2) num++;
    }
    if(!f) puts("Impossible");
    else
    {
        if(num==0||num==2) puts("Possible");
        else puts("Impossible");
    }

    return 0;
}