QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#439100 | #5014. 复读程度 | 275307894a | 0 | 11ms | 27084kb | C++14 | 5.7kb | 2024-06-11 16:09:30 | 2024-06-11 16:09:31 |
Judging History
answer
#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=1e7+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
#ifdef LOCAL
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
#else
#define gdb(...) void()
#endif
}using namespace Debug;
int n,q;
char s[N];
ull wl[N],wr[N];
struct SAM{
int son[N][26],link[N],len[N],ed[N],La=1,cnt=1;
void extend(int c){
len[++cnt]=len[La]+1;int p=La;La=cnt;siz[La]=1;
while(p&&!son[p][c]) son[p][c]=La,p=link[p];
if(!p){link[La]=1;return;}
int q=son[p][c];if(len[q]==len[p]+1){link[La]=q;return;}
len[++cnt]=len[p]+1;Mc(son[cnt],son[q]);link[cnt]=link[q];link[q]=link[La]=cnt;ed[cnt]=ed[q];
while(p&&son[p][c]==q) son[p][c]=cnt,p=link[p];
}
vector<int> S[N];
int bl[N];
int bg[N],en[N],bh,df[N];
int trans[N][26];
ull sum[N],siz[N];
void make(int x,int La){
bg[x]=++bh;df[bh]=x;
for(int i:S[x]) make(i,x),ed[i]+len[x]<=n&&(trans[x][s[ed[i]+len[x]]-'a']=i),ed[x]=ed[i],sum[x]+=sum[i],siz[x]+=siz[i];
en[x]=bh;
}
int fa[20][N];
void build(){
for(int i=2;i<=cnt;i++) S[link[i]].push_back(i);
make(1,0);
for(int i=1;i<=cnt;i++) fa[0][i]=link[i];
for(int i=1;i<=18;i++) for(int j=1;j<=cnt;j++) fa[i][j]=fa[i-1][fa[i-1][j]];
}
vector<int> G[N];
void push(int x){
for(int i=0;i<26;i++) if(son[x][i]&&len[son[x][i]]==len[x]+1){
push(son[x][i]);
if(!bl[x]) bl[x]=bl[son[x][i]];
}
// gdb(x,bl[x]);
G[bl[x]].push_back(x);
}
int jump(int x,int k){
for(int i=18;~i;i--) if(len[fa[i][x]]>=k) x=fa[i][x];
return x;
}
}t1,t2;
int cnt,mx[N];
void dfs(int x,int y){
// gdb(x,y,t1.len[x],t2.len[y]);
if(t1.len[x]==t2.len[y]) t1.bl[x]=t2.bl[y]=++cnt,mx[cnt]=t1.len[x];
for(int i=0;i<26;i++) if(t1.son[x][i]&&t1.len[x]+1==t1.len[t1.son[x][i]]) dfs(t1.son[x][i],t1.len[x]==t2.len[y]?t2.trans[y][i]:y);
}
int i1[N],i2[N];
void build(){
for(int i=1;i<=n;i++) t1.extend(s[i]-'a'),i1[i]=t1.La,t1.sum[t1.La]=wr[i],t1.ed[t1.La]=i;
for(int i=n;i;i--) t2.extend(s[i]-'a'),i2[i]=t2.La,t2.sum[t2.La]=wl[i],t2.ed[t2.La]=i;
t1.build();t2.build();
dfs(1,1);
t1.push(1);t2.push(1);
}
ull ans[N];
struct ques{int l,r,id;ull w;}Q[N];int Qh;
ull qans[N];
void Solve(){
int i,j;scanf("%d%d%s",&n,&q,s+1);
for(i=1;i<=n;i++) scanf("%llu",&wl[i]);
for(i=1;i<=n;i++) scanf("%llu",&wr[i]);
build();
for(i=1;i<=q;i++){
int l1,r1,l2,r2;
scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
int x=t2.jump(i2[l1],r1-l1+1),y=t1.jump(i1[r2],r2-l2+1);
int i1=t2.bl[x],i2=t1.bl[y],len1=r1-l1+1,len2=r2-l2+1;
if(t1.bl[y]==t2.bl[x]){
if(t2.len[x]+t1.len[y]-mx[i1]>t1.len[t1.link[y]]&&t2.len[x]+t1.len[y]-mx[i1]<max(len1,len2)) ans[i]-=t1.sum[y]*t2.sum[x]*t1.siz[y];
}else{
for(int j=t2.len[x]-len1+1;j<=t2.len[x]-(t2.len[t2.link[x]]+1);j++){
if(t1.bg[y]<=t1.bg[t1.G[i1][j]]&&t1.bg[t1.G[i1][j]]<=t1.en[y]) ans[i]-=t2.sum[x]*t1.sum[t1.G[i1][j]]*t2.siz[x];
}
for(int j=t1.len[y]-len2+1;j<=t1.len[y]-(t1.len[t1.link[y]]+1);j++){
if(t2.bg[x]<=t2.bg[t2.G[i2][j]]&&t2.bg[t2.G[i2][j]]<=t2.en[x]) ans[i]-=t1.sum[y]*t2.sum[t2.G[i2][j]]*t1.siz[y];
}
}
// gdb(ans[i]);
Q[++Qh]=(ques){t1.bg[y]-1,t2.bg[x]-1,i,1};
Q[++Qh]=(ques){t1.en[y],t2.en[x],i,1};
Q[++Qh]=(ques){t1.bg[y]-1,t2.en[x],i,-1ull};
Q[++Qh]=(ques){t1.en[y],t2.bg[x]-1,i,-1ull};
/*for(int j=t2.bg[x];j<=t2.en[x];j++) for(int h=t1.bg[y];h<=t1.en[y];h++)if(t2.bl[t2.df[j]]==t1.bl[t1.df[h]]){
if(t2.len[t2.df[j]]+t1.len[t1.df[h]]-mx[t2.bl[t2.df[j]]]>t1.len[t1.link[t1.df[h]]]){
ans[i]+=t2.sum[t2.df[j]]*t1.sum[t1.df[h]]*t2.siz[t2.df[j]];
}
}*/
// printf("%llu\n",ans[i]);
}
int l=1,r=0,Bl=max(n/sqrt(q),1.0);
sort(Q+1,Q+Qh+1,[&](ques x,ques y){return x.l/Bl^y.l/Bl?x.l<y.l:(x.l/Bl&1?x.r<y.r:x.r>y.r);});
for(i=1;i<=Qh;i++){
qans[i]=qans[i-1];
while(l<Q[i].l){
l++;
for(int j=1;j<=r;j++) if(t1.bl[t1.df[l]]==t2.bl[t2.bl[j]]){
if(t2.len[t2.df[j]]+t1.len[t1.df[l]]-mx[t2.bl[t2.df[j]]]>t1.len[t1.link[t1.df[l]]]){
qans[i]+=t2.sum[t2.df[j]]*t1.sum[t1.df[l]]*t2.siz[t2.df[j]];
}
}
}
while(l>Q[i].l){
for(int j=1;j<=r;j++) if(t1.bl[t1.df[l]]==t2.bl[t2.bl[j]]){
if(t2.len[t2.df[j]]+t1.len[t1.df[l]]-mx[t2.bl[t2.df[j]]]>t1.len[t1.link[t1.df[l]]]){
qans[i]-=t2.sum[t2.df[j]]*t1.sum[t1.df[l]]*t2.siz[t2.df[j]];
}
}
l--;
}
while(r<Q[i].r){
r++;
for(int j=1;j<=l;j++)if(t1.bl[t1.df[j]]==t2.bl[t2.bl[r]]){
if(t2.len[t2.df[r]]+t1.len[t1.df[j]]-mx[t2.bl[t2.df[r]]]>t1.len[t1.link[t1.df[j]]]){
qans[i]+=t2.sum[t2.df[r]]*t1.sum[t1.df[j]]*t2.siz[t2.df[r]];
}
}
}
while(r>Q[i].r){
for(int j=1;j<=l;j++)if(t1.bl[t1.df[j]]==t2.bl[t2.bl[r]]){
if(t2.len[t2.df[r]]+t1.len[t1.df[j]]-mx[t2.bl[t2.df[r]]]>t1.len[t1.link[t1.df[j]]]){
qans[i]-=t2.sum[t2.df[r]]*t1.sum[t1.df[j]]*t2.siz[t2.df[r]];
}
}
r--;
}
ans[Q[i].id]+=qans[i]*Q[i].w;
}
for(i=1;i<=q;i++) printf("%llu\n",ans[i]);
}
int main(){
int t=1;
// scanf("%d",&t);
while(t--) Solve();
cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 7
Accepted
time: 11ms
memory: 26748kb
input:
500 500 aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
15720454042420499810 4058077030882532408 14651762045124606089 4030024243931986061 18033423360813892607 9470601111824364484 3883374861354698625 16650831689368240202 8339028189650687576 2683289915379600554 13133811958066776394 14181220923901262251 18173739360450512256 13142314545999179754 148925491596...
result:
ok 500 lines
Test #2:
score: 0
Wrong Answer
time: 9ms
memory: 27084kb
input:
500 500 zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszz...
output:
14474795271763890665 1983017672294672588 13623057916585389028 5255353490708840384 11775171575738575689 5323333841680885144 0 4672269164432294672 0 16448962039360115768 0 0 11122267230123002761 1556499476035269955 11098562156063039632 10698892008963419548 2149980627398691752 16303238148286703136 1089...
result:
wrong answer 1st lines differ - expected: '4843650749197240262', found: '14474795271763890665'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Runtime Error
Test #22:
score: 0
Runtime Error
input:
100000 100000 zbbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaabab...
output:
result:
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #2:
0%
Subtask #7:
score: 0
Skipped
Dependency #3:
0%