hdu 3874 Assign the task
Assign the task
Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2600 Accepted Submission(s):
1098
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.
<= 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)
(beginning with 1) in the first line and then for every inquiry, output the
correspond answer per line.
5
4 3
3 2
1 3
5 2
5
C 3
T 2 1
C 3
T 3 2
C 3
#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
using namespace std;
const int N_MAX = +;
vector<int>G[N_MAX];
queue<int>que;
int cur_work[N_MAX];
int print[N_MAX];
int N,M; void ceng_xu(int emp,int y) {
que.push(emp);
while (!que.empty()) {
int emp = que.front();
que.pop();
cur_work[emp] = y;
for (int i = ; i < G[emp].size(); i++) {
que.push(G[emp][i]);
}
}
} int main() {
int t,k=;
scanf("%d",&t);
while (t--) {
int num = ;//用于记录print赋值的次数
k++;//测试样本数
memset(cur_work,-,sizeof(cur_work));
scanf("%d",&N);
for (int i = ; i < N - ; i++) {
int emp, boss;//下标都从1开始
scanf("%d%d",&emp,&boss);
G[boss].push_back(emp);
}
scanf("%d",&M);
for (int i = ; i < M; i++) {
char c;
scanf(" %c",&c);
if (c == 'C') {
int a;
scanf("%d",&a);
print[num++]=cur_work[a];
}
else {
int emp, y;
scanf("%d%d",&emp,&y);
ceng_xu(emp, y);
}
}
for (int i = ; i < N; i++) {
G[i].clear();
} printf("Case #%d:\n",k);
for (int i = ; i < num; i++)
printf("%d\n",print[i]);
}
return ;
}
最新文章
- php面向对象编程 设计模式
- 【细说Java】关于main方法的一些细节
- Vs 2015 调试ASP.NET Core修改监听端口
- 导入ApiDemo报错,找不到R文件
- Mongodb学习教程汇总
- Create a SharePoint Application Page for Anonymous Access
- PHP strpos() 函数
- 常用的gnuradio 模块
- asp.net 分页类
- Ext JS学习第二天 我们所熟悉的javascript(一)
- SqlDataReader的关闭问题
- 聊天工具mychat
- -linux删除大量文件----rm,rsync
- java运算符 与(&;)、非(~)、或(|)、异或(^)
- 关于php网络爬虫phpspider。
- 根据isbn获得图书的所有信息
- bzoj 4715
- svn版本备份和恢复注意事项
- solr中重建索引(转)
- 论文阅读:CNN-RNN: A Unified Framework for Multi-label Image Classification