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 ...
随机推荐
- 微信小程序——weui的使用
使用在根目录中复制weui.wxss,app.wxss中引入 在weui.io中查看到自己想要的样式表后,到第二个网站复制代码,复制到自己的项目中即可 <!--pages/register/re ...
- LNMP动态网站架构及web应用部署,搭建discuz论坛
1)部署Nginx 实验tar安装包可找本人拿记得点+关注,感谢亲们支持,评论拿包 systemctl stop firewalld iptables -F setenforce 0 1)安装支持软件 ...
- CVPR2016 Paper list
CVPR2016 Paper list ORAL SESSIONImage Captioning and Question Answering Monday, June 27th, 9:00AM - ...
- js 简单模板引擎
代码 <!DOCTYPE html> <html> <head> <meta http-equiv="Content-Type" cont ...
- 6.shell脚本
6.1 shell基础语法 6.1.1 shell的概述 shell的基本概念 1.什么是shell shell是用户和Linux操作系统之间的接口,它提供了与操作系统之间的通讯方式 shell是一个 ...
- Heaters (codeforces 1066B)
贪心题 策略 在最左边设置一个array 0,每一次从右往左,如果有heater的话就寻找heater左边界是不是小于等于目前的上一个heater的右边界,如果没有一个这样的,那么就直接输出-1 代码 ...
- 第四节:numpy之数组排序
- 查看当前Java进程工具jps(转)
jps是JDK提供的一个查看当前Java进程的小工具, 可以看做是JavaVirtual Machine Process Status Tool的缩写.非常简单实用. 命令格式: jps [optio ...
- AngularJS:日期转换字符
JS有很多类库提供日期转换函数,AngularJS也不例外.可以通过$filter来完成转换,方法如下: $filter('date')(sourceDate, "yyyy/MM/dd&qu ...
- java面向接口编程
在oop中有一种设计原则是面向接口编程,面向接口编程有非常多优点,详细百度一大片.我来谈一下详细的使用中的一些不成熟的见解.! 首先面向接口编程能够消除类之间的依赖关系,使得业务仅仅依赖接口. 这样有 ...