Codeforces Round #291 Div2 C

Problem

给N个字符串Si,进行M次询问,每次给定一个字符串S,问是否存在一个Si使得S与Si长度相等,同时有且只有一个字符不同。

Limits

TimeLimit(ms):3000

MemoryLimit(MB):256

N,M∈[0,3×105]

所有串总长不超过6×105

Look up Original Problem From here

Solution

字典树才是正解,但用hash会很方便。

双hash,seed=1e4级别的素数,mod1=1e9+7,mod2=1e9+9

Complexity

TimeComplexity:O(|S|all×log2N)

MemoryComplexity:O(|S|max+N)

My Code

//Hello. I‘m Peter.
#include<cstdio>
#include<iostream>
#include<sstream>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<cctype>
#include<ctime>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double ld;
//typedef unsigned long long ull;
#define peter cout<<"i am peter"<<endl
#define input freopen("data.txt","r",stdin)
#define randin srand((unsigned int)time(NULL))
#define INT (0x3f3f3f3f)*2
#define LL (0x3f3f3f3f3f3f3f3f)*2
#define gsize(a) (int)a.size()
#define len(a) (int)strlen(a)
#define slen(s) (int)s.length()
#define pb(a) push_back(a)
#define clr(a) memset(a,0,sizeof(a))
#define clr_minus1(a) memset(a,-1,sizeof(a))
#define clr_INT(a) memset(a,INT,sizeof(a))
#define clr_true(a) memset(a,true,sizeof(a))
#define clr_false(a) memset(a,false,sizeof(a))
#define clr_queue(q) while(!q.empty()) q.pop()
#define clr_stack(s) while(!s.empty()) s.pop()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dep(i, a, b) for (int i = a; i > b; i--)
#define repin(i, a, b) for (int i = a; i <= b; i++)
#define depin(i, a, b) for (int i = a; i >= b; i--)
#define pi acos(-1.0)
#define eps 1e-9
#define MOD 1000000007
#define MAXN 1001000
#define N
#define M
ll idx(char c){
    return c-‘a‘+1;
}
ll seed1[MAXN],seed2[MAXN];
const ll seed=49681;
const ll mod1=1e9+7;
const ll mod2=1e9+9;
int n,m,lens;
map<pair<ll,ll>,bool>here;
char s[MAXN];
int main(){
    seed1[0]=seed2[0]=1;
    rep(i,1,MAXN){
        seed1[i]=seed1[i-1]*seed%mod1;
        seed2[i]=seed2[i-1]*seed%mod2;
    }
    scanf("%d %d",&n,&m);
    repin(num,1,n){
        scanf("%s",s);
        lens=len(s);
        ll v1=0,v2=0;
        rep(i,0,lens){
            v1=(v1*seed+idx(s[i]))%mod1;
            v2=(v2*seed+idx(s[i]))%mod2;
        }
        pair<ll,ll>p=make_pair(v1,v2);
        here[p]=true;
    }
    repin(num,1,m){
        scanf("%s",s);
        lens=len(s);
        ll v1=0,v2=0;
        rep(i,0,lens){
            v1=(v1*seed+idx(s[i]))%mod1;
            v2=(v2*seed+idx(s[i]))%mod2;
        }
        ll v1t,v2t;
        bool ok=false;
        rep(i,0,lens){
            if(ok) break;
            for(char c=‘a‘;c<=‘c‘;c++){
                if(s[i]==c) continue;
                v1t=v1+(idx(c)-idx(s[i]))*seed1[lens-1-i];
                v1t=(v1t%mod1+mod1)%mod1;
                v2t=v2+(idx(c)-idx(s[i]))*seed2[lens-1-i];
                v2t=(v2t%mod2+mod2)%mod2;
                pair<ll,ll>p=make_pair(v1t,v2t);
                if(here.find(p)!=here.end()){
                    ok=true;
                    break;
                }
            }
        }
        printf("%s\n",ok?"YES":"NO");
    }
}
时间: 2024-10-24 16:01:25

Codeforces Round #291 Div2 C的相关文章

Codeforces Round #291 Div2

A. Chewbaсca and Number 签到题 //#pragma comment(linker, "/STACK:102400000,102400000") 手动扩栈 #include<iostream> #include<algorithm> #include <queue> #include<stack> #include<map> #include<string> #include<set&g

Codeforces Round #291 Div2 D

Problem An army of n droids is lined up in one row. Each droid is described by m integers a1,?a2,?...,?am, where ai is the number of details of the i-th type in this droid's mechanism. R2?D2 wants to destroy the sequence of consecutive droids of maxi

codeforces round #257 div2 C、D

本来应该认真做这场的,思路都是正确的. C题,是先该横切完或竖切完,无法满足刀数要求,再考虑横切+竖切(竖切+横切), 因为横切+竖切(或竖切+横切)会对切割的东西产生交叉份数,从而最小的部分不会尽可能的大. 代码如下,虽然比较长.比较乱,但完全可以压缩到几行,因为几乎是4小块重复的代码,自己也懒得压缩 注意一点,比如要判断最小块的时候,比如9行要分成2份,最小的剩下那份不是9取模2,而应该是4 m/(k+1)<=m-m/(k+1)*k          #include<bits/stdc+

codeforces Round #250 (div2)

a题,就不说了吧 b题,直接从大到小排序1-limit的所有数的lowbit,再从大到小贪心组成sum就行了 1 #include<cstdio> 2 #include<iostream> 3 #include<algorithm> 4 #include<cstring> 5 #define N 200000 6 using namespace std; 7 int pos[N],a[N],s[N],f[N],la[N],b[N],i,j,k,ans,n,p

Codeforces Round#320 Div2 解题报告

Codeforces Round#320 Div2 先做个标题党,骗骗访问量,结束后再来写咯. codeforces 579A Raising Bacteria codeforces 579B Finding Team Member codeforces 579C A Problem about Polyline codeforces 579D "Or" Game codeforces 579E Weakness and Poorness codeforces 579F LCS Aga

Codeforces Round #254(div2)A

很有趣的题.想到了就非常简单,想不到就麻烦了. 其实就是一种逆向思维:最后结果肯定是这样子: WBWBWBWB... BWBWBWBW... WBWBWBWB... ... 里面有“-”的地方改成“-”就行了. 但是我开始是正着想的,想每个点怎么处理,这还要看它周围点的状态,越想越麻烦... 这题中体现的正难则反的逆向思维很值得学习. #include<iostream> #include<cstdio> #include<cstdlib> #include<cs

Codeforces Round #254(div2)B

就是看无向图有几个连通块,答案就是2n-num. 范围很小,就用矩阵来存图减少代码量. #include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<map> #include<set> #include<vector> #include<algorithm> #inc

Codeforces Round #260(div2)C(递推)

有明显的递推关系: f[i]表示i为数列中最大值时所求结果.num[i]表示数i在数列中出现了几次. 对于数i,要么删i,要么删i-1,只有这两种情况,且子问题还是一样的思路.那么很显然递推一下就行了:f[i]=max(f[i-1],f[i-2]+i*num[i]); 这里技巧在于:为了防止麻烦,干脆就所有数的出现次数都记录一下,然后直接从2推到100000(类似于下标排序),就不用排序了,也不用模拟删除操作了.这一技巧貌似简单,但实际上临场想出来也需要点水平. #include<iostrea

Codeforces Round #289 Div2 E

Problem 给一串长度为N的字符串,对于每个字符,若字符为元音,则权值为1,否则为0.一个子串的权值定义为该串所有字符权值之和除以字符个数,一个母串的权值定义为所有子串的权值之和.求母串的权值. Limits Time Limit(ms): 1000 Memory Limit(MB): 256 N: [1, 5*10^5] 字符集: 'A'-'Z' 元音: I E A O U Y Solution 考虑每个元音字符对母串的贡献,可以找出规律. More 举"ABCDOEFGHKMN"