Hdu1698 Just a Hook (line segment tree)

Hdu1698 Just a Hook (line segment tree)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission (s): 24473 Accepted Submission (s): 12193

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

11021 5 25 9 3

Sample Output

Case 1: The total value of the hook is 24.

Source 2008 "Sunline Cup" National Invitational Contest
A line segment is composed of n small lines. Each operation changes a small line segment in an interval into one of Gold and Silver. (the value of gold is 3, the value of silver is 2, and the value of copper is 1 ), it can be regarded as copper at first, and finally the total value of this line segment is obtained. Analysis: the Basic Interval Update is just learned. According to my understanding, the Interval Update is that the tree has a status at the beginning, then, each update is equivalent to changing all the trees with a node as the root node into the same State. That is, each node has a number, indicating that all the nodes in the tree with this node as the root node are in this number, or it indicates that the tree with the node as the root has different numbers, then it is changed to-1 (or others, you are happy), and then proceed. I don't know if I can understand it. It's really not a good description --.

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      # Include
       
         # Include
        
          # Include
         
           # Include using namespace std; const double eps = 1e-6; const double pi = acos (-1.0); const int INF = 0x3f3f3f; const int MOD = 1000000007; # define ll long # define CL (a, B) memset (a, B, sizeof (a) # define MAXN 100000 + 10 struct node {int l, r, s;} t [MAXN <2]; int n, sum; void build (int l, int r, int num) {t [num]. l = l; t [num]. r = r; t [num]. s = 1; if (l = r) return; int mid = (l + r)> 1; build (l, mid, num <1); B Uild (mid + 1, r, num <1 | 1);} void update (int l, int r, int m, int num) {if (t [num]. s = m) return; // if it is the same, you do not need to change if (t [num]. l = l & t [num]. r = r) // {t [num]. s = m; return;} if (t [num]. s! =-1) // This interval has only one color {t [num <1]. s = t [num <1 | 1]. s = t [num]. s; // change all its child nodes to the same color as the parent node t [num]. s =-1; // because the color of the region is different from that of the region, therefore, this area is changed from solid color to noisy color} // The parent range is noisy color to process int mid = (t [num] for all child nodes. l + t [num]. r)> 1; if (l> mid) update (l, r, m, num <1 | 1); else if (r <= mid) update (l, r, m, num <1); else {update (l, mid, m, num <1); update (mid + 1, r, m, num <1 | 1) ;}} int query (int num) {if (t [num]. s! =-1) // return (t [num] for solid color. r-t [num]. l + 1) * t [num]. s; else // The left and right subtree return query (num <1) + query (num <1 | 1);} int main () {int x, y, z, T, k; int cas = 1; scanf ("% d", & T); while (T --) {scanf ("% d ", & n, & k); build (1, n, 1); while (k --) {scanf ("% d", & x, & y, & z); update (x, y, z, 1);} printf ("Case % d: The total value of the hook is % d. \ n ", cas ++, query (1);} return 0 ;}