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): 2842 Accepted Submission(s): 1183
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.
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)
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
C x 表示编号x的当前任务是什么
T a b 表示 a和a所有的下属(以及下属的下属)任务都换成b
思路:最近线段树看多了,用线段树怎么也想不明白,才搜了题解(菜不解释),用并查集从x节点往上找他的老板所在节点是否在他之后被更改。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxx 50100
using namespace std;
struct node
{
int tk,num;
}t[maxx];
int f[maxx];
int main()
{
int T,m,n,a,b,cas=1;
scanf("%d",&T);
while(T--)
{
memset(f,-1,sizeof(f));
memset(t,-1,sizeof(t));
scanf("%d",&n);
for(int i=1;i<n;i++)
{
scanf("%d%d",&a,&b);
f[a]=b;
}
int numm=0;
char c[5];
scanf("%d",&m);
printf("Case #%d:\n",cas++);
while(m--)
{
scanf("%s",c);
if(c[0]=='T')
{
scanf("%d%d",&a,&b);
t[a].tk=b;
t[a].num=numm++;
}
if(c[0]=='C')
{
scanf("%d",&a);
int k=t[a].tk;
int lm=t[a].num;
a=f[a];
while(a!=-1)
{
if(t[a].num>lm)
{
lm=t[a].num;
k=t[a].tk;
}
a=f[a];
}
printf("%d\n",k);
}
}
}
}