hdu 1698 (延迟标记+区间修改+区间求和)
来源:互联网 发布:不可思议的植物 知乎 编辑:程序博客网 时间:2024/05/29 16:55
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.
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.
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
1
10
2
1 5 2
5 9 3
Sample Output
Case 1: The total value of the hook is 24.
Source
2008 “Sunline Cup” National Invitational Contest
思路:第一个想法是对不同区间的不通材料的分别做判断求和,后来根据lazy标记可以发现,在标记下压的过程中其实已经给区间分类了,膜法
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;const int maxn=100000+100;int sum[maxn<<2],add[maxn<<2];//lazyvoid pushup(int rt) {//sum sum[rt]=sum[rt<<1]+sum[rt<<1|1];}void pushdown(int rt,int m) { if(add[rt]) { add[rt<<1]=add[rt<<1|1]=add[rt]; sum[rt<<1]=(m-(m>>1))*add[rt]; sum[rt<<1|1]=(m>>1)*add[rt]; add[rt]=0; }}void build(int l,int r,int rt) { add[rt]=0; if(l==r) { sum[rt]=1; return; } int m=(l+r)>>1; build(l,m,rt<<1); build(m+1,r,rt<<1|1); pushup(rt);}void update(int c,int L,int R,int l,int r,int rt) { if(L<=l&&r<=R) { add[rt]=c; sum[rt]=c*(r-l+1); return; } pushdown(rt,r-l+1); int m=(l+r)>>1; if(L<=m) update(c,L,R,l,m,rt<<1); if(R>m) update(c,L,R,m+1,r,rt<<1|1); pushup(rt);}int main() {// freopen("input.txt","r",stdin); int t; scanf("%d",&t); for(int i=1;i<=t;i++) { int n; scanf("%d",&n); build(1,n,1); int m; scanf("%d",&m); while(m--) { int a,b,c; scanf("%d%d%d",&a,&b,&c); update(c,a,b,1,n,1); } printf("Case %d: The total value of the hook is %d.\n",i,sum[1]); } return 0;}
- hdu 1698 (延迟标记+区间修改+区间求和)
- HDU 1698 JUST a hook (线段树 成段替换 区间求和 延迟标记)
- hdu 1698 Just a Hook 区间修改,区间求和
- 线段树 (区间修改 区间查询 延迟标记)
- hdu 1698区间延迟更新
- HDU 1698 区间更新 求和
- 线段树区间更新区间求和(转延迟标记精讲)
- poj3468 A Simple Problem with Integers 线段树延迟标记区间更新区间求和
- hdu 1698(区间修改)
- HDU3397区间合并 延迟标记
- HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和
- 杭电 HDU ACM 1698 Just a Hook(线段树 区间更新 延迟标记)
- POJ 3468 线段树成段更新区间求和 + 延迟标记详解 A Simple Problem with Integers
- poj3468(树状数组:区间修改 区间求和)
- 线段树(区间修改,区间求和)
- 树状数组 区间修改区间求和总结
- codevs1080 线段树(区间修改+区间求和
- 线段树区间更新模板(lazy延迟标记)(1698)
- 【刷题剑指offer】数组中的逆序对
- 图像识别--Java中使用openCV提取Hog特征通过SVM训练实现图像识别
- 17.7.13B组总结
- python3爬取淘宝信息!
- 树状数组总结——详解(单点/区间查询, 单点/区间修改, 逆序对)
- hdu 1698 (延迟标记+区间修改+区间求和)
- Codeforces #713C: Sonya and Problem without a Legend 题解
- POJ 1637 Sightseeing tour (欧拉路判定 网络流)
- windows上plsql连接linux虚拟机上oracle问题。
- jQuery 编程
- 用两个栈实现队列
- Servlet tomcat配置以及应用
- 【NOIP2014八校联考】乐曲创作(music) (详细证明)
- 各种排序算法总结