【2019南昌邀请赛现场赛 - J】Prefix（STLmap，思维）

题干：

yah has n strings <s1,⋯,sn>, and he generates a sequence P by two steps:

P=<s1,⋯,sn>
Replace each si with all preﬁxes of itself.
An example is:

the n strings are < aab,ab >
ﬁrst, P =< aab,ab >
then, P =< a,aa,aab,a,ab >
There are 26 positive integers d1,⋯,d26 that denote the diﬃculty to identify lowercase English letter a,b,⋯,z for yah.

The diﬃculty to identify a string strstr is (i=1∏∣str∣dstri) mod m

Now, yah wants to calculate: for each string si(i=1,⋯,n), the number of strings in P that is preﬁx of si and more diﬃcult than si.

Input
The ﬁrst line contains two integers n,mn,m(1≤n≤105,1≤m≤2×105).

The second line contains 26 positive d1,⋯,d26, 0^50≤di≤105.

The following n lines, each line contains a string, the ith lines contains si, the sum of length of all strings is not great than 2×105.

Output
The only line contains n integers, the ith integer denoting the number of strings in P that is preﬁx of si but more diﬃcult to identify for yah.

题意：
给定n代表n个字符串，m代表模数，再给定26个字母的每个字母的权值d，再定义字符串s的值:前i个字符对应的子串的值dd[i]= dd[i-1]*(d[s[i]]) % m 。

输入n个字符串，求对于每个字符串，大于该字符串的值的前缀的个数（值dd[i]= dd[i-1]*(d[s[i]]) % m ），主要求前缀的个数

解题报告：

map暴力搞一搞就能过、、但是要真是比赛场还是老老实实写hash吧、、万一T了呢。

其实也可以字典树，存前缀出现的次数。也不难想。

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define FF first
#define SS second
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
typedef pair<int,int> PII;
const int MAX = 2e5 + 5;
map<string,PII> mp;
int n;
int d[MAX];
ll m;
string s[MAX],tmp;
int main()
{ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);cin>>n>>m;for(int i = 0; i<26; i++) cin>>d[i];for(int i = 1; i<=n; i++) {cin>>s[i];tmp = "";int len = s[i].length();ll tmpp = 1;for(int j = 0; j<len; j++) {tmp += s[i][j];tmpp *= d[s[i][j]-'a'];tmpp %= m;auto it = mp.find(tmp);if(it == mp.end()) mp[tmp] = pm(tmpp,1);else mp[tmp].SS ++;} }for(int i = 1; i<=n; i++) {tmp = "";int ans = 0;int tar = mp[s[i]].FF;int len = s[i].length();for(int j = 0; j<len; j++) {tmp += s[i][j];if(mp[tmp].FF > tar) ans += mp[tmp].SS;}cout << ans ;if(i == n) cout << "\n";else cout << " ";//printf("%d%c",ans,i == n ?'\n' :' ');}return 0 ;
}

【2019南昌邀请赛现场赛 - J】Prefix（STLmap，思维）相关推荐

【2019南昌邀请赛现场赛 - G】Winner（建图，tarjan缩点或贪心）
题目大意: n个人参加竞技比赛.比赛由三种模式a,b,c,每个人在每种模式下有对应的权值a[i]b[i]c[i].举行n−1场比赛,每场比赛主办方可以选择两个人决斗,能力值低的人淘汰.这样保证n-1场 ...
【2019南昌邀请赛现场赛 - G】Winner（思维、图论+缩点）
题目链接: https://nanti.jisuanke.com/t/40259" Ichuan really likes to play games, so he organized a ...
【计蒜客 - 2019南昌邀请赛网络赛 - I】Max answer（单调栈，RMQ）
题干: Alice has a magic array. She suggests that the value of a interval is equal to the sum of the va ...
【计蒜客 - 2019南昌邀请赛网络赛 - M】Subsequence（字典树，dp预处理）
题干: Give a string SS and NN string T_iTi , determine whether T_iTi is a subsequence of SS. If ti i ...
【计蒜客 - 2019南昌邀请赛网络赛 - K】MORE XOR（数学，找规律，打表）
Given a sequence of nn numbers a_1, a_2, \cdots, a_na1,a2,⋯,an and three functions. Define a func ...
2019南昌邀请赛网络赛
A. PERFECT NUMBER PROBLEM 这题没什么要说的. #include<bits/stdc++.h>using namespace std;int main(){co ...
【计蒜客 - 2019南昌邀请赛网络赛 - H】Coloring Game（找规律，思维dp）
题干: David has a white board with 2 \times N2×N grids.He decides to paint some grids black with his b ...
2019 ICPC 徐州网络赛 J.Random Access Iterator
2019 ICPC 徐州网络赛 J.Random Access Iterator 题目大意:给你n个点和n-1条边(树形结构),保证1为根节点,通过以下方式dfs遍历: 询问dfs到最深节点的概率(有 ...
2019 ICPC南昌邀请赛网络赛比赛过程及题解
解题过程中午吃饭比较晚,到机房lfw开始发各队的账号密码,byf开始读D题,shl电脑卡的要死,启动中...然后听到谁说A题过了好多,然后shl让blf读A题,A题blf一下就A了.然后lfw读完M ...

【2019南昌邀请赛现场赛 - J】Prefix（STLmap，思维）

【2019南昌邀请赛现场赛 - J】Prefix（STLmap，思维）相关推荐

最新文章

热门文章