题目链接
分析
记录后缀mod p的值,当且仅当两个后缀相等时候这时会 整除p 所以这就变成经典的莫队计数了,由于p很大离散化一下
注意p为2和5的时候特判一下
AC code
#include <bits/stdc++.h>
using namespace std;
#define ms(x,v) (memset((x),(v),sizeof(x)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long LL;
typedef pair<int,int > Pair;
const int maxn = 1e5+10;
int p,m;
const int S = 300;
string s;
struct Query{
int l,r,id,backet;
bool operator < (const Query& o)const{
return backet !=o.backet?l<o.l:(backet&1?r>o.r : r<o.r);
}
}q[maxn];
LL idx[maxn],suf[maxn];
int n;
void init() {
for(LL ten = 1,i=n-1;i>=0; --i)
idx[i+1] =suf[i+1] = ((suf[i+2])+ten*(s[i]-'0'))%p,ten = 10*ten % p;
// for(int i=1 ; i<=n+1 ; ++i) std::cout << "idx " << idx[i] << ' '; std::cout << '\n';
sort(idx+1,idx+n+2);
for(int i=1 ; i<=n+1 ; ++i)suf[i] = lower_bound(idx+1,idx+n+1,suf[i])-idx;
sort(q,q+m);
}
LL ret[maxn];
LL cnt[maxn];
int move(int val,int sign){
if(sign)return cnt[val]++;
else return --cnt[val];
}
int sum[maxn],pre[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>p;
cin>>s;
n = s.size();
cin>>m;
if(p==2 || p==5){
for(int i=1 ; i<=n ; ++i){
pre[i] += pre[i-1],sum[i] += sum[i-1];
if( !((s[i-1]-'0')%p) )pre[i]++,sum[i] += i;
}
for(int i=0 ; i<m ; ++i){
int l,r;cin>>l>>r;
std::cout << (sum[r]-sum[l-1]-(LL)(l-1)*(pre[r]-pre[l-1])) << '\n';
}
return 0;
}
for(int i=0 ; i<m ; ++i){
cin>>q[i].l >> q[i].r;
q[i].r++;
q[i].id = i;q[i].backet =q[i].l/S;
}
init();
// for(int i=1 ; i<=n+1 ; ++i) std::cout << "idx " << idx[i] << ' '; std::cout << '\n';
// for(int i=1 ; i<=n+1 ; ++i) std::cout << "suf "<< suf[i] << ' '; std::cout << '\n';
int l = q[0].l,r = q[0].l-1;
LL ans =0;
for(int i=0 ; i<m ; ++i){
int L = q[i].l,R = q[i].r;
while (l > L)ans += move(suf[--l],1);
while (r < R)ans += move(suf[++r],1);
while (l < L) ans -= move(suf[l++],0);
while (r > R) ans -= move(suf[r--],0);
ret[q[i].id] = ans;
}
for(int i=0 ; i<m; ++i)std::cout << ret[i] << '\n';
return 0;
}