zoukankan      html  css  js  c++  java
  • hdu 1116 Play on Words 欧拉路径+并查集

    Play on Words

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 7791    Accepted Submission(s): 2676


    Problem Description
    Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important for us.

    There is a large number of magnetic plates on every door. Every plate has one word written on it. The plates must be arranged into a sequence in such a way that every word begins with the same letter as the previous word ends. For example, the word ``acm'' can be followed by the word ``motorola''. Your task is to write a computer program that will read the list of words and determine whether it is possible to arrange all of the plates in a sequence (according to the given rule) and consequently to open the door.
     
    Input
    The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing a single integer number Nthat indicates the number of plates (1 <= N <= 100000). Then exactly Nlines follow, each containing a single word. Each word contains at least two and at most 1000 lowercase characters, that means only letters 'a' through 'z' will appear in the word. The same word may appear several times in the list.
     
    Output
    Your program has to determine whether it is possible to arrange all the plates in a sequence such that the first letter of each word is equal to the last letter of the previous word. All the plates from the list must be used, each exactly once. The words mentioned several times must be used that number of times.
    If there exists such an ordering of plates, your program should print the sentence "Ordering is possible.". Otherwise, output the sentence "The door cannot be opened.".
     
    Sample Input
    3 2 acm ibm 3 acm malform mouse 2 ok ok
     
    Sample Output
    The door cannot be opened. Ordering is possible. The door cannot be opened.
     
    Source
     题意:给你T组数据,n个字符串,问能否成语接龙,使得全部字符串用完;
    思路:欧拉路径+并查集;
    #include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define mod 1000000007
    #define esp 0.00000000001
    const int N=1e5+10,M=1e6+10,inf=1e9;
    const ll INF=1e18+10;
    int fa[110],du[110],flag[110];
    int Find(int x)
    {
        return x==fa[x]?x:fa[x]=Find(fa[x]);
    }
    void update(int u,int v)
    {
        int x=Find(u);
        int y=Find(v);
        if(x!=y)
        {
            fa[x]=y;
        }
    }
    void init()
    {
        for(int i=0;i<=30;i++)
            fa[i]=i;
        memset(du,0,sizeof(du));
        memset(flag,0,sizeof(flag));
    }
    char a[N];
    int main()
    {
        int T;
        scanf("%d",&T);
        while(T--)
        {
            init();
            int n,p=-1;
            scanf("%d",&n);
            for(int i=1;i<=n;i++)
            {
                scanf("%s",a);
                int u=a[0]-'a'+1;
                int v=a[strlen(a)-1]-'a'+1;
                update(u,v);
                du[u]++;
                du[v]--;
                flag[u]++;
                flag[v]++;
            }
            int ans1=0,ans2=0;
            for(int i=1;i<=26;i++)
            {
                if(!flag[i])
                    continue;
                if(du[i]==0)
                {
                    if(p==-1)
                    p=Find(i);
                    if(Find(i)!=p)
                    {
                    ans1=-1;
                    break;
                    }
                }
                if(du[i]==-1)
                    ans1++;
                if(du[i]==1)
                    ans2++;
                if(du[i]<=-2||du[i]>=2)
                {
                    ans1=-1;
                    break;
                }
            }
            if((ans1==0&&ans2==0)||(ans1==1&&ans2==1))
                printf("Ordering is possible.
    ");
            else
                printf("The door cannot be opened.
    ");
        }
        return 0;
    }
  • 相关阅读:
    安装elasticsearch 和 kibana
    docker 安装 nignx 并将对应配置文件映射
    linux 操作笔记
    docker 一些常用的命令手记
    c# 异步 多线程
    从零开始在.net中使用Nhibernate对数据库进行操作详细步骤(20121128)
    NHibernate框架的HQL增删改查
    2012年11月19日 利用wifiap简单实现Wifi无线Web认证
    逻辑结构和物理结构
    日志
  • 原文地址:https://www.cnblogs.com/jhz033/p/6114605.html
Copyright © 2011-2022 走看看