POJ 2945 trie树
Find the Clones
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 7704 Accepted: 2879
Description
Doubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human experiments, the aliens cloned the victims, and released multiple copies of them back in Doubleville. So now it might happen that there are 6 identical person named Hugh F. Bumblebee: the original person and its 5 copies. The Federal Bureau of Unauthorized Cloning (FBUC) charged you with the task of determining how many copies were made from each person. To help you in your task, FBUC have collected a DNA sample from each person. All copies of the same person have the same DNA sequence, and different people have different sequences (we know that there are no identical twins in the town, this is not an issue).
Input
The input contains several blocks of test cases. Each case begins with a line containing two integers: the number 1 ≤ n ≤ 20000 people, and the length 1 ≤ m ≤ 20 of the DNA sequences. The next n lines contain the DNA sequences: each line contains a sequence of m characters, where each character is either A',
C’, G' or
T’.
The input is terminated by a block with n = m = 0 .
Output
For each test case, you have to output n lines, each line containing a single integer. The first line contains the number of different people that were not copied. The second line contains the number of people that were copied only once (i.e., there are two identical copies for each such person.) The third line contains the number of people that are present in three identical copies, and so on: the i -th line contains the number of persons that are present in i identical copies. For example, if there are 11 samples, one of them is from John Smith, and all the others are from copies of Joe Foobar, then you have to print 1' in the first andthe tenth lines, and
0’ in all the other lines.
Sample Input
9 6
AAAAAA
ACACAC
GTTTTG
ACACAC
GTTTTG
ACACAC
ACACAC
TCCCCC
TCCCCC
0 0
Sample Output
1
2
0
1
0
0
0
0
0
Hint
Huge input file, ‘scanf’ recommended to avoid TLE.
题意:给出x个字符串,问你i个(i<=i<=x)相同字符串的个数,然后输出第i行代表有i个相同字符串的个数。
思路: 找的trie树题,自然就是trie树啦。好像别人有直接strcmp+sort+O(n)扫一遍过的,有用map过的,还有用hash的(Hash好像很有用的样子)。
第一次提交,,,
#include <cstdio>
#include <cstring>
using namespace std;
int x,y;
int a[20005];
struct trie
{
int cnt;
trie *next[26];
};
trie *root=new trie;
void insert(char ch[])
{
trie *p=root,*newtrie;
for(int i=0;ch[i]!='\0';i++)
{
if(p->next[ch[i]-'A']==0)
{
newtrie=new trie;
for(int j=0;j<26;j++) newtrie->next[j]=NULL;
newtrie->cnt=0;
p->next[ch[i]-'A']=newtrie;
p=newtrie;
}
else
p=p->next[ch[i]-'A'];
}
p->cnt++;
a[p->cnt]++;
a[p->cnt-1]--;
}
int main()
{
char ch[29];
while(scanf("%d%d",&x,&y)&&x)
{
for(int i=0;i<26;i++) root->next[i]=NULL;
root->cnt=0;
for(int i=1;i<=x;i++)
{
scanf("%s",ch);
insert(ch);
}
for(int i=1;i<=x;i++)
printf("%d\n",a[i]);
for(int i=0;i<=x;i++)a[i]=0;
}
}
分析了一下原因,没有拆树导致用过了废了的内存没有回收
改了五分钟以后,第二版提交。
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
int x,y;
int a[20005];
struct trie
{
int cnt;
trie *next[26];
};
trie *root=new trie;
void insert(char ch[])
{
trie *p=root,*newtrie;
for(int i=0;ch[i]!='\0';i++)
{
if(p->next[ch[i]-'A']==0)
{
newtrie=new trie;
for(int j=0;j<26;j++) newtrie->next[j]=NULL;
newtrie->cnt=0;
p->next[ch[i]-'A']=newtrie;
p=newtrie;
}
else
p=p->next[ch[i]-'A'];
}
p->cnt++;
a[p->cnt]++;
a[p->cnt-1]--;
}
void dfs(trie *p)
{
for(int i=0;i<26;i++)
{
if(p->next[i]!=NULL) dfs(p->next[i]);
free(p->next[i]);
}
}
int main()
{
char ch[29];
while(scanf("%d%d",&x,&y)&&x)
{
for(int i=0;i<26;i++) root->next[i]=NULL;
root->cnt=0;
for(int i=1;i<=x;i++)
{
scanf("%s",ch);
insert(ch);
}
for(int i=1;i<=x;i++)
printf("%d\n",a[i]);
for(int i=0;i<=x;i++)a[i]=0;
dfs(root);
}
}
还是很慢啊! 4.5s,19216K的memory。
POJ 2945 trie树的更多相关文章
- poj 2945 trie树统计字符串出现次数
用记录附加信息的val数组记录次数即可. trie的原理:每个可能出现的字目给一个编号c,那么整个树就是一个c叉树 ch[u][c]表示 节点u走c边过去之后的节点 PS:trie树还有种动态写法,使 ...
- POJ 3630 trie树
Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 26559 Accepted: 8000 Descripti ...
- POJ 2513 trie树+并查集判断无向图的欧拉路
生无可恋 查RE查了一个多小时.. 原因是我N define的是250500 应该是500500!!!!!!!!! 身败名裂,已无颜面对众人.. 吐槽完了 我们来说思路... 思路: 判有向图能否形成 ...
- hdu 1671&& poj 3630 (trie 树应用)
Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 25280 Accepted: 7678 Descr ...
- poj 2513 Colored Sticks (trie 树)
链接:poj 2513 题意:给定一些木棒.木棒两端都涂上颜色,不同木棒相接的一边必须是 同样的颜色.求能否将木棒首尾相接.连成一条直线. 分析:能够用欧拉路的思想来解,将木棒的每一端都看成一个结点 ...
- POJ 3630 Phone List(trie树的简单应用)
题目链接:http://poj.org/problem?id=3630 题意:给你多个字符串,如果其中任意两个字符串满足一个是另一个的前缀,那么输出NO,否则输出YES 思路:简单的trie树应用,插 ...
- POJ 3764 The xor-longest Path trie树解决位运算贪心
http://poj.org/problem?id=3764 题意 : 一颗树,每个边有个值,在树上找一条简单路径,使得这条路径上的边权异或值最大 先找到所有节点到一点的距离 , 显然dis( x ...
- [POJ] #1002# 487-3279 : 桶排序/字典树(Trie树)/快速排序
一. 题目 487-3279 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 274040 Accepted: 48891 ...
- [ACM] POJ 2418 Hardwood Species (Trie树或map)
Hardwood Species Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 17986 Accepted: 713 ...
随机推荐
- IOS内购--后台PHP认证
参考网址:https://blog.csdn.net/que_csdn/article/details/80861408 http://www.php.cn/php-weizijiaocheng-39 ...
- spine骨骼动画组件使用详解
1. spine骨骼动画工具 骨骼动画: 把动画打散, 通过工具,调骨骼的运动等来形成动画spine是一个非常流行的2D骨骼动画制作工具spine 动画美术人员导出3个文件: (1) .png文 ...
- javaWEB中web.xml配置文件相关
1.常用节点的执行顺序: context-param -> listenter -> filter -> servlet -> interceptor,其中有多个filter的 ...
- web前端学习总结--CSS
CSS 什么是CSS? CSS 指层叠样式表(Cascading Style Sheets) 样式定义如何显示HTML元素 样式通常存储在样式表中 如何使用CSS 内联方式 样式定义在单个的HTML元 ...
- Swoole 源码分析——Server模块之TaskWorker事件循环
swManager_start 创建进程流程 task_worker 进程的创建可以分为三个步骤:swServer_create_task_worker 申请所需的内存.swTaskWorker_in ...
- odoo api介绍
odoo api修饰器介绍与应用 参考文档:https://www.cnblogs.com/kfx2007/p/6093994.html 一.one one的用法主要用于self为单一集合的情况,被o ...
- Python - 模块(一)
目录 Python - 模块(一) 模块的引用方式 常用模块 random(随机模块) os模块 sys 序列化模块 hashlib subprocess optparse struct Python ...
- Linux - redis主从同步
目录 Linux - redis主从同步 环境准备 配置主从同步 测试写入数据,主库写入数据,检查从库数据 手动进行主从复制故障切换 Linux - redis主从同步 原理: 从服务器向主服务器发送 ...
- BUAA_OO_博客作业二
1.作业设计策略 1.1第一次作业 第一次作业指导书要求是一个单部多线程傻瓜调度(FAFS)电梯的模拟,由于为了可扩展性和模块化设计,第一次作业我采用了三线程,即输入处理线程,调度器线程,电梯线程 ...
- 详解Pattern类和Matcher类
java正则表达式通过java.util.regex包下的Pattern类与Matcher类实现(建议在阅读本文时,打开java API文档,当介绍到哪个方法时,查看java API中的方法说明,效果 ...