HDU-1247 Hat’s Words (Trie 字典树)
来源:互联网 发布:网站域名后缀有哪些 编辑:程序博客网 时间:2024/06/08 12:24
Hat’s Words
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16368 Accepted Submission(s): 5835
Problem Description
A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.
You are to find all the hat’s words in a dictionary.
You are to find all the hat’s words in a dictionary.
Input
Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will be no more than 50,000 words.
Only one case.
Only one case.
Output
Your output should contain all the hat’s words, one per line, in alphabetical order.
Sample Input
aahathathatwordhzieeword
Sample Output
ahathatword
#include <bits/stdc++.h>using namespace std;int ch[500000][26], st[50002 * 26 * 20], tot; //st[i] == 1表示结点i是某个单词的结尾string s[50005];void insert(string s){int k = 0, y;for(int i = 0; i < s.size(); ++i){y = s[i] - 'a';if(ch[k][y] == 0){ch[k][y] = ++tot;}k = ch[k][y];}st[k] = 1;}bool check(string s, int pos){int k = 0, y;for(int i = pos; i < s.size(); ++i){y = s[i] - 'a';if(ch[k][y] == 0) return false;k = ch[k][y];}if(st[k]) return true;return false;}bool query(string s){int k = 0, y;for(int i = 0; i < s.size(); ++i){y = s[i] - 'a';if(ch[k][y] == 0){return false;}k = ch[k][y];if(st[k] == 1){if(check(s, i + 1)){return true;}}}return false;}int main(){int x = 1;tot = 0;while(cin>>s[x]){insert(s[x]);x++;}for(int i = 1; i < x; ++i){if(query(s[i])){cout<<s[i]<<endl;}}}/*题意:一共50000个单词,问哪些单词可以由其余单词中的两个拼接而成。比如hmc可以由hm和c拼接成。单词长度没说。。。思路:trie的小应用,对所有的单词建trie,然后在这棵trie上枚举所有单词,当遇到st值为1时再判断接下来的部分是否是一个完整的单词即可。这个方法很容易想到,应该可以被优化,欢迎指点。。。*/
阅读全文
0 0
- HDU 1247 Hat’s Words && Trie(字典树)
- HDU ACM 1247-Hat’s Words-字典树(Trie)
- HDU-1247 Hat’s Words (Trie 字典树)
- HDU 1247 Hat’s Words(字典树Trie)
- HDU 1247 Hat's words(字典树Trie)
- HDU 1247 Hat’s Words(字典树Trie)
- hdu 1247 Hat’s Words Trie树
- HDU -- 1247 Hat’s Words (Trie 树)
- Hdu 1247 Hat's Words(Trie树)
- HDU 1247 Hat's words(Trie)
- hdu 1247 Hat’s Words(Trie)
- HDU 1247 Hat’s Words (Trie)
- hdu 1247 Hat’s Words(Trie树入门)
- hdu 1247 Hat’s Words Trie树(+测试数据)
- HDU 1247-Hat’s Words(trie树)
- HDU 1247 Hat’s Words(字典树)
- hdu 1247 字典树 Hat’s Words
- HDU 1247 Hat’s Words 字典树
- 两个div空白字符的问题
- Java中的Type详解
- 视频分割--Learning to Segment Instances in Videos with Spatial Propagation Network
- lombok的使用和原理
- SQL-简单地保存数据到表
- HDU-1247 Hat’s Words (Trie 字典树)
- 按钮点击事件cocos2dx
- 谈谈 etcd 架构与设计
- Windows玩转Caffe(二):训练cifar10模型,并用其模型分类图片【附:多图】
- 机器学习:从入门到第一个模型
- OPENSSL EVP_AES部分翻译
- LeetCode 136. Single Number找数组单元素 Python Solution
- < 笔记 > JavaScript
- 提升方法(boosting)