4028: [HEOI2015]公约数数列
Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 811 Solved: 294
[ Submit][ Status][ Discuss]
Description
设计一个数据结构. 给定一个正整数数列 a_0, a_1, ..., a_{n - 1},你需要支持以下两种操作:
1. MODIFY id x: 将 a_{id} 修改为 x.
2. QUERY x: 求最小的整数 p (0 <= p < n),使得 gcd(a_0, a_1, ..., a_p) * XOR(a_0, a_1, ..., a_p) = x. 其中 XOR(a_0, a_1, ..., a_p) 代表 a_0, a_1, ..., a_p 的异或和,gcd表示最大公约数。
Input
输入数据的第一行包含一个正整数 n.
接下来一行包含 n 个正整数 a_0, a_1, ..., a_{n - 1}.
之后一行包含一个正整数 q,表示询问的个数。
之后 q 行,每行包含一个询问。格式如题目中所述。
Output
对于每个 QUERY 询问,在单独的一行中输出结果。如果不存在这样的 p,输出 no.
Sample Input
10
1353600 5821200 10752000 1670400 3729600 6844320 12544000 117600 59400 640
10
MODIFY 7 20321280
QUERY 162343680
QUERY 1832232960000
MODIFY 0 92160
QUERY 1234567
QUERY 3989856000
QUERY 833018560
MODIFY 3 8600
MODIFY 5 5306112
QUERY 148900352
1353600 5821200 10752000 1670400 3729600 6844320 12544000 117600 59400 640
10
MODIFY 7 20321280
QUERY 162343680
QUERY 1832232960000
MODIFY 0 92160
QUERY 1234567
QUERY 3989856000
QUERY 833018560
MODIFY 3 8600
MODIFY 5 5306112
QUERY 148900352
Sample Output
6
0
no
2
8
8
0
no
2
8
8
HINT
对于 100% 的数据,n <= 100000,q <= 10000,a_i <= 10^9 (0 <= i < n),QUERY x 中的 x <= 10^18,MODIFY id x 中的 0 <= id < n,1 <= x <= 10^9.
Source
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 1E5 + 10;
const int N = 400;
typedef long long LL;
const LL INF = ~0U>>1;
int n,m,Sqrt,cnt = 1,tot,delta,L[N],R[N],B[N][N],siz[N],cur[N],fg[N],lg[N],g[N],Num[maxn],bel[maxn],sum[maxn];
char s[20];
int gcd(int a,int b) {return !b ? a : gcd(b,a % b);}
LL getLL()
{
char ch = getchar(); LL ret = 0;
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9')
ret = ret * 10LL + 1LL * (ch - '0'),ch = getchar();
return ret;
}
int getcom()
{
scanf("%s",s);
return s[0] == 'M' ? 1 : 2;
}
void Work(int k)
{
int *b = B[k]; siz[k] = g[k] = sum[k] = 0;
for (int i = L[k]; i <= R[k]; i++)
{
int now = ++siz[k];
sum[k] ^= Num[i];
g[k] = gcd(g[k],Num[i]);
b[now] = (b[now-1] ^ Num[i]);
}
fg[k] = gcd(lg[k - 1],Num[L[k]]);
lg[k] = gcd(fg[k],g[k]); cur[k] = 1;
sort(b + 1,b + siz[k] + 1);
for (int i = 2; i <= siz[k]; i++)
if (b[i] != b[i - 1]) b[++cur[k]] = b[i];
}
void Modify(int k)
{
Work(k);
for (int i = k + 1; i <= cnt; i++)
{
fg[i] = gcd(lg[i - 1],Num[L[i]]);
lg[i] = gcd(fg[i],g[i]);
}
}
int main()
{
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
n = getLL(); Sqrt = sqrt(n);
for (int i = 1; i <= n; i++) Num[i] = getLL();
for (int i = 1; i <= n; i++)
{
++tot; bel[i] = cnt;
if (tot == Sqrt)
{
R[cnt] = i; tot = 0;
L[++cnt] = i + 1;
}
}
L[1] = 1; R[cnt] = n; m = getLL();
for (int i = 1; i <= cnt; i++) Work(i);
while (m--)
{
int com = getcom();
if (com == 1)
{
int pos = getLL(),x = getLL(); ++pos;
int now = bel[pos]; Num[pos] = x; Modify(now);
}
else
{
LL x = getLL(); bool flag; int Sum; Sum = flag = 0;
for (int i = 1; !flag && i <= cnt; Sum ^= sum[i],i++)
if (fg[i] == lg[i])
{
if (x % (1LL * lg[i]) != 0) continue;
LL res = x / (1LL * lg[i]); res ^= (1LL * Sum);
if (res >= INF) continue;
int pos = lower_bound(B[i] + 1,B[i] + cur[i] + 1,res) - B[i];
if (B[i][pos] != res) continue;
for (int j = L[i],sx = 0; j <= R[i]; j++)
{
sx ^= Num[j];
if (sx == res)
{
printf("%d\n",j - 1);
flag = 1; break;
}
}
}
else
{
int sg = lg[i - 1],sx = Sum;
for (int j = L[i]; j <= R[i]; j++)
{
sg = gcd(Num[j],sg); sx ^= Num[j];
if (1LL * sg * sx == x) {printf("%d\n",j - 1); flag = 1; break;}
//if (x / (1LL * sg) >= INF) break;
}
}
if (!flag) puts("no");
}
}
return 0;
}