HDU1698 Just a Hook [lazy+成段更新]
来源:互联网 发布:java compare返回结果 编辑:程序博客网 时间:2024/05/27 20:52
Description
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.
Now Pudge wants to do some operations on the hook.
Let us number the consecutive metallic sticks of the hook from 1 to N. For each operation, Pudge can change the consecutive metallic sticks, numbered from X to Y, into cupreous sticks, silver sticks or golden sticks.
The total value of the hook is calculated as the sum of values of N metallic sticks. More precisely, the value for each kind of stick is calculated as follows:
For each cupreous stick, the value is 1.
For each silver stick, the value is 2.
For each golden stick, the value is 3.
Pudge wants to know the total value of the hook after performing the operations.
You may consider the original hook is made up of cupreous sticks.
Now Pudge wants to do some operations on the hook.
Let us number the consecutive metallic sticks of the hook from 1 to N. For each operation, Pudge can change the consecutive metallic sticks, numbered from X to Y, into cupreous sticks, silver sticks or golden sticks.
The total value of the hook is calculated as the sum of values of N metallic sticks. More precisely, the value for each kind of stick is calculated as follows:
For each cupreous stick, the value is 1.
For each silver stick, the value is 2.
For each golden stick, the value is 3.
Pudge wants to know the total value of the hook after performing the operations.
You may consider the original hook is made up of cupreous sticks.
Input
The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 10 cases.
For each case, the first line contains an integer N, 1<=N<=100,000, which is the number of the sticks of Pudge’s meat hook and the second line contains an integer Q, 0<=Q<=100,000, which is the number of the operations.
Next Q lines, each line contains three integers X, Y, 1<=X<=Y<=N, Z, 1<=Z<=3, which defines an operation: change the sticks numbered from X to Y into the metal kind Z, where Z=1 represents the cupreous kind, Z=2 represents the silver kind and Z=3 represents the golden kind.
For each case, the first line contains an integer N, 1<=N<=100,000, which is the number of the sticks of Pudge’s meat hook and the second line contains an integer Q, 0<=Q<=100,000, which is the number of the operations.
Next Q lines, each line contains three integers X, Y, 1<=X<=Y<=N, Z, 1<=Z<=3, which defines an operation: change the sticks numbered from X to Y into the metal kind Z, where Z=1 represents the cupreous kind, Z=2 represents the silver kind and Z=3 represents the golden kind.
Output
For each case, print a number in a line representing the total value of the hook after the operations. Use the format in the example.
Sample Input
11021 5 25 9 3
Sample Output
Case 1: The total value of the hook is 24.
在成段更新的过程中,如果在区间直接更新子节点,每次操作都会花费大量的时间,不然会TLE,所以用lazy标记先更新父节点,然后在查询的时候再去处理子节点
AC代码:
#include <bits/stdc++.h>using namespace std ;const int N = 100050;int a[N<<2] , col[N<<2];void build(int l , int r , int rt){ col[rt] = 0 ; if(l==r) { a[rt] = 1 ; return ; } int m = (l+r)>>1; build(l,m,rt<<1); build(m+1,r,rt<<1|1); a[rt] = a[rt<<1]+a[rt<<1|1];}void update(int L , int R ,int o ,int l , int r , int rt){ if(L<=l&&r<=R) { col[rt] = o ; a[rt] = o*(r-l+1); return ; } int m = (l+r)>>1; if(col[rt]!=0) { col[rt<<1] = col[rt<<1|1]=col[rt]; a[rt<<1] = (m-l+1)*col[rt]; a[rt<<1|1] = (r-m)*col[rt]; col[rt] = 0 ; } if(L<=m) update(L,R,o,l,m,rt<<1); if(m<R) update(L,R,o,m+1,r,rt<<1|1); a[rt] = a[rt<<1] + a[rt<<1|1] ;}int main(){ int t ; cin>>t; for(int cas = 1 ; cas<=t ; cas++) { int n , m ; scanf("%d%d",&n,&m); build(1,n,1); while(m--) { int p , q , h ; scanf("%d%d%d",&p,&q,&h); update(p,q,h,1,n,1); } printf("Case %d: The total value of the hook is %d.\n",cas,a[1]); } return 0 ;}
0 0
- HDU1698 Just a Hook [lazy+成段更新]
- hdu1698 Just a Hook(成段替换 lazy标记)
- HDU1698 Just a Hook 【线段树】+【成段更新】+【lazy标记】
- HDU1698 Just a Hook(线段树+成段更新+lazy标记)
- hdu1698 Just a Hook 线段树,成段更新
- 线段树---成段更新hdu1698 Just a Hook
- HDU1698--Just a Hook(成段更新)
- hdu1698 Just a Hook(成段更新+懒惰标记)
- HDU1698 Just a Hook(成段更新)【模板】
- hdu1698 Just a Hook(线段树成段更新lazy)
- HDU1698 Just a Hook 线段树成段更新
- hdu1698 Just a Hook--区间更新
- HDU1698 Just a Hook 线段树成段更新
- hdu(1698)——Just a Hook(成段更新,节点求和,lazy思想)
- HDU1698 Just a Hook--线段树LAZY操作
- hdu1698 Just a Hook
- hdu1698 Just a Hook
- [HDU1698]Just a Hook
- 智能厨房重构-使用Bmob后端云实现朋友圈的功能
- Working with the DOM
- OpenCV中的肤色检测
- 函数指针&指针函数
- Codeforces Round #328 (Div. 2) A(模拟) B(数学) C(数学)
- HDU1698 Just a Hook [lazy+成段更新]
- 导入Maven项目后,Eclipse提示“Missing artifact ”类的错误
- 省市区三级联动
- 【深入理解java集合系列】List,Set,Map用法以及区别
- svn学习
- 测试图片
- Scrapy爬虫Demo
- Eclipse中根据数据库自动生成dao、mapper、model
- div边框线上添加文字