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;
}


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

相关文章推荐

hdu1698 Just a Hook 线段树延迟标记区间更新 求加权区间总和

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

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

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

hdu_1698Just a Hook线段树_区间修改

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

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

在Dota里面有个角色叫屠夫,他的武器是 Meat Hook,对所有的英雄都有着致命的威胁, Meat Hook 由一系列连续金属构成(假设有N块金属),金属有 铜 ,银 ,金 三种,分别对应价值 1...

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

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1698 分析&题解:不多说,这类水题都放模板 1.线段树标准预处理:#define lc (d<<1...
  • FeBr2
  • FeBr2
  • 2016-07-23 14:57
  • 118

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...

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

HDU 1698 Just a Hook(线段树:区间set,区间查询) 分析:线段树区间set基本操作,详情看刘汝佳训练指南。 //HDU 1698 线段树 区间set 区间查询 #include ...

hdu 1698 Just a hook 线段树 成段更新~~区间求和

这道题很经典~~感觉挺有意思,可能是我自己花时间想了好久吧。。 线段树成段更新

hdu1698 Just a Hook 线段树区间更新,延时标记

传送门:hdu1698 Just a Hook 题目大意有三种钩子,分为铜,银,金,对应的价值分别为1,2,3,一共有n个钩子,初始的时候每个钩子的都是铜的。先做如下操作对x到y区间的钩子改变为z价值...

hdu1698 Just a Hook(线段树,区间更新)

题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1698 题意: 某个钩子由n个小钩子组成,有q个操作,将某个区间内的小钩子的材料改变,有...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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