Codeforces Round #290 (Div. 2) C. Fox And Names

题意：是否可以构造26个字母的顺序，使得给出的字符串是按字典序排列的

拓扑排序来判断有向图中是否有环，有则存在矛盾。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cmath>

using namespace std;

typedef long long ll;

char w[110][110];

struct node
{
    int to,next;
}e[10010];
int cnt,head[110],deg[110];
int s[50];
char a[30];

void add(int x,int y)
{
    e[cnt].to = y;
    e[cnt].next = head[x];
    head[x] = cnt++;
    deg[y]++;
}

void init()
{
    cnt = 0;
    memset(head,-1,sizeof(head));
    memset(deg,0,sizeof(deg));
}

int main()
{
    int n;

    while(~scanf("%d",&n))
    {
        init();
        for(int i=1;i<=n;i++)
            scanf("%s",w[i]);

        int len1,len2,flag,ans = 0;
        for(int i=2;i<=n;i++)
        {
            flag = 0;
            len1 = strlen(w[i-1]);
            len2 = strlen(w[i]);
            for(int k=0;k<len1 && k<len2;k++)
            {
                if(w[i][k]!=w[i-1][k])
                {
                    add(w[i-1][k]-'a',w[i][k]-'a');
                    flag = 1;
                    break;
                }
            }
            if(!flag && len1>len2)
            {
                ans = -1;
                break;
            }
        }
        if(ans == -1)
        {
            puts("Impossible");
            continue;
        }
        int top = 0;
        for(int i=0;i<26;i++){
            if(deg[i]==0){
                s[top++] = i;
                deg[i] = -1;
            }
        }
        int c = 0;
        while(top>0)
        {
            int u = s[--top];
            a[c++] = u+'a';
            for(int i=head[u];i!=-1;i=e[i].next)
            {
                int v = e[i].to;
//                if(deg[v]!=-1)
//                {
                    deg[v]--;
                    if(deg[v]==0){
                        s[top++] = v;
                        deg[v] = -1;
                    }
//                }
            }
        }
        for(int i=0;i<26;i++)
        {
            if(deg[i]>=0)
            {
                ans = -1;
                break;
            }
        }
        if(ans == -1)
        {
            puts("Impossible");
            continue;
        }
        a[26] = 0;
        cout<<a<<endl;
    }
    return 0;
}