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): 9145    Accepted Submission(s): 3165


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.
 

题目大意:给若干个单词,相连条件为一个单词的尾字母与另一个单词的首字母相同,问这几个单词能不能形成一个环或者是一条链

用并查集处理,如果是一条链,那么肯定是有两个点,他们的出度入度相差1,如果是一个环,那么就是欧拉回路

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int num[30];
bool vis[30];
int tree[30];
int in[30];
int out[30];
void init() {
    for(int i=0;i<30;i++) {
        tree[i]=i;
    }
}
int find(int x) {
    return tree[x]==x?x:tree[x]=find(tree[x]);
}
void merge(int a,int b) {
    int x=find(a);
    int y=find(b);
    if(x!=y) tree[x]=y;
    return;
}
int main() {
    int test;
    cin>>test;
    while(test--) {
        init();
        memset(num,0,sizeof(num));
        memset(in,0,sizeof(in));
        memset(out,0,sizeof(out));
        memset(vis,false,sizeof(vis));
        int n;
        cin>>n;
        for(int i=0;i<n;i++) {
            string str;
            cin>>str;
            int a=str[0]-'a';
            int b=str[str.size()-1]-'a';
            num[a]++;
            num[b]++;
            out[a]++;
            in[b]++;
            merge(a,b);
            vis[a]=vis[b]=true;
        }
        int cnt=0;
        for(int i=0;i<26;i++) {
            if(vis[i]&&tree[i]==i) {
                cnt++;
            }
        }
        if(cnt>1) cout<<"The door cannot be opened."<<endl;
        else {
            int a=0,b=0,c=0;
            for(int i=0;i<26;i++) {
                if(vis[i]&&in[i]!=out[i]) {
                    if(in[i]==out[i]+1) {
                        a++;
                    }
                    else if(in[i]==out[i]-1) {
                        b++;
                    }
                    else c++;
                }
            }
            if(c) cout<<"The door cannot be opened."<<endl;
            else {
                if((a==1&&b==1)||(!a&&!b)) {
                    cout<<"Ordering is possible."<<endl;
                }
                else cout<<"The door cannot be opened."<<endl;
            }
        }
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值