题意:
给一个序列,两种操作:
1. 区间开平方(下取整)
2. 区间求和
做法:
有一个性质就是,一个数不停开平方最多开log次就会变成1.
所以我们可以对区间保存一个tag表示这个区间有没有不是0或1的数,如果区间全是0或1就不用往下更新。
然后大概就可以log^2了吧qaqaq。
易错点:
注意开long long。我原来a[]没开long long居然爆TLE错误= =
代码:
/*************************************************************
Problem: bzoj 3038 上帝造题的七分钟2
User: fengyuan
Language: C++
Result: Accepted
Time: 824 ms
Memory: 5604 kb
Submit_Time: 2018-01-05 16:02:29
*************************************************************/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cctype>
#include<cstdlib>
#define mid (l+r>>1)
#define lc o<<1
#define rc o<<1|1
using namespace std;
typedef long long LL;
inline LL read()
{
char ch = getchar(); LL x = 0; int op = 1;
for (; !isdigit(ch); ch = getchar()) if (ch == '-') op = -1;
for (; isdigit(ch); ch = getchar()) x = x*10+ch-'0';
return op*x;
}
inline void write(LL a)
{
if (a < 0) putchar('-'), a = -a;
if (a >= 10) write(a/10); putchar('0'+a%10);
}
const int N = 100010;
int n, m;
LL a[N], sum[N<<2];
bool tag[N<<2];
inline void upd(int o) { sum[o] = sum[lc] + sum[rc]; tag[o] = tag[lc] & tag[rc]; }
inline void build(int o, int l, int r)
{
if(l == r) { sum[o] = a[l]; tag[o] = (sum[o] == 0 || sum[o] == 1); return; }
build(lc, l, mid); build(rc, mid+1, r); upd(o);
}
inline void change(int o, int l, int r, int x, int y)
{
if(tag[o]) return;
if(l == r) { sum[o] = sqrt(sum[o]); tag[o] = (sum[o] == 0 || sum[o] == 1); return; }
if(y <= mid) change(lc, l, mid, x, y);
else if(x > mid) change(rc, mid+1, r, x, y);
else change(lc, l, mid, x, mid), change(rc, mid+1, r, mid+1, y);
upd(o);
}
inline LL query(int o, int l, int r, int x, int y)
{
if(l == x && r == y) return sum[o];
if(y <= mid) return query(lc, l, mid, x, y);
else if(x > mid) return query(rc, mid+1, r, x, y);
else return query(lc, l, mid, x, mid) + query(rc, mid+1, r, mid+1, y);
}
int main()
{
n = read();
for(int i = 1; i <= n; i ++) a[i] = read();
build(1, 1, n);
m = read();
while(m --) {
LL opt = read(), x = read(), y = read();
if(x > y) swap(x, y);
if(opt == 0) change(1, 1, n, x, y);
else write(query(1, 1, n, x, y)), puts("");
}
return 0;
}