传送门
题目描述
分析
我们去维护每个区间内不能整除 x x x的个数 c n t cnt cnt
-
x
=
=
0
x == 0
x==0
把这个区间内任意一个数修改为 x x x即可 -
x
=
=
1
x == 1
x==1
将不能整除 x x x的数修改为 x x x -
x
>
1
x > 1
x>1
无法达到要求
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N], n,cnt;
struct Node {
int l, r, cnt;
}tr[N * 4];
void push(int u) {
tr[u].cnt = gcd(tr[u << 1].cnt, tr[u << 1 | 1].cnt);
}
void build(int u, int l, int r) {
tr[u].l = l,tr[u].r = r;
if (l == r) {
tr[u].cnt = a[l];
return;
}
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
push(u);
}
void modify(int u,int p,int x){
if(tr[u].l == tr[u].r){
tr[u].cnt = x;
return;
}
int mid = tr[u].l + tr[u].r >> 1;
if(p <= mid) modify(u << 1,p,x);
else modify(u << 1 | 1,p,x);
push(u);
}
void query(int u,int l,int r,int x){
if(cnt > 1) return;
if(tr[u].l == tr[u].r) {
cnt++;
return;
}
int res = 0;
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid && tr[u << 1].cnt % x) query(u << 1,l,r,x);
if(r > mid && tr[u << 1 | 1].cnt % x) query(u << 1 | 1,l,r,x);
return;
}
int main() {
read(n);
for (int i = 1; i <= n; i++) read(a[i]);
build(1, 1, n);
int m;
read(m);
while(m--){
int op,l,r,x;
read(op);
if(op == 1){
read(l),read(r),read(x);
cnt = 0;
query(1,l,r,x);
printf("%s\n",cnt <= 1 ? "YES" : "NO");
}
else {
read(r),read(x);
modify(1,r,x);
}
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/