HDU5384 Danganronpa
来源:互联网 发布:好用的c语言编译器 编辑:程序博客网 时间:2024/06/15 23:56
Problem Description
Danganronpa is a video game franchise created and developed by Spike Chunsoft, the series' name is compounded from the Japanese words for "bullet" (dangan) and "refutation" (ronpa).
Now, Stilwell is playing this game. There aren verbal evidences, and Stilwell has m "bullets". Stilwell will use these bullets to shoot every verbal evidence.
Verbal evidences will be described as some stringsAi , and bullets are some strings Bj . The damage to verbal evidence Ai from the bullet Bj is f(Ai,Bj) .
f(A,B)=∑i=1|A|−|B|+1[ A[i...i+|B|−1]=B ] In other words, f(A,B) is equal to the times that string B appears as a substring in string A .
For example:f(ababa,ab)=2 , f(ccccc,cc)=4
Stilwell wants to calculate the total damage of each verbal evidenceAi after shooting all m bullets Bj , in other words is ∑mj=1f(Ai,Bj) .
Now, Stilwell is playing this game. There are
Verbal evidences will be described as some strings
For example:
Stilwell wants to calculate the total damage of each verbal evidence
Input
The first line of the input contains a single number T , the number of test cases.
For each test case, the first line contains two integersn , m .
Nextn lines, each line contains a string Ai , describing a verbal evidence.
Nextm lines, each line contains a string Bj , describing a bullet.
T≤10
For each test case,n,m≤105 , 1≤|Ai|,|Bj|≤104 , ∑|Ai|≤105 , ∑|Bj|≤105
For all test case,∑|Ai|≤6∗105 , ∑|Bj|≤6∗105 , Ai and Bj consist of only lowercase English letters
For each test case, the first line contains two integers
Next
Next
For each test case,
For all test case,
Output
For each test case, output n lines, each line contains a integer describing the total damage of Ai from all m bullets, ∑mj=1f(Ai,Bj) .
Sample Input
15 6orzstokirigiridanganronpaooooookyoukodanganronpaoooooooooo
Sample Output
11037
ac自动机模板题啊,直接上模板
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<queue>#include<vector>using namespace std;typedef long long ll;const int size = 26;//字典树节点大小const int base = 'a';//字典树const int maxn = 100005;//字典树大小(便于各种操作)class tire{public: tire *next[size], *fail; ll cnt, id; //各种节点设置 tire(){ cnt = 0; fail = NULL; memset(next, 0, sizeof(next)); };};//字典树节点设置class Ac_machine{private: tire *root;//根节点建立 tire *node[maxn];//与id相对立,便于各种操作 int tot;//字典树大小 char s[maxn];//读入字符串public: char S[maxn];//母串 Ac_machine(){} void clear(){ node[0] = root = new tire; tot = 0; }//初始化 void insert(int);//插入多个字符串 int insert();//插入字符串,返回字符串大小 void getfail(); //获取失配指针 int getmother();//获得匹配的母串,返回母串大小 int work_out();//求解函数,依照题目不同而不同,返回答案}ac;//ac自动机设置int Ac_machine::getmother(){ scanf("%s", S); return strlen(S); }void Ac_machine::insert(int n){ while (n--) insert(); }int Ac_machine::insert(){ scanf("%s", s); tire *now = root; for (int i = 0, k; s[i]; i++) { k = s[i] - base; if (!now->next[k]) { node[++tot] = now->next[k] = new tire; now->next[k]->id = tot; } now = now->next[k]; } now->cnt++; //可以插入一些字典树的设置 return strlen(s);}void Ac_machine::getfail(){ queue<tire*> p; root->fail = root; for (int i = 0; i < size; i++) if (root->next[i]) { root->next[i]->fail = root; p.push(root->next[i]); } else root->next[i] = root; tire *now; while (!p.empty()) { now = p.front(); p.pop(); now->cnt += now->fail->cnt; //可以插入统计子串个数等操作 for (int i = 0; i < size; i++) if (now->next[i]) { now->next[i]->fail = now->fail->next[i]; p.push(now->next[i]); } else now->next[i] = now->fail->next[i]; }}int Ac_machine::work_out(){ ll ans = 0; tire *now = root; //for (int i = 0; i < maxn; i++) printf("%d\n", node[i]->cnt); for (int i = 0, k; S[i]; i++) { k = S[i] - base; now = now->next[k]; ans += now->cnt; } return ans;//返回子串出现次数}vector<char> p[maxn];char s[maxn];int main(){ int T,n,m; scanf("%d",&T); while (T--) { ac.clear(); scanf("%d%d",&n,&m); for (int i=1;i<=n;i++) { p[i].clear(); scanf("%s",s); for (int j=0;s[j];j++) p[i].push_back(s[j]); } ac.insert(m); ac.getfail(); for (int i=1;i<=n;i++) { for (int j=0;j<p[i].size();j++) { ac.S[j]=p[i][j]; } ac.S[p[i].size()]=0; printf("%lld\n",ac.work_out()); } }}
0 0
- HDU5384 Danganronpa
- hdu5384 Danganronpa
- hdu5384 Danganronpa(AC自动机)
- hdu5384 Danganronpa (AC自动机)
- hdu5384 Danganronpa AC自动机 多校联合第八场
- hdu5384(2015多校8)--Danganronpa(AC自动机)
- hdu5384
- Danganronpa
- Danganronpa
- Danganronpa
- Danganronpa
- Danganronpa
- hdu5384 Danganronpa(ac自动机+处理源字符串总容量超过二维数组容量的技巧(连接+分割))
- 【字符串】hdu5384
- hdu5384(AC自动机)
- hdu5384(AC自动机)
- hdu5384-多校 ac自动机
- HDU Danganronpa
- HDU 5375 DP
- 《阴符经》【中篇】【下篇】
- pat(A) 1063. Set Similarity(STL)
- HDOJ--2682--Tree
- 问题一堆的一天
- HDU5384 Danganronpa
- uva 10954 Add All
- 08-13 登录、注册, 数据库连接
- DRAM和SRAM的区别
- C#数据库的一些基本操作 第一篇
- form中的onblur事件简单的介绍
- linux yum命令详解
- Android开源项目分类汇总
- POJ 1287 Netwoking