ACM 数据结构 线段树 HDU 1698Just a Hook

原创 2016年05月31日 14:17:14
  1. 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.
     

    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.


  2. #include <stdio.h>  
  3. #include <string.h>  
  4. #include <algorithm>  
  5. using namespace std;  
  6. const int maxn = 100000+10;  
  7.   
  8. int n,sum;  
  9.   
  10. struct node  
  11. {  
  12.     int l,r,n;  
  13. } a[maxn<<2];  
  14.   
  15. void init(int l,int r,int i)  
  16. {  
  17.     a[i].l = l;  
  18.     a[i].r = r;  
  19.     a[i].n = 1;  
  20.     if(l!=r)  
  21.     {  
  22.         int mid = (l+r)>>1;  
  23.         init(l,mid,2*i);  
  24.         init(mid+1,r,2*i+1);  
  25.     }  
  26. }  
  27.   
  28. void insert(int i,int x,int y,int m)  
  29. {  
  30.     if(a[i].n == m)//相同则不用修改了  
  31.     return ;  
  32.     if(a[i].l == x && a[i].r == y)//找到了区间,直接更新  
  33.     {  
  34.         a[i].n = m;  
  35.         return ;  
  36.     }  
  37.     if(a[i].n != -1)//如果该区间只有一种颜色  
  38.     {  
  39.         a[2*i].n = a[2*i+1].n = a[i].n;//由于后面必定对子树操作,所以更新子树的值等于父亲的值  
  40.         a[i].n = -1;//由于该区域颜色与修改不同,而且不是给定区域,所以该区域必定为杂色  
  41.     }  
  42.     //父区间为杂色时对所有子节点进行操作  
  43.     int mid = (a[i].l+a[i].r)>>1;  
  44.     if(x>mid)  
  45.     insert(2*i+1,x,y,m);  
  46.     else if(y<=mid)  
  47.     insert(2*i,x,y,m);  
  48.     else  
  49.     {  
  50.         insert(2*i,x,mid,m);  
  51.         insert(2*i+1,mid+1,y,m);  
  52.     }  
  53. }  
  54.   
  55. int find(int i)//区间求和  
  56. {  
  57.     if(a[i].n != -1)//纯色直接算这个区间  
  58.     return (a[i].r - a[i].l+1)*a[i].n;  
  59.     else//不存则左右子树去找  
  60.     return find(i*2)+find(i*2+1);  
  61. }  
  62.   
  63. int main()  
  64. {  
  65.     int t,i,k,x,y,m;  
  66.     int cas = 1;  
  67.     scanf("%d",&t);  
  68.     while(t--)  
  69.     {  
  70.         scanf("%d%d",&n,&k);  
  71.         init(1,n,1);  
  72.         while(k--)  
  73.         {  
  74.             scanf("%d%d%d",&x,&y,&m);  
  75.             insert(1,x,y,m);  
  76.         }  
  77.         printf("Case %d: The total value of the hook is %d.\n",cas++,find(1));  
  78.     }  
  79.   
  80.     return 0;  
  81. }  
版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和

HDU 1698 Just a Hook Time Limit:2000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u ...
  • fans_ac
  • fans_ac
  • 2016年07月28日 00:04
  • 163

[ACM] hdu 1698 Just a Hook (线段树,成段更新,懒惰标记)

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

杭电 HDU ACM 1698 Just a Hook(线段树 区间更新 延迟标记)

欢迎“热爱编程”的高考少年——报考杭州电子科技大学计算机学院 Just a Hook Time Limit: 4000/2000 MS (Java/Others)    M...
  • lsgqjh
  • lsgqjh
  • 2015年07月07日 17:07
  • 1081

hdu 1698 Just a Hook 线段树成段更新

裸的成段更新。。。#include #include #include #include #include using namespace std; #define maxn 110000 ...

Just a Hook HDU - 1698(线段树的懒惰标记)

In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. T...

HDU - 1698 Just a Hook (线段树区间修改)

Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most o...

HDU 1698 Just a Hook (线段树)

http://acm.hdu.edu.cn/showproblem.php?pid=1698 /*843ms,2288KB*/ #include #include using name...

HDU 1698 Just a Hook(线段树+lazy)

题目链接:Click here 题意:给你n长度的钩子,每单位的初始值为1,然后m个操作,将(x,y)之间的值变为z,求最后n长度的值的和。思路:使用lazy策略。引用一下概念: “lazy-ta...
  • wadye
  • wadye
  • 2015年07月23日 15:49
  • 141

HDU 1698 Just a Hook [线段树-成段更新]

题意: 屠夫的钩子,可以理解成一条线段,[x,y]是某种颜色,铜色的价值是1,银色是2,金色是3,经过一系列的更新操作,求总的value 分析: 参考比人的,第一次做线段...

hdu 1698 Just a Hook(线段树)

三个区间覆盖操作的线段树题,蛮简单的,貌似我多写了一个query,不过写了就算了吧 代码: #include #define lson o...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:ACM 数据结构 线段树 HDU 1698Just a Hook
举报原因:
原因补充:

(最多只允许输入30个字)