CF 914 D
题意 给你n个数 两个操作
2操作 单点修改
1操作 x y v 问你x 和 y区间内的数gcd在修改次数小于等于1的时候能否为v
我们先维护一个区间gcd
然后去很骚的查询即可 查询大抵就是剪枝的思想 我找到如果一个区间%v==0 那么我就不用查下去了
否则到根如果gcd%v!=0 那么我就需要更改一次
这是这个思路写的代码
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 500025;
ll s[MAX_N<<2];
int tmp;
void up(int rt)
{
s[rt] = gcd(s[rt<<1],s[rt<<1|1]);
}
void build(int rt,int l,int r)
{
if(l==r)
{
scanf("%lld",&s[rt]);
return ;
}
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
up(rt);
}
void update(int rt,int l,int r,int x,int v)
{
if(l==r)
{
s[rt] = v;
return ;
}
if(x<=mid) update(rt<<1,l,mid,x,v);
else update(rt<<1|1,mid+1,r,x,v);
up(rt);
}
void ask(int rt,int l,int r,int x,int y,int v)
{
if(tmp>=2) return;
if(l==r)
{
if(s[rt]%v!=0) tmp++;
return;
}
if(x<=l&&r<=y)
{
if(s[rt]%v!=0)
{
ask(rt<<1,l,mid,x,y,v);
ask(rt<<1|1,mid+1,r,x,y,v);
}
return ;
}
if(x>mid) return ask(rt<<1|1,mid+1,r,x,y,v);
if(y<=mid) return ask(rt<<1,l,mid,x,y,v);
ask(rt<<1,l,mid,x,y,v),ask(rt<<1|1,mid+1,r,x,y,v);
}
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n,Q,opt,x,y,v;
scanf("%d",&n);
build(1,1,n);
scanf("%d",&Q);
while(Q--)
{
scanf("%d%d%d",&opt,&x,&y);
if(opt==1)
{
scanf("%d",&v);
tmp = 0;
ask(1,1,n,x,y,v);
if(tmp>=2) printf("NO\n");
else printf("YES\n");
}
else
{
update(1,1,n,x,y);
}
}
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
没想到自己手写的直接1A了 但是还是学习一下大佬是怎么写的
这是某大佬写的代码 看着更简介了 但是时间相差不多 唯一区别在query函数 也就是我的ask函数
但是明显这个时间复杂度应该会更优
void ask(int rt,int l,int r,int x,int y,int v)
{
if(tmp>=2) return;
if(x<=l&&r<=y)
{
if(s[rt]%v==0) return;
if(l==r) {tmp++;return;}
if((s[rt<<1]%v)&&(s[rt<<1|1]%v)) {tmp+=2;return;}
if(s[rt<<1]%v) ask(rt<<1,l,mid,x,y,v);
else ask(rt<<1|1,mid+1,r,x,y,v);
return ;
}
if(y<=mid) return ask(rt<<1,l,mid,x,y,v);
if(x>mid) return ask(rt<<1|1,mid+1,r,x,y,v);
ask(rt<<1,l,mid,x,y,v),ask(rt<<1|1,mid+1,r,x,y,v);
}