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

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

代码:

#include <bits/stdc++.h>
using namespace std; const int maxn = 1e5 + 10;
int T, N;
int head[maxn];
int cnt, tot;
int st[maxn], en[maxn];
bool used[maxn]; struct Edge {
int to, nx;
}edge[maxn]; struct Node {
int val;
int l, r;
int lazy;
}node[maxn * 4]; void init() {
cnt = 0;
tot = 0;
memset(head, -1, sizeof(head));
} void addedge(int u, int v) {
edge[tot].to = v;
edge[tot].nx = head[u];
head[u] = tot ++;
} void dfs(int u) {
cnt ++;
st[u] = cnt;
for(int i = head[u]; i != -1; i = edge[i].nx)
dfs(edge[i].to);
en[u] = cnt;
} void Update_Same (int r, int v) {
if(r) {
node[r].val = v;
node[r].lazy = 1;
}
} void push_down(int r) {
if(node[r].lazy) {
Update_Same(r * 2, node[r].val);
Update_Same(r * 2 + 1, node[r].val);
node[r].lazy = 0;
}
} void Build(int i, int l, int r) {
node[i].l = l;
node[i].r = r;
node[i].val = -1;
node[i].lazy = 0;
if(l == r) return ;
int mid = (l + r) / 2;
Build(i * 2, l, mid);
Build(i * 2 + 1, mid + 1, r);
} void update(int i, int l, int r, int v) {
if(node[i].l == l && node[i].r == r) {
Update_Same(i, v);
return;
}
push_down(i);
int mid = (node[i].l + node[i].r) / 2;
if(r <= mid) update(i * 2, l, r, v);
else if(l > mid) update(i * 2 + 1, l, r, v);
else {
update(i * 2, l, mid, v);
update(i * 2 + 1, mid + 1, r, v);
}
} int query(int i, int u) {
if(node[i].l == u && node[i].r == u)
return node[i].val;
push_down(i);
int mid = (node[i].l + node[i].r) / 2;
if(u <= mid) return query(i * 2, u);
else return query(i * 2 + 1, u);
} int main() {
scanf("%d", &T);
for(int t = 1; t <= T; t ++) {
printf("Case #%d:\n", t);
int u, v;
memset(used, false, sizeof(used));
init();
scanf("%d", &N);
for(int i = 1; i < N; i ++) {
scanf("%d%d", &u, &v);
used[u] = true;
addedge(v, u);
}
for(int i = 1; i <= N; i ++) {
if(!used[i]) {
dfs(i);
break;
}
}
Build(1, 1, cnt);
char op[10];
int M;
scanf("%d", &M);
while(M --) {
scanf("%s", op);
if(op[0] == 'C') {
scanf("%d", &u);
printf("%d\n", query(1, st[u]));
} else {
scanf("%d%d", &u, &v);
update(1, st[u], en[u], v);
}
}
}
return 0;
}

  线段树 模板题 链表存图 区间修改单点查询 今天小目标之一把这个搞清楚可以自己写粗来

何生枷锁

HDU 3947 Assign the task的更多相关文章

  1. HDU 3974 Assign the task 并查集/图论/线段树

    Assign the task Time Limit: 1 Sec  Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?p ...

  2. HDU 3974 Assign the task 暴力/线段树

    题目链接: 题目 Assign the task Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/O ...

  3. HDU 3974 Assign the task(简单线段树)

    Assign the task Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

  4. hdu 3874 Assign the task

    Assign the task Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

  5. HDU 3974 Assign the task

    Assign the task Problem Description There is a company that has N employees(numbered from 1 to N),ev ...

  6. HDU 3974 Assign the task(DFS序+线段树单点查询,区间修改)

    描述There is a company that has N employees(numbered from 1 to N),every employee in the company has a ...

  7. hdu 3974 Assign the task (线段树+树的遍历)

    Description There is a company that has N employees(numbered from 1 to N),every employee in the comp ...

  8. hdu 3974 Assign the task(dfs序上线段树)

    Problem Description There is a company that has N employees(numbered from 1 to N),every employee in ...

  9. HDU 3974 Assign the task(dfs建树+线段树)

    题目大意:公司里有一些员工及对应的上级,给出一些员工的关系,分配给某员工任务后,其和其所有下属都会进行这项任务.输入T表示分配新的任务, 输入C表示查询某员工的任务.本题的难度在于建树,一开始百思不得 ...

随机推荐

  1. http网站转换成https网站

    https,https的本地测试环境搭建,asp.net结合https的代码实现,http网站转换成https网站之后遇到的问题   一:什么是https SSL(Security   Socket  ...

  2. php学习----错误处理和代码重用

    php错误处理 一.错误分类:1.语法错误 2.运行时错误 3.逻辑错误 错误代号(部分): 所有看到的错误代码在php中都被定义为系统常量(可以直接使用) 1)系统错误 E_PARSE:编译错误,代 ...

  3. C# 基础知识之 Unix 时间戳转换

    unix时间戳是从1970年1月1日(UTC/GMT的午夜)开始所经过的秒数,不考虑闰秒. /// 时间戳转为C#格式时间 private DateTime GetTime(string timeSt ...

  4. 【消息队列】 RabbitMQ教程汇总

    https://www.cnblogs.com/wyt007/category/1218660.html

  5. day2-安装python以及基本使用

    安装Python windows 1.下载安装包 https://www.python.org/downloads/ 2.安装 默认安装路径:C:\python27 3.配置环境变量 [右键计算机]- ...

  6. E:dpkg was interrupted, you must manually run'dpkg配置'to correct the problem.

    执行sudo apt-get install安装对应的软件出现如下错误 详细错误信息: E: Could not : Resource temporarily unavailable) E: Unab ...

  7. 初学Python——字典

    一.定义 什么是字典? 字典是一种数据类型,是一系列数据的组合. 每一个数据单元都分为key和value,key也称主键,具有唯一性,不可重复.value可以理解成是key对应的值. info={ 1 ...

  8. python相关资料链接

    后续的博客更新,会涉及到很多的python及python的框架相关的内容,这里将自己收藏的一些关于python相关资料的链接做一个整理,算是一个导航索引吧... PS:其中有些链接对应的技术团队文章, ...

  9. DES对称加密算法详解和c++代码实现(带样例和详细的中间数据)

    特点: 1.DES是对称性加密算法,即加密和解密是对称的,用的是同一个密钥 2.DES只处理二进制数据,所以需要将明文转换成为2进制数据 3.DES每次处理64位的数据,所以应该将明文切割成64位的分 ...

  10. java将秒转换为时分秒工具类

    需要一个接收时分秒的对象,如下: package com.dq.schoolcontract.utils; import com.sun.media.jfxmedia.control.VideoRen ...