2021ccpc东北四省D思维线段树

每个数最多取log次就会编程10000(2)，如果是这种数字的话直接可以打一个标记，我们直接乘2，这样不必每个数都加lowbit
传送门

/** @Author: 0iq_love_zy* @LastEditTime: 2021-06-16 17:55:19* @CSDN blog: https://blog.csdn.net/acm_durante* @E-mail: 1055323152@qq.com* @ProbTitle: */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lowbit(x) ((x) & -(x))
const ll mod = 998244353;
ll powmod(ll a, ll b)
{ll res = 1;a %= mod;assert(b >= 0);for (; b; b >>= 1){if (b & 1)res = res * a % mod;a = a * a % mod;}return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
template <class T>
inline void read(T &res)
{char c;T flag = 1;while ((c = getchar()) < '0' || c > '9')if (c == '-')flag = -1;res = c - '0';while ((c = getchar()) >= '0' && c <= '9')res = res * 10 + c - '0';res *= flag;
}
const int N = 1e5 + 50;
int n, m;
struct node
{int l, r;ll x, sum;int lazy;int flag;
} tree[N << 2];void push_up(int p)
{tree[p].sum = (tree[p << 1].sum + tree[p << 1 | 1].sum) % mod;tree[p].flag = (tree[p << 1].flag & tree[p << 1 | 1].flag);
}void push_down(int p)
{if (tree[p].lazy == 0)return;tree[p << 1].lazy += tree[p].lazy;tree[p << 1 | 1].lazy += tree[p].lazy;tree[p << 1].sum = (tree[p << 1].sum * powmod(2, tree[p].lazy)) % mod;tree[p << 1 | 1].sum = (tree[p << 1 | 1].sum * powmod(2, tree[p].lazy)) % mod;tree[p].lazy = 0;
}void build_tree(int l, int r, int p)
{tree[p].l = l, tree[p].r = r;tree[p].lazy = tree[p].flag = 0;if (l == r){scanf("%lld", &tree[p].x);tree[p].sum = tree[p].x;if (lowbit(tree[p].x) == tree[p].x)tree[p].flag = 1;return;}int mid = l + r >> 1;build_tree(l, mid, p << 1);build_tree(mid + 1, r, p << 1 | 1);push_up(p);
}void update_tree(int l, int r, int p)
{if (l <= tree[p].l && tree[p].r <= r && tree[p].flag){tree[p].sum = (tree[p].sum * 2) % mod;tree[p].lazy++;return;}if (tree[p].l == tree[p].r){tree[p].x = tree[p].sum = tree[p].sum + lowbit(tree[p].sum);if (lowbit(tree[p].x) == tree[p].x)tree[p].flag = 1;return;}push_down(p);int mid = (tree[p].l + tree[p].r) >> 1;if (l <= mid)update_tree(l, r, p << 1);if (mid < r)update_tree(l, r, p << 1 | 1);push_up(p);
}ll ask_sum(int l, int r, int p)
{if (l <= tree[p].l && tree[p].r <= r){   return tree[p].sum;}ll res = 0;push_down(p);int mid = (tree[p].l + tree[p].r) >> 1;if (l <= mid)res = (res + ask_sum(l, r, p << 1)) % mod;if (mid < r)res = (res + ask_sum(l, r, p << 1 | 1)) % mod;return res;
}
void solve()
{scanf("%d", &n);build_tree(1, n, 1);scanf("%d", &m);int op, l, r;for (int i = 1; i <= m; i++){scanf("%d%d%d", &op, &l, &r);if (op == 1){update_tree(l, r, 1);}else{printf("%lld\n", ask_sum(l, r, 1));}}
}
int main()
{int t;while (~scanf("%d", &t)){while (t--){solve();}}return 0;
}

2021ccpc东北四省D思维线段树相关推荐

P2787 语文1（chin1）- 理理思维(线段树)
P2787 语文1(chin1)- 理理思维(线段树) 对每个字母开一棵线段树操作1就是区间查询操作2就是区间修改操作3可以看成先预处理查询出区间对应的每个字母的个数,然后进行区间修改. 然后 ...
东北四省赛H-Skyscraper-线段树的区间合并优化
题目描述: At the main street of Byteland, there will be built n skyscrapers, standing sequentially one n ...
duliu——思维+线段树
题目 [题目描述] 小 `D` 喜欢出毒瘤题毒人.当然,他的毒瘤更多体现在若干个难题组合在同一场比赛时. 小 `D` 脑中有 $n$ 个毒瘤题 idea,第 $i$ 个的毒值为$d_i$.当第 $i$ ...
CodeForces ABBYY Cup 3.0 - Finals B Shave Beaver! （思维+线段树）
题目链接题意:给你n个数1~n的序列,随后又q次询问,每次询问有2种操作,操作1:查询从序列中取出数值为x,x+1,...,y-1,y的数的最少需要取多少次(且每取一次只能是一个递增的子序列) ...
2021CCPC东北四省赛 D. Lowbit 势能线段树
传送门分析分析一下x+lowbit(x)x + lowbit(x)x+lowbit(x)这个操作如果多次操作之后,那么xxx中只会有最高位存在一,这个时候再执行一次操作就会使整个数字乘二所以, ...
AtCoder - arc120_c Swaps 2(思维+线段树+模拟)
题目链接:点击查看题目大意:给出一个序列 aaa,问能否经过有限此操作使其变成 bbb,每次操作分为三步: 选择一个 iii,满足 i+1<=ni+1<=ni+1<=n,然后 sw ...
Interesting Array CodeForces - 483D(思维+线段树)
We'll call an array of n non-negative integers a[1], a[2], -, a[n] interesting, if it meets m constr ...
CodeForces - 1401 F Reverse and Swap（线段树，区间翻转，区间交换，清晰易懂）
CodeForces - 1401 F Reverse and Swap(线段树, 区间翻转, 区间交换) 首先一共有四个操作,第一个和第四个都是线段树的基本操作,直接用线段树实现. 第 ...
切题 (problem)（线段树+最大流最小割）
切题 problem description solution code description 在一个神秘的 JOSLFN 上,wzy 和 lqs2015 常年占据着切题榜的 rk1 和 rk2.现 ...
算法竞赛从入门到进阶pdf_【算法趣谈】线段树从入门到进阶
前言:这是一篇笔者两年前所写的博客.如今,在线段树在脑海中即将遗忘之际,这两年前留下的文章,终于将其再次唤醒.这篇文章对于线段树的理解虽谈不上绝对深刻,但是也能详细且简明地解释其流程.因而也收 ...

2021ccpc东北四省D思维线段树

2021ccpc东北四省D思维线段树相关推荐

最新文章

热门文章