UVA 10129 Play on Words
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 N that indicates the number of plates (1 ≤ N ≤ 100000). Then exactly N lines 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.
感谢大佬们的思路及代码。原来字符也可以并查集。长见识了。
//Asimple #include <bits/stdc++.h> #define INF (1<<20) #define mod 10007 #define swap(a,b,t) t = a, a = b, b = t #define CLS(a, v) memset(a, v, sizeof(a)) #define debug(a) cout << #a << " = " << a <<endl using namespace std; typedef long long ll; const int maxn = 30+5; const double PI=atan(1.0)*4; ll n, m, res, ans, len, T, k, num, sum, l; int fa[maxn]; int ind[maxn], oud[maxn]; int rk[maxn]; void init(){ CLS(ind, 0); CLS(oud, 0); for(int i=0; i<maxn; i++){ fa[i] = i; rk[i] = 0; } } int find_set(int x){ return fa[x]= (fa[x]==x?x:find_set(fa[x])); } void make_set(int x, int y){ x = find_set(x); y = find_set(y); if( rk[x]>rk[y] ) { fa[y] = x; } else { if( rk[x]==rk[y] ) rk[y]++; fa[x] = y; } } void solve(){ bool f = true; int cnt = 0; for(int i=0; i<maxn; i++) { if( (ind[i] || oud[i] ) && fa[i]==i) cnt ++; } if( cnt!=1 ) f = false; int sumin=0, sumou=0; for(int i=0; i<maxn; i++) { if( !f ) break; if( ind[i]!=oud[i] ){ if( ind[i]==oud[i]+1) sumin ++; else if( oud[i]==ind[i]+1 ) sumou++; else f = false; } } if( sumin && sumou && sumin+sumou>2 ) f = false; if( f ) cout << "Ordering is possible." << endl; else cout << "The door cannot be opened." << endl; } void input() { ios_base::sync_with_stdio(false); cin >> T; while( T -- ) { cin >> n; init(); for(int i=0; i<n; i++) { string str; cin >> str; int a = str[0]-'a', b=str[str.length()-1]-'a'; oud[a]++; ind[b]++; make_set(a, b); } solve(); } } int main(){ input(); return 0; }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· 终于写完轮子一部分:tcp代理 了,记录一下
· 震惊!C++程序真的从main开始吗?99%的程序员都答错了
· 别再用vector<bool>了!Google高级工程师:这可能是STL最大的设计失误
· 单元测试从入门到精通
· 【硬核科普】Trae如何「偷看」你的代码?零基础破解AI编程运行原理
2016-05-12 ACM题目————Sunscreen
2016-05-12 ACM题目————区间覆盖问题