hdu 3974 Assign the task （线段树+树的遍历）

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

代码如下：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <queue>
 #include <vector>
 using namespace std;
 const int MAXN = ;
 int n,Q,t,topboss,cnt;
 int head[MAXN],tot;
 int start[MAXN],endd[MAXN];
 bool used[MAXN];
 struct Edge
 {
     int to,next;
 }edge[MAXN];
 void init()
 {
     cnt=;
     tot=;
     memset(head,-,sizeof head);
     memset(used,false,sizeof used);
 }
 void addedge (int u,int v)
 {
     edge[tot].to=v;
     edge[tot].next=head[u];
     head[u]=tot++;
 }
 void dfs(int u)
 {
     ++cnt;
     start[u]=cnt;
     for (int i=head[u];i!=-;i=edge[i].next)
     {
         dfs(edge[i].to);
     }
     endd[u]=cnt;
 }
 struct Node
 {
     int l,r,val,lazy;
 }segTree[MAXN<<];
 void upDate_Same (int r,int v)
 {
     if (r)
     {
         segTree[r].val=v;
         segTree[r].lazy=;
     }
 }
 void push_down (int r)
 {
     if (segTree[r].lazy)
     {
         upDate_Same(r<<,segTree[r].val);
         upDate_Same(r<<|,segTree[r].val);
         segTree[r].lazy=;
     }
 }
 void buildTree (int i,int l,int r)
 {
     segTree[i].l=l;
     segTree[i].r=r;
     segTree[i].val=-;
     segTree[i].lazy=;
     if (l==r)
     return ;
     int mid =(l+r)>>;
     buildTree(i<<,l,mid);
     buildTree(i<<|,mid+,r);
 }
 void update (int i,int l,int r,int v)
 {
     if (segTree[i].l==l&&segTree[i].r==r)
     {
         upDate_Same(i,v);
         return ;
     }
     push_down(i);
     int mid =(segTree[i].l+segTree[i].r)/;
     if (r<=mid) update(i<<,l,r,v);
     else if (l>mid) update(i<<|,l,r,v);
     else
     {
         update(i<<,l,mid,v);
         update(i<<|,mid+,r,v);
     }
 }
 int query (int i,int u)
 {
     if (segTree[i].l==u&&segTree[i].r==u)
         return segTree[i].val;
     push_down(i);
     int mid =(segTree[i].l+segTree[i].r)/;
     if (u<=mid)
         return query(i<<,u);
     else
         return query(i<<|,u);
 }
 int main()
 {
     //freopen("de.txt","r",stdin);
     cin>>t;
     int casee=;
     while (t--){
         printf("Case #%d:\n",++casee);
         int u,v;
         init();
         scanf("%d",&n);
         for (int i=;i<n-;++i){
             cin>>u>>v;
             used[u]=true;
             addedge(v,u);
         }
         for (int i=;i<=n;++i){
             if (!used[i]){
                 dfs(i);
                 break;
             }
         }
         cin>>Q;
         buildTree(,,cnt);
         char op[];
         while (Q--){
             scanf("%s",op);
             if (op[]=='C'){
                 scanf("%d",&u);
                 printf("%d\n",query(,start[u]));
             }
             else{
                 scanf("%d%d",&u,&v);
                 update(,start[u],endd[u],v);
             }
         }
     }
     return ;
 }

700ms，有人200ms过了，正在研究。http://vjudge.net/contest/source/7108995            http://vjudge.net/contest/source/6308790