[Assign the task][dfs序+线段树]

http://acm.hdu.edu.cn/showproblem.php?pid=3974

Assign the task

Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7144    Accepted Submission(s): 2708

Problem Description

There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate boss of someone,that person is your subordinate, and all his subordinates are your subordinates as well. If you are nobody's boss, then you have no subordinates,the employee who has no immediate boss is the leader of whole company.So it means the N employees form a tree.

The company usually assigns some tasks to some employees to finish.When a task is assigned to someone,He/She will assigned it to all his/her subordinates.In other words,the person and all his/her subordinates received a task in the same time. Furthermore,whenever a employee received a task,he/she will stop the current task(if he/she has) and start the new one.

Write a program that will help in figuring out some employee’s current task after the company assign some tasks to some employee.

 

Input

The first line contains a single positive integer T( T <= 10 ), indicates the number of test cases.

For each test case:

The first line contains an integer N (N ≤ 50,000) , which is the number of the employees.

The following N - 1 lines each contain two integers u and v, which means the employee v is the immediate boss of employee u(1<=u,v<=N).

The next line contains an integer M (M ≤ 50,000).

The following M lines each contain a message which is either

"C x" which means an inquiry for the current task of employee x

or

"T x y"which means the company assign task y to employee x.

(1<=x<=N,0<=y<=10^9)

 

Output

For each test case, print the test case number (beginning with 1) in the first line and then for every inquiry, output the correspond answer per line.

 

Sample Input

1
5
4 3
3 2
1 3
5 2
5
C 3
T 2 1
C 3
T 3 2
C 3

 

Sample Output

Case #1:
-1
1
2

题意：给一棵树，有单点查询和区间更新两种操作

题解：通过dfs序转化为区间问题，使用线段树维护即可

 #include<iostream>
 #include<cstdio>
 #include<stack>
 using namespace std;
 #define debug(x) cout<<"["<<#x<<"]"<<" is "<<x<<endl;
 typedef long long ll;
 const int maxn=5e4+;
 int n,head[maxn],in[maxn],out[maxn],cnt,tim;
 bool f[maxn];
 struct node{
     int l;
     int r;
     int val;
     int lazy;
 }N[maxn<<];
 struct edge{
     int q;
     int w;
     int nex;
 }e[maxn<<];
 void pushup(int rt){
     N[rt].val=N[rt<<].val+N[(rt<<)|].val;
     return;
 }
 void build(int L,int R,int rt){
     N[rt].l=L;
     N[rt].r=R;
     N[rt].lazy=;
     if(L==R){
         N[rt].val=-;
         return;
     }
     build(L,(L+R)/,rt<<);
     build((L+R)/+,R,(rt<<)|);
 }
 void pushdown(int rt){
     if(N[rt].lazy){
         N[rt<<].lazy=N[rt].lazy;
         N[(rt<<)|].lazy=N[rt].lazy;
         N[rt<<].val=N[(rt<<)|].val=N[rt<<].lazy;
         N[rt].lazy=;
     }
 }
 void update(int L,int R,int rt,int L1,int R1,int c){
     if(L1<=L&&R1>=R){
         N[rt].val=c;
         N[rt].lazy=c;
         return;
     }
     int mid=(L+R)/;
     pushdown(rt);
     if(L1<=mid)update(L,mid,rt<<,L1,R1,c);
     if(R1>mid)update(mid+,R,(rt<<)|,L1,R1,c);
 }
 int query(int L,int R,int rt,int id){
     if(L==R){
         return N[rt].val;
     }
     int mid=(L+R)/;
     pushdown(rt);
     if(id<=mid)return query(L,mid,rt<<,id);
     else return query(mid+,R,(rt<<)|,id);
 }
 void adde(int x,int y){
     e[cnt].q=y;
     e[cnt].w=x;
     e[cnt].nex=head[y];
     head[y]=cnt++;
 }
 void dfs(int u){
     in[u]=++tim;
     for(int i=head[u];i!=-;i=e[i].nex){
         int v=e[i].w;
         dfs(v);
     }
     out[u]=tim;
 }
 int main(){
     int t;
     int case1=;
     scanf("%d",&t);
     while(t--){
         scanf("%d",&n);
         tim=;
         cnt=;
         for(int i=;i<=n;i++){f[i]=;head[i]=-;}
         build(,n,);
         for(int i=;i<n;i++){
             int a,b;
             scanf("%d%d",&a,&b);
             adde(a,b);
             f[a]=;
         }
         for(int i=;i<=n;i++){if(!f[i])dfs(i);}
         int k;
         scanf("%d",&k);
         printf("Case #%d:\n",++case1);
         while(k--){
             char ch[];
             scanf("%s",ch);
             if(ch[]=='T'){
                 int x,xx;
                 scanf("%d%d",&x,&xx);
                 update(,n,,in[x],out[x],xx);
             }
             else{
                 int x;
                 scanf("%d",&x);
                 printf("%d\n",query(,n,,in[x]));
             }
         }
     }
     return ;
 }