线段树暴力搞 剪剪枝就好了
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef double db;
typedef long long ll;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
void print(ll x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
//(100000005x+20150609) mod 998244353 ˆy mod 100001
const int N=100100,A=100000005,B=20150609,C=998244353,D=100001;
int n,x0;
inline int rnd()
{x0=(1ll*A*x0+B)%C;return x0/100;}
struct EDGE{int mx,mn;bool rev;}tr[N<<2];
inline void pushup(int k)
{
tr[k].mx=max(tr[k<<1].mx,tr[k<<1|1].mx);
tr[k].mn=min(tr[k<<1].mn,tr[k<<1|1].mn);
}
inline void getrever(int k)
{
int tmp=tr[k].mx;
tr[k].mx=D-tr[k].mn-1;
tr[k].mn=D-tmp-1;
}
inline void pushdown(int k)
{
if(tr[k].rev)
{
getrever(k<<1);getrever(k<<1|1);
tr[k].rev=0;
tr[k<<1].rev^=1;tr[k<<1|1].rev^=1;
}
}
void build(int k,int l,int r)
{
if(l==r)
{
tr[k].mx=tr[k].mn=rnd()%D;
return ;
}
int mid=(l+r)>>1;
build(k<<1,l,mid);build(k<<1|1,mid+1,r);
pushup(k);
}
void modify(int k,int l,int r,int x,int val)
{
if(l^r)pushdown(k);
if(l==r)
{
tr[k].mx=tr[k].mn=val;
return ;
}
int mid=(l+r)>>1;
x<=mid ? modify(k<<1,l,mid,x,val) : modify(k<<1|1,mid+1,r,x,val);
pushup(k);
}
void rever(int k,int l,int r,int x,int y)
{
if(l^r)pushdown(k);
if(l>=x&&r<=y)
{
getrever(k);
tr[k].rev^=1;
return ;
}
int mid=(l+r)>>1;
if(x<=mid) rever(k<<1,l,mid,x,y);
if(y>mid) rever(k<<1|1,mid+1,r,x,y);
pushup(k);
}
ll ans;
inline ll col(int x,int y,int a,int b,int c)
{return 1ll*x*a+1ll*y*b+1ll*x*y*c;}
void query(int k,int l,int r,int x,int y,int a,int b,int c)
{
if(l^r)pushdown(k);
int mid=(l+r)>>1;
if(l>=x&&r<=y)
{
if(l==r)
{
ans=max(ans,col(l,tr[k].mx,a,b,c));
return ;
}
if(col(r,tr[k<<1|1].mx,a,b,c)>ans) query(k<<1|1,mid+1,r,x,y,a,b,c);
if(col(mid,tr[k<<1].mx,a,b,c)>ans) query(k<<1,l,mid,x,y,a,b,c);
return ;
}
if(x<=mid) query(k<<1,l,mid,x,y,a,b,c);
if(y>mid) query(k<<1|1,mid+1,r,x,y,a,b,c);
}
int main()
{
n=read();int m=read();x0=read();
build(1,1,n);
char opt[2];
register int x,y,a,b,c;
while(m--)
{
scanf("%s",opt);
switch(opt[0])
{
case 'C':
x=rnd()%n+1;y=rnd()%D;
modify(1,1,n,x,y);
break;
case 'R':
x=rnd()%n+1;y=rnd()%n+1;if(x>y)swap(x,y);
rever(1,1,n,x,y);
break;
case 'Q':
x=rnd()%n+1;y=rnd()%n+1;if(x>y)swap(x,y);
a=read();b=read();c=read();
ans=0;
query(1,1,n,x,y,a,b,c);
print(ans);puts("");
break;
}
}
}
/*
3 3 2705443
C
R
Q 872784 195599 7
13035048532
*/
疯狂卡常版
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define fastcall __attribute__((optimize("-O3")))
#define IL __inline__ __attribute__((always_inline))
typedef double db;
typedef long long ll;
#include<bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
char *TT,*mo,but[(1<<15)+2];
#define getchar() ((TT==mo&&(mo=(TT=but)+fread(but,1,1<<15,stdin)),TT==mo)?0:*TT++)
#endif
inline int read()
{
int x=0,c=0;
while(c<'0'||c>'9')c=getchar();
while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
return x;
}
void print(ll x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
//(100000005x+20150609) mod 998244353 ˆy mod 100001
const int N=100100,A=100000005,B=20150609,C=998244353,D=100001;
int n,x0;
fastcall inline int rnd()
{x0=(1ll*A*x0+B)%C;return x0/100;}
struct EDGE{int mx,mn;bool rev;}tr[N<<2];
fastcall inline void pushup(int k)
{
tr[k].mx=max(tr[k<<1].mx,tr[k<<1|1].mx);
tr[k].mn=min(tr[k<<1].mn,tr[k<<1|1].mn);
}
fastcall inline void getrever(int k)
{
int tmp=tr[k].mx;
tr[k].mx=D-tr[k].mn-1;
tr[k].mn=D-tmp-1;
}
fastcall inline void pushdown(int k)
{
if(tr[k].rev)
{
getrever(k<<1);getrever(k<<1|1);
tr[k].rev=0;
tr[k<<1].rev^=1;tr[k<<1|1].rev^=1;
}
}
fastcall void build(int k,int l,int r)
{
if(l==r)
{
tr[k].mx=tr[k].mn=rnd()%D;
return ;
}
int mid=(l+r)>>1;
build(k<<1,l,mid);build(k<<1|1,mid+1,r);
pushup(k);
}
fastcall void modify(int k,int l,int r,int x,int val)
{
if(l^r)pushdown(k);
if(l==r)
{
tr[k].mx=tr[k].mn=val;
return ;
}
int mid=(l+r)>>1;
x<=mid ? modify(k<<1,l,mid,x,val) : modify(k<<1|1,mid+1,r,x,val);
pushup(k);
}
fastcall void rever(int k,int l,int r,int x,int y)
{
if(l^r)pushdown(k);
if(l>=x&&r<=y)
{
getrever(k);
tr[k].rev^=1;
return ;
}
int mid=(l+r)>>1;
if(x<=mid) rever(k<<1,l,mid,x,y);
if(y>mid) rever(k<<1|1,mid+1,r,x,y);
pushup(k);
}
ll ans;
fastcall inline ll col(int x,int y,int a,int b,int c)
{return 1ll*x*a+1ll*y*b+1ll*x*y*c;}
fastcall void query(int k,int l,int r,int x,int y,int a,int b,int c)
{
if(l^r)pushdown(k);
int mid=(l+r)>>1;
if(l>=x&&r<=y)
{
if(l==r)
{
ans=max(ans,col(l,tr[k].mx,a,b,c));
return ;
}
if(col(r,tr[k<<1|1].mx,a,b,c)>ans) query(k<<1|1,mid+1,r,x,y,a,b,c);
if(col(mid,tr[k<<1].mx,a,b,c)>ans) query(k<<1,l,mid,x,y,a,b,c);
return ;
}
if(x<=mid) query(k<<1,l,mid,x,y,a,b,c);
if(y>mid) query(k<<1|1,mid+1,r,x,y,a,b,c);
}
int main()
{
n=read();int m=read();x0=read();
build(1,1,n);
char opt;
register int x,y,a,b,c;
while(m--)
{
opt=getchar();
while(opt!='C'&&opt!='R'&&opt!='Q')opt=getchar();
switch(opt)
{
case 'C':
x=rnd()%n+1;y=rnd()%D;
modify(1,1,n,x,y);
break;
case 'R':
x=rnd()%n+1;y=rnd()%n+1;if(x>y)swap(x,y);
rever(1,1,n,x,y);
break;
case 'Q':
x=rnd()%n+1;y=rnd()%n+1;if(x>y)swap(x,y);
a=read();b=read();c=read();
ans=0;
query(1,1,n,x,y,a,b,c);
print(ans);puts("");
break;
}
}
}
/*
3 3 2705443
C
R
Q 872784 195599 7
13035048532
*/