题意:N个数,每次给出L,R,先将区间和累加至计数器S,并将区间内每个数取平方。所有操作都对9223372034707292160取模。
范围:5组数据,10W个数
解法:很神奇的取模数,当某个数一直平方下去再对其取模,就会在某一步之后,一直都是那个数了..所以这就变成了单点有次数限制更改的线段树;
其复杂度为N*logN*限制次数(至多29);由于此题的乘法会暴longlong,需要用位操作模拟乘法。
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<stdlib.h>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<bitset>
#pragma comment(linker, "/STACK:1024000000,1024000000")
template <class T>
bool scanff(T &ret){ //Faster Input
char c; int sgn; T bit=0.1;
if(c=getchar(),c==EOF) return 0;
while(c!='-'&&c!='.'&&(c<'0'||c>'9')) c=getchar();
sgn=(c=='-')?-1:1;
ret=(c=='-')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
if(c==' '||c=='\n'){ ret*=sgn; return 1; }
while(c=getchar(),c>='0'&&c<='9') ret+=(c-'0')*bit,bit/=10;
ret*=sgn;
return 1;
}
#define inf 1073741823
#define llinf 4611686018427387903LL
#define PI acos(-1.0)
#define lth (th<<1)
#define rth (th<<1|1)
#define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
#define drep(i,a,b) for(int i=int(a);i>=int(b);i--)
#define gson(i,root) for(int i=ptx[root];~i;i=ed[i].next)
#define tdata int testnum;scanff(testnum);for(int cas=1;cas<=testnum;cas++)
#define mem(x,val) memset(x,val,sizeof(x))
#define mkp(a,b) make_pair(a,b)
#define findx(x) lower_bound(b+1,b+1+bn,x)-b
#define pb(x) push_back(x)
using namespace std;
typedef unsigned long long ll;
typedef pair<int,int> pii;
#define NN 280000
const ll mod=9223372034707292160llu;
int n,m,qn,ql,qr,lx[NN],rx[NN];
ll val[NN];
bool bj[NN];
void built(int n){
for(m=1;m<n+3;m<<=1);
rep(i,n+1,m)val[i+m]=0;
rep(i,1,n)scanff(val[i+m]);
rep(i,0,m<<1)bj[i]=0;
rep(i,0,m-1)lx[i+m]=rx[i+m]=i;
drep(th,m-1,1){
lx[th]=lx[lth];
rx[th]=rx[rth];
val[th]=(val[lth]+val[rth])%mod;
}
}
ll mul(ll x,ll y){
ll z=0;
while(x>0){
if(x&1)z=(z+y)%mod;
x>>=1;y=(y<<1)%mod;
}
return z;
}
void update(int th){
int l=lx[th],r=rx[th];
if(th>m){
ll z=mul(val[th],val[th]);
if(z==val[th])bj[th]=1;
val[th]=z;
}
else{
int mid=(l+r)>>1;
if(!bj[lth]&&ql<=mid)update(lth);
if(!bj[rth]&&qr> mid)update(rth);
//maintain
val[th]=(val[lth]+val[rth])%mod;
if(bj[lth]&&bj[rth])bj[th]=1;
}
}
ll query(int l,int r){
ll ans=0;
for(l=l+m-1,r=r+m+1;l^r^1;l>>=1,r>>=1){
if(~l&1)ans=(ans+val[l^1])%mod;
if(r&1) ans=(ans+val[r^1])%mod;
}
return ans;
}
int main(){
tdata{
printf("Case #%d:\n",cas);
scanf("%d%d",&n,&qn);
built(n);
ll ans=0;
rep(i,1,qn){
scanf("%d%d",&ql,&qr);
ans=(ans+query(ql,qr))%mod;
update(1);
printf("%llu\n",ans);
}
}
return 0;
}