Oulipo
poj - 3461
题目链接
这题本来是应该KMP做的,不过拿hash试了一下,竟然过了。
但是因为本来是自己写的mod错了几次,改成ull就ok了。
KMP的代码回来再补。
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6+100;
const int p = 233;
typedef unsigned long long ull;
ull h[maxn];
ull base[maxn];
int n;
string s1,s2;
inline void string_hash(string s){
h[0] = 0;
base[0] = 1;
for(int i=1;i<=s.length();++i){
base[i] = base[i-1]*p;
h[i] = h[i-1]*p + s[i-1];
// printf("%d : %lld\n",i,h[i]);
}
}
inline void solve(string s1,string s2){
int cnt = 0,len1 = s1.length(),len2 = s2.length();
ull hs = 0;
for(int i=0;i<len1;++i){
hs = hs*p+s1[i];
}
// printf("%lld\n", hs);
for(int i=len1;i<=len2;++i){
// printf("%d\n",h[i]-h[i-len1]*base[len1]);
if(hs == h[i]-h[i-len1]*base[len1]) cnt++;
}
cout<<cnt<<endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
while(n--){
cin>>s1>>s2;
string_hash(s2);
solve(s1,s2);
}
}
补一下kmp的代码:
#include <stdio.h>
#include <string.h>
using namespace std;
const int maxn = 2e6+100;
int n,m;
char s[maxn];
char t[maxn];
int next[maxn];
void getnext(){
int i=1,j=0;
next[0] = 0;
while(i<m){
if(t[i] == t[j])
next[i++] = ++j;
else if(j == 0) i++;
else j = next[j-1];
}
// for(int i=0;i<m;++i) printf("%d ", next[i]);
// puts("");
}
int kmp(){
getnext();
int i=0,j=0,cnt = 0;
while(i<n && j<m){
if(s[i] == t[j]){
i++;j++;
}
else if(j == 0) i++;
else j = next[j-1];
if(j == m){
cnt++;
j = next[j-1];
}
}
return cnt;
}
int main(int argc, char const *argv[])
{
int T;
scanf("%d",&T);
while(T--){
scanf("%s %s",t,s);
n = strlen(s);m = strlen(t);
// printf("%s %s\n", t,s);
printf("%d\n",kmp());
}
return 0;
}
Crazy Search
poj - 1200
题目链接
本来自己写的定的基数错了,然后换成nc进制就过了。。。太真实了。
AC代码:
#include <stdio.h>
#include <map>
#include <string.h>
using namespace std;
// typedef unsigned long long ull;
typedef unsigned long long ull;
int n,m;
const int maxn = 16000007;
// const int p = 2137;
char s[maxn];
ull h[maxn];
ull base[maxn];
bool vis[maxn];
map<char,int > mp;
inline void string_hash(char *s,int len){
h[0] = 0;
base[0] = 1;
for(int i=1;i<=len;++i){//生成hash数组
base[i] = base[i-1]*m;
h[i] = h[i-1]*m + mp[s[i-1]];
// printf("%d : %lld\n",i,h[i]);
}
int res = 0,cnt = 0;
for(int i=n;i<=len;++i){
res = h[i]-h[i-n]*base[n];//这个数字最大maxn
// printf("%d\n", res);
if(!vis[res]){
vis[res] = 1;
cnt++;
}
}
printf("%d\n", cnt);
}
int main(){
scanf("%d %d",&n,&m);
scanf("%s",s);
int total = 0;
for(int i=0;i<=strlen(s);++i){//字典
if(!mp[s[i]]){
mp[s[i]] = total++;
}
if(total == m) break;//小优化
}
string_hash(s,strlen(s));
return 0;
}