hdu1698-Just a Hook

线段树入门题

Just a Hook

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

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.
  
  

 

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int N,size;
struct Node{//树节点 
	int kind;
	int cl,cr;
	Node *l,*r;
}tree[400005];
void init(Node* root,int tcl,int tcr){//初始化 
	root->cl=tcl;
	root->cr=tcr;
	root->kind=1;
	if(tcl==tcr){
		root->l=NULL;
		root->r=NULL;
		return ;
	}
	int mid=(tcl+tcr)>>1;
	root->l=tree+size++;
	root->r=tree+size++;
	init(root->l,tcl,mid);//递归构建左右子树 
	init(root->r,mid+1,tcr);
}
void insert(Node* root,int l,int r,int kind){
//	cout<<root->cl<<" "<<root->cr<<" "<<l<<" "<<r<<endl; 
	if(l==root->cl&&r==root->cr||root->kind==kind){//区间相同 
		root->kind=kind;
		return ;
	}
	if(root->kind!=-1){//更新左右子节点 
		root->l->kind=root->kind;
		root->r->kind=root->kind;
	}
	root->kind=-1;//本区间kind不一致 
	int mid=(root->cl+root->cr)>>1;
	if(mid<r&&mid>=l) {//下滤，特别要注意边界，小于和小于等于，大于和大于等于等情况
		insert(root->l,l,mid,kind);
		insert(root->r,mid+1,r,kind);
	}
	else if(mid>=r){
		insert(root->l,l,r,kind);
	}
	else {
		insert(root->r,l,r,kind);
	}
	if(root->l->kind!=-1&&root->r->kind==root->l->kind){//更新本节点 
		root->kind=root->l->kind;
	}
}
		
int ans(Node* root){
//	cout<<root->cl<<" "<<root->cr<<" "<<root->kind<<endl;
	if(root->kind!=-1) return root->kind*(root->cr-root->cl+1);//本区间kind一致 
	return ans(root->l)+ans(root->r);
}
int main(){
	int i,j,k,m,n,T,kase,Q,l,r,kind;
	ios::sync_with_stdio(false);
	cin>>T;
	for(kase=1;kase<=T;kase++){
		cin>>N;
		size=1;
		init(tree,1,N);
		cin>>Q;
		for(i=0;i<Q;i++){
			cin>>l>>r>>kind;
			insert(tree,l,r,kind);
		}
		cout<<"Case "<<kase<<": The total value of the hook is ";
		cout<<(ans(tree))<<"."<<endl;
	}
	return 0;
}