HDU 1698 Just a Hook【线段树】区间修改,查询总和

原创 2015年11月19日 21:45:04

Just a Hook

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24149 Accepted Submission(s): 12076


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.



昨天晚上a掉的,按着感觉来的......

就和区间加减一样的处理,然后今天比较忙,抽空出来贴一下,也是真忙了.....

加油!


#include<stdio.h>
#include<string.h>
int set[400005],sum[400005];
void pushdown(int rt,int len)
{
    if(set[rt])
    {
        int tp=rt<<1,tl=len>>1;
        set[tp]=set[rt];set[tp|1]=set[rt];
        sum[tp]=set[rt]*(len-tl);
        sum[tp|1]=set[rt]*tl;
        set[rt]=0;
    }
}
void build(int rt,int l,int r)
{
    set[rt]=0;
    if(l==r)
    {
        sum[rt]=1;
        return;
    }
    int mid=(l+r)>>1,tp=rt<<1;
    build(tp,l,mid);build(tp|1,mid+1,r);
    sum[rt]=sum[tp]+sum[tp|1];
}
void update(int rt,int l,int r,int a,int b,int c)
{
    if(l>=a&&r<=b)
    {
        set[rt]=c;
        sum[rt]=c*(r-l+1);
        return;
    }
    pushdown(rt,r-l+1);
    int mid=(l+r)>>1,tp=rt<<1;
    if(mid>=a)
    {
        update(tp,l,mid,a,b,c);
    }
    if(mid<b)
    {
        update(tp|1,mid+1,r,a,b,c);
    }
    sum[rt]=sum[tp]+sum[tp|1];
}

int main()
{
    int t;
//    freopen("shuju.txt","r",stdin);
    scanf("%d",&t);
    for(int k=1;k<=t;++k)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        build(1,1,n);
        for(int i=0;i<m;++i)
        {
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            update(1,1,n,a,b,c);
        }
        printf("Case %d: The total value of the hook is %d.\n",k,sum[1]);
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

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

题目链接:点击打开链接 题意: 输入一个n表示一段长度为n的区间,有n个编号为1~n的点,初始值全部为1。 有q个操作, 每个操作有3个数:l,r,v表示将区间l~r的所有元素修改为v。 求经过q次修...
  • weizhuwyzc000
  • weizhuwyzc000
  • 2016年01月01日 20:24
  • 1613

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

该题是线段树区间修改和区间查询的模板题,需要仔细理解模板中的setv数组和sumv数组,sumv数组定义为:如果只执行结点o及其子孙结点中的setv操作,结点o对应区间中所有数只和。   setv数组...
  • weizhuwyzc000
  • weizhuwyzc000
  • 2015年09月25日 20:29
  • 510

HDU 1698 Just a Hook (线段树:区间修改+区间查询)

Just a Hook (线段树:区间修改+区间查询)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Ja...
  • wing_wuchen
  • wing_wuchen
  • 2016年07月25日 13:17
  • 131

【hdu】I Hate It(线段树,结点修改求区间最大值)

线段树的模板题,还是二分递归。 #include #include #include #include #include #include #include #include #inc...
  • u013451221
  • u013451221
  • 2014年09月12日 20:17
  • 882

线段树 (区间修改 区间查询 延迟标记)

hdu 1698 Just a Hook题意: 给你一链子,这天链子由金银铜三种钩子组成,每种钩子都有自己的价值,起初,这条钩子全部由铜钩子组成,给你两个数n(钩子的个数),Q(操作的个数)每次...
  • u013514722
  • u013514722
  • 2015年08月02日 10:37
  • 956

【hdu】1698 just a hook 中文题意&题解

Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Prob...
  • WilliamCode
  • WilliamCode
  • 2016年04月12日 09:09
  • 673

Just a Hook (HDU - 1698)(线段树的区间更新-区间查询)

Just a Hook (HDU - 1698)In the game of DotA, Pudge’s meat hook is actually the most horrible thing f...
  • ZX_zengxi
  • ZX_zengxi
  • 2017年08月09日 20:41
  • 108

HDU 1698 Just a Hook(线段树 区间更新 + 查询区间和)

Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for m...
  • Eternity666
  • Eternity666
  • 2017年05月13日 21:05
  • 112

线段树详解(单点更新与成段更新\区间更新操作)

本文纯属原创,转载请注明出处,谢谢。 距离第一次接触线段树已经一年多了,再次参加ACM暑假集训,这一次轮到我们这些老家伙们给学弟学妹们讲解线段树了,所以就自己重新把自己做过的题目看了一遍,然后写篇博客...
  • u014705673
  • u014705673
  • 2015年07月06日 15:57
  • 6272

HDU 1698 Just a Hook(线段树:区间set,区间查询)

HDU 1698 Just a Hook(线段树:区间set,区间查询) 分析:线段树区间set基本操作,详情看刘汝佳训练指南。 //HDU 1698 线段树 区间set 区间查询 #include ...
  • u013480600
  • u013480600
  • 2014年03月26日 19:18
  • 895
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1698 Just a Hook【线段树】区间修改,查询总和
举报原因:
原因补充:

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