HDU1698线段树区间更新
来源:互联网 发布:守望先锋安娜数据 编辑:程序博客网 时间:2024/05/20 05:08
原题http://acm.hdu.edu.cn/showproblem.php?pid=1698
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16935 Accepted Submission(s): 8427
Problem 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.
//本题是典型的线段树区间更新。为了节省时间用到了laz标记#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <malloc.h>#include <ctype.h>#include <string.h>#include <string>#include <algorithm>#include <iostream>#include <stack>#include <queue>#include <deque>#include <vector>#include <math.h>using namespace std;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1const int maxn = 100000 + 10;int laz[maxn<<2];int sum[maxn<<2];void PushUp(int rt){sum[rt] = sum[rt<<1] + sum[rt<<1|1];}void PushDown(int rt,int m){//是从父节点向下更新if(laz[rt]!=0){laz[rt<<1] = laz[rt];laz[rt<<1|1] = laz[rt];sum[rt<<1] = (m-(m>>1))*laz[rt];sum[rt<<1|1] = (m>>1)*laz[rt];laz[rt] = 0;}}void build(int l,int r,int rt){laz[rt] = 0;//每个节点都要标记if(l == r){sum[rt] = 1;return ;}int m = (l+r)>>1;build(lson);build(rson);PushUp(rt);}void update(int L,int R,int c,int l,int r,int rt){if(L<=l && r<=R){laz[rt] = c;sum[rt] = c*(r-l+1);return ;}PushDown(rt,r-l+1);int m = (l+r)/2;if(L <= m){update(L,R,c,lson);}if(R > m){update(L,R,c,rson);}PushUp(rt);}int main(){int t,n,m,x,y,z,cas;while(~scanf("%d",&t)){for(cas=1;cas<=t;cas++){scanf("%d",&n);build(1,n,1);scanf("%d",&m);while(m--){scanf("%d%d%d",&x,&y,&z);update(x,y,z,1,n,1);}printf("Case %d: The total value of the hook is %d.\n",cas,sum[1]);}}return 0;}
0 0
- HDU1698线段树区间更新
- hdu1698 线段树区间更新
- hdu1698 线段树 区间更新
- HDU1698线段树区间更新
- hdu1698(线段树区间更新)
- 线段树区间更新hdu1698
- hdu1698 线段树区间更新
- HDU1698 线段树 区间更新
- HDU1698(线段树区间更新求和)
- HDU1698线段树区间更新,一次查询
- hdu1698线段树(区间更新)
- 线段树区间更新&&HDU1698模板
- hdu1698(线段树区间更新模板)
- 线段树 区间更新(成段更新) HDU1698
- HDU1698--Just a hook--线段树区间更新
- HDU1698:Just a Hook(线段树区间更新)
- hdu1698 Just a Hook(线段树区间更新)
- hdu1698 Just a Hook (线段树区间更新 懒惰标记)
- 5000米433M透明传输模块,远距离无线数传模块 通信模块
- 阶段一:2014/8/01 sscanf用法
- gridview 单元格单击编辑
- 如何删除xcode项目中不再使用的图片资源
- hdu 4788
- HDU1698线段树区间更新
- C#中如何动态加载DockPanel
- 网络编程socket之bind函数
- 小写金额转化成大写金额java代码
- Space Elevator(多重背包)
- win7设置wifi热点
- 115个可演示的Android开源项目
- 移动端数字地球
- linux下tomcat shutdown后 java进程依旧存在