关闭

HDU 1698 Just a Hook(线段树区间更新+区间求和+染色问题)

59人阅读 评论(0) 收藏 举报
分类:

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.

题目大意

对于一个长度为N的数组,初始值为1,Q次操作分别是将区间[l,r]的数全部修改为z.输出最终状态下所有数的和

解题思路

类似于区间染色问题,建树时全部染色为1,查询结果时,只要color[]!=-1,即代表这个区间内的值全部为color[],则ans+=(r-l)*color[].

代码实现

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 100007
int color[maxn<<4];
int ans;
void build(int l,int r,int root)
{
    color[root]=1;
    if(l==r) return ;
    int m=(l+r)/2;
    build(l,m,root<<1);
    build(m+1,r,root<<1|1);
}
void PushDown(int root)
{
    color[root<<1]=color[root<<1|1]=color[root];
    color[root]=-1;
}
void Update(int L,int R,int c,int l,int r,int root)
{
    if(L<=l&&R>=r)
    {
        color[root]=c;
        return ;
    }
    if(color[root]!=-1) PushDown(root);
    int m=(l+r)/2;
    if(m>=L) Update(L,R,c,l,m,root<<1);
    if(m<R) Update(L,R,c,m+1,r,root<<1|1);
}
void Query(int L,int R,int l,int r,int root)
{
    if(color[root]!=-1)
    {
        ans+=color[root]*(r-l+1);
        return ;
    }
    if(l==r) return;
    int m=(l+r)/2;
    if(m>=L)
        Query(L,R,l,m,root<<1);
    if(m<R)
        Query(L,R,m+1,r,root<<1|1);
}
int main()
{
    int T,n,Q;
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++)
    {
        ans=0;
        scanf("%d",&n);
        build(1,n,1);
        scanf("%d",&Q);
        int l,r,t;
        while(Q--)
        {
            scanf("%d %d %d",&l,&r,&t);
            Update(l,r,t,1,n,1);
        }
        Query(1,n,1,n,1);
        printf("Case %d: The total value of the hook is %d.\n",cas,ans);
    }
    return 0;
}
0
0
查看评论

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

Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description In the game of DotA, Pudge’s meat...
  • WilliamCode
  • WilliamCode
  • 2016-04-12 09:09
  • 720

POJ 3468 线段树区间更新求和模板

A Simple Problem with Integers Time Limit: 5000MS   Memory Limit: 131072K Total Submissions: 75854   Accept...
  • discreeter
  • discreeter
  • 2015-08-04 20:19
  • 844

线段树经典操作模板(单点更新,替换;区间更新,替换;区间求和求最值)

对于线段树的讲解此篇不再赘述,下面列出线段树应用中最常用的几种操作的代码。(具体题目未贴出,仅供有一定基础者参考代码风格) 另外,注意多组输入要写scanf("%d%d",&n,&m)!=EOF,线段树的题肯定要用c语言的输入输出,要使用字符数组,不用字符串,输...
  • NK_test
  • NK_test
  • 2015-08-09 18:37
  • 1301

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
  • 1723

HDU 1698 Just a Hook 线段树区间更新

HDU 1698 Just a Hook:http://acm.hdu.edu.cn/showproblem.php?pid=1698 √ 题意:问一个数组中改变一段区间的数的大小 最后求争端区间的和 模板题代码:#include <cstdio> #include <io...
  • SolarDomo
  • SolarDomo
  • 2016-08-12 21:57
  • 169

[HDU 1698]Just a Hook[线段树区间更新]

题目链接:[HDU 1698]Just a Hook[线段树区间更新] 题意分析: 屠夫的钩子被分割成n个节,每节初始时都有铜制,铜制每节价值为1.然后给出q个操作,改变段l,r的材料为其它材料。最终询问:此时钩子的总价值是多少? 解题思路: 线段树的区间更新。使用到了lazy思想,也就是代...
  • CatGlory
  • CatGlory
  • 2015-09-22 17:05
  • 342

hdu 1698 Just a Hook(线段树——区间更新)

Just a HookProblem 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...
  • blessLZH0108
  • blessLZH0108
  • 2017-04-21 16:51
  • 186

HDU 1698 Just a Hook (线段树区间更新)

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...
  • u013923947
  • u013923947
  • 2014-08-13 16:16
  • 412

hdu 1698 Just a Hook(线段树-区间更新)

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12191 ...
  • WEYuLi
  • WEYuLi
  • 2013-07-19 23:37
  • 584

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. The hook is made up of several consecutive metallic...
  • Fusheng_Yizhao
  • Fusheng_Yizhao
  • 2017-09-26 21:54
  • 90
    共勉
    100斤苹果 含水量90%
    放了几天缩水了 含水量80%
    问苹果现在还剩多少斤

    在无效占据大多数的时候
    无效的轻微减少就是有效的大量增加

    人生的时间大多都是无效的
    他们只是比我的无效少一点点
    个人资料
    • 访问:28805次
    • 积分:2116
    • 等级:
    • 排名:千里之外
    • 原创:176篇
    • 转载:2篇
    • 译文:0篇
    • 评论:15条