POJ 2513 Colored Sticks

Colored Sticks

Time Limit: 5000MS		Memory Limit: 128000K
Total Submissions: 28036		Accepted: 7428

Description

You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are of the same color?

Input

Input is a sequence of lines, each line contains two words, separated by spaces, giving the colors of the endpoints of one stick. A word is a sequence of lowercase letters no longer than 10 characters. There is no more than 250000 sticks.

Output

If the sticks can be aligned in the desired way, output a single line saying Possible, otherwise output Impossible.

Sample Input

blue red
red violet
cyan blue
blue magenta
magenta cyan

Sample Output

Possible

Hint

Huge input,scanf is recommended.

Source

The UofA Local 2000.10.14 

无向图欧拉通路：连通图+两个点的度数是奇数。。。。。

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int maxnode=10000000;
int worldnum=0,Father[510000],USize[510000],degree[510000];

struct Trie
{
    int tot,root,child[maxnode][26];
    int flag[maxnode];
    Trie()
    {
        memset(child[1],0,sizeof(child[1]));
        memset(flag,-1,sizeof(flag));
        root=tot=1;
    }
    void Insert(const char* str)
    {
        int *cur=&root;
        for(const char* p=str;*p;*p++)
        {
            cur=&child[*cur][*p-'a'];
            if(*cur==0)
            {
                *cur=tot++;
                memset(child[tot],0,sizeof(child[tot]));
                flag[tot]=-1;
            }
        }
        flag[*cur]=worldnum++;
    }

    int Query(const char*str)
    {
        int* cur=&root;
        for(const char* p=str;*p&&*cur;p++)
        {
            cur=&child[*cur][*p-'a'];
        }
        if(*cur&&~flag[*cur])
        {
            return flag[*cur];
        }
        else
        {
            Insert(str);
            return worldnum-1;
        }
    }
}T;

int Findfather(int x)
{
    if(Father[x]==x)
    {
        return x;
    }
    else
    {
        Father[x]=Father[Father[x]];
        return Findfather(Father[x]);
    }
}

void Disjoin()
{
    for(int i=0;i<510000;i++)
    {
        Father[i]=i; USize[i]=1;
    }
}

void Unionset(int a,int b)
{
    int Fa=Findfather(a);
    int Fb=Findfather(b);
    if(Fa==Fb) return ;
    if(USize[Fa]>=USize[Fb])
    {
        Father[Fa]=Fb;
        USize[Fb]+=USize[Fa];
    }
    else
    {
        Father[Fb]=Fa;
        USize[Fa]+=USize[Fb];
    }
}

int main()
{
    char str1[15],str2[15];
    Disjoin();
    while(scanf("%s %s",str1,str2)!=EOF)
    {
        int a=T.Query(str1);
        int b=T.Query(str2);
        degree[a]++; degree[b]++;
        Unionset(a,b);
    }
    int sum=0;
    for(int i=0;i<worldnum;i++)
    {
        if(degree[i]%2==1) sum++;
    }
    if(sum>2)  { puts("Impossible"); return 0;}
    for(int i=1;i<worldnum;i++)
    {
        if(Findfather(0)!=Findfather(i))
            { puts("Impossible"); return 0;}
    }
    puts("Possible");
    return 0;
}