【bzoj 3821】玄学 线段树
来源:互联网 发布:300和dcs通讯编程实例 编辑:程序博客网 时间:2024/05/09 00:39
给一个数列ai。要求维护(在线):
1.将ai到aj的值变为(ax + b) mod m
2.问执行操作i到操作j后ak的权值
对操作建线段树,一个线段树节点只在加入操作r后update,一个节点可以用一个长度为O(l)的数组维护,询问时二分下即可。log平方n。
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <cmath>#define Rep(i, x, y) for (int i = x; i <= y; i ++)#define Dwn(i, x, y) for (int i = x; i >= y; i --)#define RepE(i, x) for(int i = pos[x]; i; i = g[i].nex)using namespace std;typedef long long LL;const int N = 600005, M = N * 25;int n, m, T0, L[N*4], R[N*4], dl[M], dr[M], ql, qr, qa, qb, dz, mod, ty, mx, a[N], q, T, lans; LL da[M], db[M], a1, b1;int read() { int x = 0; char c; for (c = getchar(); c < '0' || c > '9'; c = getchar()) ; for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0'; return x;}void Upd(int x) { int t1 = L[x + x], t2 = L[x + x + 1], r1 = R[x + x], r2 = R[x + x + 1], l0 = 1; L[x] = dz + 1; while (t1 <= r1 || t2 <= r2) { dl[++ dz] = l0, dr[dz] = min(dr[t1], dr[t2]); da[dz] = da[t1] * da[t2] % mod; db[dz] = (da[t2] * db[t1] + db[t2]) % mod; l0 = dr[dz] + 1; if (t2 > r2 || (t1 <= r1 && dr[t1] < dr[t2])) t1 ++; else if (t1 > r1 || dr[t2] < dr[t1]) t2 ++; else t1 ++, t2 ++; } R[x] = dz;}void Modify(int x, int l, int r) { if (l == r) { L[x] = dz + 1; if (ql > 1) dl[++ dz] = 1, dr[dz] = ql - 1, da[dz] = 1; dl[ ++ dz ] = ql, dr[dz] = qr, da[dz] = qa, db[dz] = qb; if (qr < n) dl[++ dz] = qr + 1, dr[dz] = n, da[dz] = 1; R[x] = dz; return ; } int mid = l + r >> 1; if (q <= mid) Modify(x+x, l, mid); else Modify(x+x+1, mid+1, r); if (q == r) Upd(x);}int Find(int l, int r) { while (l < r) { int mid = l + r >> 1; if (dr[mid] < qa) l = mid + 1; else r = mid; } return l;}void Qry(int x, int l, int r) { if (ql > r || qr < l) return ; if (ql <= l && r <= qr) { int k = Find(L[x], R[x]); a1 = a1 * da[k] % mod, b1 = (b1 * da[k] + db[k]) % mod; return ; } int mid = l + r >> 1; Qry(x+x, l, mid), Qry(x+x+1, mid+1, r);}int main(){ scanf ("%d%d%d", &T0, &n, &mod); Rep(i, 1, n) scanf ("%d", &a[i]); scanf ("%d", &T); mx = T; while (T --) { ty = read(), ql = read(), qr = read(), qa = read(); if (T0 & 1) ql ^= lans, qr ^= lans; if (ty == 1) { qb = read(), q ++; Modify(1, 1, mx); } else { if (T0 & 1) qa ^= lans; a1 = 1, b1 = 0, Qry(1, 1, mx); lans = (a1 * a[qa] + b1) % mod; printf("%d\n", lans); } } return 0;}
0 0
- 【bzoj 3821】玄学 线段树
- bzoj 3821 玄学 [线段树+归并排序]
- [玄学分治 || 线段树] BZOJ 2675 Bomb & Tsin 1322 Bomb(李超)
- 环中环 纪中1347 dp+线段树优化 玄学
- [线段树][读入优化][玄学加速]借教室 noip
- bzoj 线段树专刊
- bzoj 1798 线段树
- BZOJ 1012 线段树
- bzoj 4388 线段树
- BZOJ 1798 线段树
- BZOJ 1112 线段树
- BZOJ 3339 线段树
- bzoj 2957 线段树
- bzoj 1012 线段树
- bzoj 2752 线段树
- bzoj 3519 线段树
- bzoj 1798 线段树
- BZOJ 3038 线段树
- PHP 5.3向更高版本迁移之新特性
- 设计模式:抽象工厂通信图--UML通信图案例
- 破解完VisualAssist后VisualStudio打不开了的解决办法
- 7种文件类型的创建与删除(系统调用)
- 软件测试之旅第一站————之测试用例格式
- 【bzoj 3821】玄学 线段树
- 5分钟学会怎样提升网站用户体验及优化方法
- [2101]:A + B Problem Too
- 1080. Graduate Admission (30)
- 安利一款软件-FolderSize
- git使用---创建版本库
- mysql易犯错误
- BZOJ2049: [Sdoi2008]Cave 洞穴勘测
- 数据库调优的几种方法