哇太神啦!隐约感觉到一定要分块,可是并没有想出来处理xor的方法,看到题解真的跪倒了orz
根号分块,记录区间gcd和区间异或和,然后再另外一个数组里对这个区间进行排序,注意双关键字把标号小的扔前面
单点修改直接暴力重构区间
查询的时候,如果该区间的gcd和这个区间之前的gcd相等(这个表述相当有问题,意会即可),把gcd除掉以后在有序数组里面二分即可(类似lower_bound做法)。若不相等,暴力扫过去即可。
复杂度也是上天,
O(nn√logn√)
,外面再乘上gcd的复杂度,区间内需要排序所以块的大小也没有移动的空间,就这玩意儿能跑过就对了。
p.s.这种题目对拍里面的造数据,要先把答案随机出来,再答案倒推回去询问,否则会造出一大堆no的回复
/**************************************************************
Problem: 4028
User: di4CoveRy
Language: C++
Result: Accepted
Time:5124 ms
Memory:4820 kb
****************************************************************/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define N 100050
#define tp t[n]
#define L(i) (i-1)*k+1
#define R(i) min(i*k,n)
using namespace std;
typedef long long LL;
int n,m,t[N],a[N],k;
LL g[N],xo[N],q;
struct Monster{ LL x; int r; }b[N];
bool cmp(Monster p1,Monster p2) { return p1.x == p2.x ? p1.r < p2.r : p1.x < p2.x; }
LL gcd(LL x,LL y) { return y == 0 ? x : gcd(y,x%y); }
void rebuild(int x) {
g[x] = xo[x] = 0;
for (int i=L(x);i<=R(x);i++) g[x] = gcd( g[x] , a[i] );
for (int i=L(x);i<=R(x);i++) xo[x] ^= a[i];
b[L(x)] = (Monster){ a[L(x)] , L(x) };
for (int i=L(x)+1;i<=R(x);i++) b[i] = (Monster){b[i-1].x^a[i] , i};
sort(b+L(x),b+R(x)+1,cmp);
}
void modify() {
int id,x; scanf("%d%d",&id,&x);
a[id+1] = x; rebuild(t[id+1]);
}
int lb(int l,int r,int p) {
while (l < r) {
int mid = (l + r) >> 1;
if (b[mid].x >= p) r = mid; else l = mid + 1;
}
return l;
}
void solve() {
scanf("%lld",&q); LL sum = 0 , sg = 0;
for (int i=1;i<=tp;i++) {
if (gcd( g[i] , sg ) == sg) {
if (q % sg != 0) { sum ^= xo[i]; sg = gcd(sg,g[i]); continue; }
LL p = (q / sg) ^ sum;
int pos = lb(L(i),R(i),p);
if (b[pos].x == p) { printf("%d\n",b[pos].r-1); return ; }
} else {
LL p = sg , cur = sum;
for (int j=L(i);j<=R(i);j++) {
p = gcd(p,a[j]) , cur ^= a[j];
if (1LL * p * cur == q) { printf("%d\n",j-1); return ; }
}
}
sum ^= xo[i] , sg = gcd(sg,g[i]);
}
puts("no");
}
int main() {
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
scanf("%d",&n); k = sqrt(n);
for (int i=1;i<=n;i++) t[i] = (i-1) / k + 1;
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
for (int i=1;i<=tp;i++) rebuild(i);
scanf("%d",&m);
for (int i=1;i<=m;i++) {
char s[10]; scanf("%s",s+1);
if (s[1] == 'M') modify(); else solve();
}
return 0;
}