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 <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, a, b) for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000009;
const int N= 5e4 +10;
int t;
vector<int> V[N];
int n, m, pos, x, y, qL, qR;
char opr;
int T[N*8], vis[N*8];
int ok[N], root;
int ans;
int clk, pre[N], post[N];
int a, b;
void dfs(int cur, int fa) {
pre[cur]=++clk;
FOR(i, 0, V[cur].size()) {
int u=V[cur][i];
if (u==fa) continue;
dfs(u, cur);
}
post[cur]=++clk;
}
void Down(int o, int L, int R) {
T[o*2]=T[o*2+1]=T[o];
vis[o*2]=vis[o*2+1]=1;
vis[o]=0;
}
void Set(int o, int L, int R) {
if (qL<=L&&R<=qR) {
T[o]=y;
vis[o]=1;
return;
}
if (vis[o]) Down(o, L, R);
int M=L+(R-L)/2;
if (qL<=M) Set(o*2, L, M);
if (qR>M) Set(o*2+1, M+1, R);
}
void Query(int o, int L, int R) {
if (vis[o]) {
ans=T[o];
return;
}
int M=L+(R-L)/2;
if (pos<=M) Query(o*2, L, M);
if (pos>M) Query(o*2+1, M+1, R);
}
int main() {
cin>>t;
REP(kase, 1, t) {
printf("Case #%d:\n", kase);
clk=0;
memset(V, 0, sizeof(V));
memset(ok, 0, sizeof(ok));
scanf("%d", &n);
REP(i, 1, n-1) {
scanf("%d %d", &a, &b);
V[b].pb(a);
ok[a]=1;
}
REP(i, 1, n) if (!ok[i]) root=i;
dfs(root, 0);
T[1]=-1;
vis[1]=1;
scanf("%d", &m);
REP(i, 1, m) {
cin>>opr;
if (opr=='C') {
scanf("%d", &x);
pos=pre[x];
Query(1, 1, n*2);
printf("%d\n", ans);
}
else if (opr=='T') {
scanf("%d %d", &x, &y);
qL=pre[x];qR=post[x];
Set(1, 1, n*2);
}
}
}
//cout<<1.*clock()/CLOCKS_PER_SEC<<"ms"<<"\n";
return 0;
}
教练,我想打ACM