Bash and a Tough Math Puzzle

https://cn.vjudge.net/problem/CodeForces-914D 

反思：查询时注意各种情况；很容易忽略一些区间和%的情况；

#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------


const int maxn=5e5+9;
const int mod=1e9+7;

struct node
{
    int sum,gd;
    int val;
    int Max;
}tree[maxn*4];
int a[maxn];
void pushup(int rt)
{
    tree[rt].gd=__gcd(tree[rt<<1].gd,tree[rt<<1|1].gd);
}

void build(int rt,int l,int r)
{
    tree[rt].gd=0;
    if(l==r)
    {
        tree[rt].gd=abs(a[l]);
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}

void update(int rt,int l,int r,int pos,int val)
{
    if(l==r)
    {
        tree[rt].gd=val;
        return ;
    }
    int mid=(l+r)>>1;
    if(pos<=mid) update(rt<<1,l,mid,pos,val);
    else update(rt<<1|1,mid+1,r,pos,val);
    pushup(rt);
}

int ans=0;
void query_gcd(int rt,int l,int r,int ql,int qr,int x)
{
    if(r==l)
    {
        ans++;
        return ;
    }
    if(ans>1) return ;
    int mid=(l+r)>>1;
    if(ql<=mid&&tree[rt<<1].gd%x!=0)query_gcd(rt<<1,l,mid,ql,qr,x);
    if(qr>mid&&tree[rt<<1|1].gd%x!=0) query_gcd(rt<<1|1,mid+1,r,ql,qr,x);
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n,m;
    //cin>>n>>m;
    n=read();
    for(int i=1;i<=n;i++)
    {
        //cin>>a[i];
        a[i]=read();
    }
    build(1,1,n);
    m=read();
    while(m--)
    {
        int op;
        int l,r;
        int x;
        //cin>>op;
        op=read();
        if(op==1)
        {
            //cin>>l>>r;
            l=read();
            r=read();
            x=read();
            ans=0;
            query_gcd(1,1,n,l,r,x);
            if(ans<=1) puts("YES");
            else puts("NO");
        }
        else
        {
            //cin>>l>>r>>x;
            l=read();
            x=read();
            update(1,1,n,l,x);
        }

    }

    return 0;
}