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

1、点击打开链接厚度1698 Just a Hook

2、题目大意:

给定n个钩子,价值都是1,然后给出m个操作,a,b,c,即将a到b区间的钩子价值变成c,求经过这些操作之后,这些钩子的总价值,需要注意的是不用每次查询都输出,要求输出的是总的,只需要输出sum[1]即可;

成段更新,需要有一个延迟标记数组,并且注意更新时不必要更新到底,用到时更新父节点,不用时只需要标记即可,往下更新相当于将存的值暂时保存到子节点中,以避免重复更新

3、题目:

Just a Hook

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


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.

 

4、代码:

#include<stdio.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int visit[400005];
int sum[400005];
void updateFather(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void updateSon(int rt,int num)
{
    if(visit[rt])
    {
        visit[rt<<1]=visit[rt<<1|1]=visit[rt];
        sum[rt<<1]=(num-(num>>1))*visit[rt];
        sum[rt<<1|1]=(num>>1)*visit[rt];
        visit[rt]=0;
    }
}
void build(int l,int r,int rt)
{
    visit[rt]=0;
    sum[rt]=1;
    if(l==r)
        return ;
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    updateFather(rt);
}
void update(int L,int R,int c,int l,int r,int rt)
{
    if(L<=l&&R>=r)
    {
        sum[rt]=(r-l+1)*c;
        visit[rt]=c;
        return ;
    }
    updateSon(rt,r-l+1);
    int m=(l+r)>>1;
    if(L<=m)
        update(L,R,c,lson);
    if(R>m)
        update(L,R,c,rson);
    updateFather(rt);
}
int main()
{
    int t,n,m,a,b,c;
    scanf("%d",&t);
    for(int i=1; i<=t; i++)
    {
        scanf("%d%d",&n,&m);
        build(1,n,1);
        while(m--)
        {
            scanf("%d%d%d",&a,&b,&c);
            update(a,b,c,1,n,1);
        }
        printf("Case %d: The total value of the hook is %d.\n",i,sum[1]);
    }
    return 0;
}
/*
1
10
2
1 5 2
5 9 3
*/


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值