HDUoj- 1698 Just a Hook ( 线段树
来源:互联网 发布:淘宝客2016年还好做吗 编辑:程序博客网 时间:2024/06/08 20:00
Just a Hook
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.
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
11021 5 25 9 3
Sample Output
Case 1: The total value of the hook is 24.
题解:
线段树区间更新
AC代码
#include <bits/stdc++.h>using namespace std;#define LL long long#define CLR(a,b) memset(a,(b),sizeof(a))const int N = 4e5+10;struct node { int left, right; int lazy,tag; int sum;}tree[N];void build(int l,int r,int st){ tree[st].left = l; tree[st].right = r; tree[st].lazy = tree[st].tag = 0; if(l == r) { tree[st].sum = 1; return ; } int mid = (l+r) >> 1; build(l,mid,st<<1); build(mid+1,r,st<<1|1); tree[st].sum = tree[st<<1].sum + tree[st<<1|1].sum;}void update(int l,int r,int val,int st){ if(tree[st].right==r && tree[st].left==l) { //更新一整段 tree[st].lazy = 1; tree[st].tag = val; tree[st].sum = (r-l+1)*val; return; } int mid = (tree[st].left+tree[st].right) >> 1; if(tree[st].lazy) { tree[st].lazy = 0; update(tree[st].left,mid,tree[st].tag,st<<1); update(mid+1,tree[st].right,tree[st].tag,st<<1|1); tree[st].tag = 0; } if(r <= mid) update(l,r,val,st<<1); else if(l > mid) update(l,r,val,st<<1|1); else { update(l,mid,val,st<<1); update(mid+1,r,val,st<<1|1); } tree[st].sum = tree[st<<1].sum + tree[st<<1|1].sum;}int main(){ int T; scanf("%d",&T); int zz = 0; while(T--) { int n, q; scanf("%d%d",&n,&q); build(1,n,1); while(q--) { int l, r, z; scanf("%d%d%d",&l,&r,&z); update(l,r,z,1); } printf("Case %d: The total value of the hook is %d.\n",++zz,tree[1].sum); }return 0;}
- HDUoj- 1698 Just a Hook ( 线段树
- HDUOJ 1698 Just a Hook
- HDU 1698 Just a Hook 线段树
- [hdu]1698 Just a Hook -- 线段树
- hdu 1698 Just a Hook 线段树
- HDU 1698 JUST A HOOK(线段树)
- HDU 1698 Just a Hook 线段树
- hdoj 1698 Just a Hook 【线段树】
- HDU 1698 Just a Hook(线段树)
- HDU 1698 just a hook 线段树
- HDU 1698 Just a Hook(线段树)
- hdu 1698 - Just a Hook(线段树)
- HDU 1698 Just a Hook (线段树)
- hdu 1698 Just a Hook 线段树
- 【线段树】HDOJ 1698 Just a Hook
- hdu 1698 Just a Hook 线段树
- Just a Hook - HDU 1698 线段树
- hdu 1698 Just a Hook(线段树)
- maven的pom 依赖(坐标)导入异常
- c++异常处理成本
- 数据分析随想
- 【HDU 1213】How many tables(并查集模板)
- MySQL中的运算符和常用函数
- HDUoj- 1698 Just a Hook ( 线段树
- Linux命令行修改IP、网关、DNS的方法
- centos6.5 安装python 3
- sublime text 3 安装package control 出现There is no package。。。的问题
- Oracle问题之ORA-12560: TNS:protocol adapter error
- Docker:容器与虚拟化的理解
- vim 简单实用配置
- 大数据的的超级应用—数据挖掘之推荐系统
- 深入 Generator 函数(二) (Diving Deeper With ES6 Generators)