HDU - Just a Hook(线段树)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1698
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

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.

Problem solving report:

Description: N个数, 初始全部为1, 进行Q次以下操作:
把[l, r]的所有值改为V (1<=V<=3),最后求N个数的和.
Problem solving: 裸的线段树的模板题。

Accepted Code:

/* 
 * @Author: lzyws739307453 
 * @Language: C++ 
 */
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
struct Tree {
    int val, Mark;
}seg[MAXN << 2];
void PushUp(int rt) {
    seg[rt].val = seg[rt << 1].val + seg[rt << 1 | 1].val;
}
void PushDown(int l, int r, int rt) {
    if (seg[rt].Mark) {
        int mid = l + (r - l >> 1);
        seg[rt << 1].val = seg[rt].Mark * (mid - l + 1);
        seg[rt << 1].Mark = seg[rt].Mark;
        seg[rt << 1 | 1].val = seg[rt].Mark * (r - mid);
        seg[rt << 1 | 1].Mark = seg[rt].Mark;
        seg[rt].Mark = 0;
    }
}
void Create(int l, int r, int rt) {
    if (!(r - l)) {
        seg[rt].val = 1;
        seg[rt].Mark = 0;
        return ;
    }
    int mid = l + (r - l >> 1);
    Create(l, mid, rt << 1);
    Create(mid + 1, r, rt << 1 | 1);
    PushUp(rt);
}
void Update(int Ql, int Qr, int val, int l, int r, int rt) {
    if (Ql <= l && Qr >= r) {
        seg[rt].val = (r - l + 1) * val;
        seg[rt].Mark = val;
        return ;
    }
    PushDown(l, r, rt);
    int mid = l + (r - l >> 1);
    if (Ql <= mid)
        Update(Ql, Qr, val, l, mid, rt << 1);
    if (Qr > mid)
        Update(Ql, Qr, val, mid + 1, r, rt << 1 | 1);
    PushUp(rt);
}
int Query(int l, int r, int rt) {
    if (!(r - l))
        return seg[rt].val;
    PushDown(l, r, rt);
    int mid = l + (r - l >> 1); 
    return Query(l, mid, rt << 1) + Query(mid + 1, r, rt << 1 | 1);
}
int main() {
    int t, n, m;
    int l, r, v, kase = 0;
    scanf("%d", &t);
    while (t--) {
        scanf("%d%d", &n, &m);
        Create(1, n, 1);
        while (m--) {
            scanf("%d%d%d", &l, &r, &v);
            Update(l, r, v, 1, n, 1);
        }
        printf("Case %d: The total value of the hook is %d.\n", ++kase, Query(1, n, 1));
    }
    return 0;
}
展开阅读全文
©️2020 CSDN 皮肤主题: 代码科技 设计师: Amelia_0503 返回首页
实付0元
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值