ZOJ 1825 Compound Words

最新推荐文章于 2025-09-06 09:33:29 发布

转载最新推荐文章于 2025-09-06 09:33:29 发布 · 96 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/crackpotisback/p/4662762.html

文章标签：

#java

本文介绍了一种算法，用于从字典中找出所有由两个单词组成的复合词。输入为按字母顺序排列的单词列表，输出则是同样按字母顺序排列的复合词列表。

Compound Words

Time Limit: 5000ms

Memory Limit: 32768KB

This problem will be judged on ZJU. Original ID: 1825
64-bit integer IO format: %lld Java class name: Main

You are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.

Input

Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will be no more than 120,000 words.

Output

Your output should contain all the compound words, one per line, in alphabetical order.

Sample Input

a
alien
born
less
lien
never
nevertheless
new
newborn
the
zebra

Sample Output

alien
newborn

Source

University of Waterloo Local Contest 1996.09.28

解题：好久没写代码开始脑残了

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 unordered_set<string>us;
 4 string word[1000010];
 5 int main() {
 6     ios::sync_with_stdio(false);
 7     int tot = 0;
 8     while(cin>>word[tot]) us.insert(word[tot++]);
 9     for(int i = 0; i < tot; ++i) {
10         if(word[i].length() > 1) {
11             for(int j = 1,len = word[i].length(); j < len; ++j) {
12                 string a = word[i].substr(0,j);
13                 string b = word[i].substr(j);
14                 if(us.count(a) && us.count(b)) {
15                     cout<<word[i]<<endl;
16                     break;
17                 }
18             }
19         }
20     }
21     return 0;
22 }