【CodeForces 719E】【线段树+矩阵快速幂】 Sasha and Array
来源:互联网 发布:python 抢购脚本 编辑:程序博客网 时间:2024/05/22 14:34
传送门:E. Sasha and Array
描述:
Sasha has an array of integers a1, a2, ..., an. You have to perform m queries. There might be queries of two types:
- 1 l r x — increase all integers on the segment from l to r by values x;
- 2 l r — find , where f(x) is the x-th Fibonacci number. As this number may be large, you only have to find it modulo109 + 7.
In this problem we define Fibonacci numbers as follows: f(1) = 1, f(2) = 1, f(x) = f(x - 1) + f(x - 2) for all x > 2.
Sasha is a very talented boy and he managed to perform all queries in five seconds. Will you be able to write the program that performs as well as Sasha?
The first line of the input contains two integers n and m (1 ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000) — the number of elements in the array and the number of queries respectively.
The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Then follow m lines with queries descriptions. Each of them contains integers tpi, li, ri and may be xi (1 ≤ tpi ≤ 2, 1 ≤ li ≤ ri ≤ n,1 ≤ xi ≤ 109). Here tpi = 1 corresponds to the queries of the first type and tpi corresponds to the queries of the second type.
It's guaranteed that the input will contains at least one query of the second type.
For each query of the second type print the answer modulo 109 + 7.
5 41 1 2 1 12 1 51 2 4 22 2 42 1 5
579
Initially, array a is equal to 1, 1, 2, 1, 1.
The answer for the first query of the second type is f(1) + f(1) + f(2) + f(1) + f(1) = 1 + 1 + 1 + 1 + 1 = 5.
After the query 1 2 4 2 array a is equal to 1, 3, 4, 3, 1.
The answer for the second query of the second type is f(3) + f(4) + f(3) = 2 + 3 + 2 = 7.
The answer for the third query of the second type is f(1) + f(3) + f(4) + f(3) + f(1) = 1 + 2 + 3 + 2 + 1 = 9.
题意:
题解:
代码:
#include <bits/stdc++.h>#define pr(x) cout << #x << "= " << x << " " ;#define pl(x) cout << #x << "= " << x << endl;#define lson l, m, rt<<1 #define rson m+1, r, rt<<1|1 #define ll __int64using namespace std;template<class T> void read(T&num) { char CH; bool F=false; for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar()); for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar()); F && (num=-num);}const ll M=1e9+7;const int maxn=1e5+10;struct Matrix{ ll v[2][2];};void init(Matrix& ad){ ad.v[0][0]=1; ad.v[0][1]=1; ad.v[1][0]=1; ad.v[1][1]=0;}Matrix mtAdd(Matrix A, Matrix B){ // 求矩阵 A + B int i, j; Matrix C; for(i = 0; i < 2; i ++) for(j = 0; j < 2; j ++){ C.v[i][j] = (A.v[i][j] + B.v[i][j]) % M; } return C;}Matrix mtMul(Matrix A, Matrix B){ // 求矩阵 A * B int i, j, k; Matrix C; for(i = 0; i < 2; i ++) for(j = 0; j < 2; j ++){ C.v[i][j] = 0; for(k = 0; k < 2; k ++){ C.v[i][j] = (A.v[i][k] * B.v[k][j] + C.v[i][j]) % M; } } return C;}Matrix mtPow(Matrix A, int k){ // 求矩阵 A ^ k if(k == 0) { memset(A.v, 0, sizeof(A.v)); for(int i = 0; i < 2; i ++){ A.v[i][i] = 1; } return A; } if(k == 1) return A; Matrix C = mtPow(A, k / 2); if(k % 2 == 0) { return mtMul(C, C); } else { return mtMul(mtMul(C, C), A); }}Matrix sum[maxn<<2],add[maxn<<2],A;void PushUp(int rt){ sum[rt]=mtAdd(sum[rt<<1], sum[rt<<1|1]);}void PushDown(int rt){ add[rt<<1]=mtMul(add[rt<<1], add[rt]); add[rt<<1|1]=mtMul(add[rt<<1|1], add[rt]); sum[rt<<1]=mtMul(sum[rt<<1], add[rt]); sum[rt<<1|1]=mtMul(sum[rt<<1|1], add[rt]); add[rt]=mtPow(A, 0);}void build(int l, int r,int rt){ add[rt]=mtPow(A, 0);//初始化为单位矩阵 sum[rt]=mtPow(A, 0); if(l==r){ int x;read(x); sum[rt]=mtPow(A, x-1); return; } int m=(l+r)>>1; build(lson); build(rson); PushUp(rt); }void update(int L,int R,Matrix c,int l,int r,int rt){ if(L<=l && R>=r){ sum[rt]=mtMul(sum[rt], c); add[rt]=mtMul(add[rt], c); return; } PushDown(rt); int m=(l+r)>>1; if(L<=m)update(L, R, c, lson); if(R>m)update(L, R, c, rson); PushUp(rt);}ll query(int L,int R,int l, int r,int rt){ if(L<=l && R>=r){ return sum[rt].v[0][0]; } PushDown(rt); int m=(l+r)>>1; ll ret=0; if(L<=m)ret=(ret+query(L, R, lson))%M; if(R>m)ret=(ret+query(L, R, rson))%M; PushUp(rt); return ret;}//debug用void print(int l,int r,int rt){ if(l==r){ for(int i=0;i<2;i++){ for(int j=0;j<2;j++) printf("%I64d ",sum[rt].v[i][j]); printf("\n"); } printf("\n"); return; } int m=(l+r)>>1; print(lson); print(rson); } int main(){ #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif int n,m; init(A); read(n);read(m); build(1, n, 1); int op,a,b; while(m--){ read(op);read(a);read(b); if(op==1){ int x;read(x); update(a, b, mtPow(A, x), 1, n, 1); } else{ printf("%I64d\n", query(a, b, 1, n, 1)); } } return 0;}
- [Codeforces 719 E. Sasha and Array] 矩阵快速幂+线段树
- CodeForces-719E Sasha and Array(线段树+矩阵快速幂)
- 【CodeForces 719E】【线段树+矩阵快速幂】 Sasha and Array
- CodeForces 719E Sasha and Array 【线段树】【快速矩阵幂】
- CodeForces - 719E Sasha and Array 线段树 + 矩阵快速幂
- 【Codeforces 718C&719E】Sasha and Array【线段树成段更新+矩阵快速幂】
- cf/Codeforces Round #373 div1-C/div2-E Sasha and Array 线段树 + 维护矩阵快速幂
- [codeforces] 719E Sasha and Array 线段树+快速斐波那契
- 线段树+矩阵快速幂 codeforces718C Sasha and Array
- Codeforces Round #373 (Div. 2) E. Sasha and Array 线段树维护矩阵
- E. Sasha and Array——矩阵+线段树
- Codeforces 718C Sasha and Array(线段树维护矩阵)
- codeforces 373div1 Sasha and Array 矩阵+线段树
- CodeForces 718C Sasha and Array(矩阵类+线段树)
- Codeforces Round #373 (Div. 2) E. Sasha and Array
- Codeforces Round #373 (Div. 2) E. Sasha and Array
- codeforces #373(div 2) E (线段树+矩阵快速幂)
- Codeforces 718C C. Sasha and Array
- 插入排序(性能的简单测试)
- TCP/IP学习笔记
- 初等数论1
- 2016华为校招上机试题3——消灭终极BOSS
- 25
- 【CodeForces 719E】【线段树+矩阵快速幂】 Sasha and Array
- 洛谷 P3400 仓鼠窝
- 使用SDL编写一个拖动开关点亮灯泡的程序
- android 开发书签大全
- 计算斐波那契数列
- 【NOIP2016提高A组五校联考1】排队
- Java并发:多线程
- 【NOIP提高组五校联考】挖金矿
- VMware Linux与Windows拖拽文件传输缺失损坏问题