Mediocre String Problem Gym

https://cn.vjudge.net/problem/Gym-101981M

很容易tle

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
//#include<bits/stdc++.h>
using namespace std;#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)const int N=2e6+9;
const int M=4e5+9;int n;
char sss[N],ttt[N];int num[N];
int tmp[N*2];
char Ma[N*2];
int Mp[N*2];
char ss[N];
void Manacher(char s[],int len)
{int l=0;Ma[l++]='$';Ma[l++]='#';for(int i=0;i<len;i++){Ma[l++]=s[i];Ma[l++]='#';}Ma[l]=0;int mx=0,id=0;for(int i=0;i<l;i++){Mp[i]=mx>i?min(Mp[2*id-i],mx-i):1;while(Ma[i+Mp[i]]==Ma[i-Mp[i]]) Mp[i]++;if(i+Mp[i]>mx){mx=i+Mp[i];id=i;}}for(int i=2;i<l;i++){if(Ma[i]=='#'&&Mp[i]==1) continue;int L=i-Mp[i]+1;int R=i;tmp[L]++;tmp[R+1]--;}int cnt=0;for(int i=1;i<l;i++){//cout<<Ma[i]<<" ";tmp[i]+=tmp[i-1];if(Ma[i]!='#') num[cnt++]=tmp[i];}num[cnt]=0;//  TLE!!!!!!//cout<<endl;//for(int i=1;i<l;i++) cout<<tmp[i]<<"     ";/* int cnt=0;for(int i=1;i<l;i++){if(Ma[i]=='#') continue;num[cnt++]=tmp[i];}num[cnt]=0;//for(int i=0;i<cnt;i++) cout<<num[i]<<" ";*/}#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ((x)<tb?(x)*3+1:((x)-tb)*3+2)
int sa[N],rk[N],height[N],s[N];
int wa[N*3],wb[N*3],wv[N*3],wss[N*3];
int c0(int *r,int a,int b){return r[a]==r[b]&&r[a+1]==r[b+1]&&r[a+2]==r[b+2];
}
int c12(int k,int *r,int a,int b){if(k==2)return r[a]<r[b]||(r[a]==r[b]&&c12(1,r,a+1,b+1));else return r[a]<r[b]||(r[a]==r[b]&&wv[a+1]<wv[b+1]);
}
void ssort(int *r,int *a,int *b,int n,int m){int i;for(i=0;i<n;i++)wv[i]=r[a[i]];for(i=0;i<m;i++)wss[i]=0;for(i=0;i<n;i++)wss[wv[i]]++;for(i=1;i<m;i++)wss[i]+=wss[i-1];for(i=n-1;i>=0;i--)b[--wss[wv[i]]]=a[i];
}
void dc3(int *r,int *sa,int n,int m){int i,j,*rn=r+n;int *san=sa+n,ta=0,tb=(n+1)/3,tbc=0,p;r[n]=r[n+1]=0;for(i=0;i<n;i++)if(i%3!=0)wa[tbc++]=i;ssort(r+2,wa,wb,tbc,m);ssort(r+1,wb,wa,tbc,m);ssort(r,wa,wb,tbc,m);for(p=1,rn[F(wb[0])]=0,i=1;i<tbc;i++)rn[F(wb[i])]=c0(r,wb[i-1],wb[i])?p-1:p++;if(p<tbc)dc3(rn,san,tbc,p);else for(i=0;i<tbc;i++)san[rn[i]]=i;for(i=0;i<tbc;i++)if(san[i]<tb)wb[ta++]=san[i]*3;if(n%3==1)wb[ta++]=n-1;ssort(r,wb,wa,ta,m);for(i=0;i<tbc;i++)wv[wb[i]=G(san[i])]=i;for(i=0,j=0,p=0;i<ta&&j<tbc;p++)sa[p]=c12(wb[j]%3,r,wa[i],wb[j])?wa[i++]:wb[j++];for(;i<ta;p++)sa[p]=wa[i++];for(;j<tbc;p++)sa[p]=wb[j++];
}
void da(int n,int m){for(int i=n;i<n*3;i++)s[i]=0;dc3(s,sa,n+1,m);int i,j,k=0;for(i=0;i<=n;i++)rk[sa[i]]=i;for(i=0;i<n;i++){if(k)k--;j=sa[rk[i]-1];while(s[i+k]==s[j+k])k++;height[rk[i]]=k;}
}int st[N][50];
void ST()
{for(int i=1;i<=n;i++) st[i][0]=height[i];for(int j=1;(1<<j)<=n;j++){for(int i=1;i+(1<<j)-1<=n;i++){st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);}}
}
int query(int l,int r)
{//int x=(int)(log(1.0*(r-l+1))/log(2.0));  TLE!!!int x=0;while((1<<(x+1))<=r-l+1) x++;return min(st[l][x],st[r-(1<<x)+1][x]);
}int LCP(int a,int b)
{int L=rk[a];int R=rk[b];if(L>R) swap(L,R);L++;return query(L,R);
}int main()
{//FAST_IO;//freopen("input.txt","r",stdin);scanf("%s%s",sss,ttt);int lens=strlen(sss);Manacher(sss,lens);int lent=strlen(ttt);for(int i=lens-1;i>=0;i--) s[n++]=sss[i]-'a'+1;s[n++]=30;for(int i=0;i<lent;i++) s[n++]=ttt[i]-'a'+1;s[n++]=0;da(n-1,31);ST();ll ans=0;int pos=lens;for(int i=0;i<lens;i++){int k=LCP(i,lens+1);ans+=1LL*k*num[pos];pos--;}printf("%lld\n",ans);return 0;
}

Mediocre String Problem Gym - 101981M相关推荐

M - Mediocre String Problem Gym - 101981M
题意: 给你个s串和t串找三元组(i,j,k) 在 s中选取 i -j ,在t中选取 1-k,使他们拼凑出来的是回文串. 题解:首先对于s串倒转,exkmp求s串和t串extend,对s串进行ma ...
Gym - 101981 Problem M. Mediocre String Problem (扩展KMP + Manacher)
Problem M. Mediocre String Problem 题目链接:https://vjudge.net/problem/Gym-101981M 题目大意:给出两个串S,T,从S中选择 i ...
Mediocre String Problem(马拉车+扩展KMP)
文章目录 [Mediocre String Problem](https://codeforces.com/gym/101981) 题目大意解题思路代码 Mediocre String Probl ...
Problem M. Mediocre String Problem（Z 函数 + PAM）
Problem M. Mediocre String Problem 给定两个串s,ts, ts,t,要求有多少不同的三元组(i,j,k)(i, j, k)(i,j,k),满足: 1≤i≤j≤∣s∣1 ...
M - Mediocre String Problem（扩展KMP + Manacher + 差分）
M - Mediocre String Problem( 扩展KMP + Manacher + 差分 ) 题意:给出一个串S,和一个串T. 要求从S串中取一个子串,后面接上T串的一个前缀组成一个结 ...
Problem M. Mediocre String Problem
Problem M. Mediocre String Problem(马拉车+拓展KMP) 题意:给一个S串一个T串, 问有多少个F(i, j, k),F(i, j, k) 的定义是S串选个下标i~j ...
Gym_101981M Mediocre String Problem(exkmp+manachar)
Mediocre String Problem time limit per test:1 seconds memory limit per test:256 megabytes Problem De ...
ACM-ICPC2018南京赛区 Mediocre String Problem
Mediocre String Problem 题解: 很容易想到将第一个串反过来,然后对于s串的每个位置可以求出t的前缀和它匹配了多少个(EXKMP 或者二分+hash). 然后剩下的就是要处理以 ...
2018 ICPC 南京 M. Mediocre String Problem（ExKMP + Manacher / ExKMP+回文树）
2018 ICPC 南京全文见:https://blog.csdn.net/qq_43461168/article/details/112796538 M. Mediocre String Prob ...

Mediocre String Problem Gym - 101981M

Mediocre String Problem Gym - 101981M相关推荐

最新文章

热门文章