HDU3078 Network [2016年6月计划树上问题05]

2021-07-14 02:07

阅读：426

标签：style return etc pac udt hot case other ignore

Network

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1293 Accepted Submission(s): 575

Problem Description

The ALPC company is now working on his own network system, which is connecting all N ALPC department. To economize on spending, the backbone network has only one router for each department, and N-1 optical fiber in total to connect all routers.
The usual way to measure connecting speed is lag, or network latency, referring the time taken for a sent packet of data to be received at the other end.
Now the network is on trial, and new photonic crystal fibers designed by ALPC42 is trying out, the lag on fibers can be ignored. That means, lag happened when message transport through the router. ALPC42 is trying to change routers to make the network faster, now he want to know that, which router, in any exactly time, between any pair of nodes, the K-th high latency is. He needs your help.

Input

There are only one test case in input file.
Your program is able to get the information of N routers and N-1 fiber connections from input, and Q questions for two condition: 1. For some reason, the latency of one router changed. 2. Querying the K-th longest lag router between two routers.
For each data case, two integers N and Q for first line. 0Then n integers in second line refer to the latency of each router in the very beginning.
Then N-1 lines followed, contains two integers x and y for each, telling there is a fiber connect router x and router y.
Then q lines followed to describe questions, three numbers k, a, b for each line. If k=0, Telling the latency of router a, Ta changed to b; if k>0, asking the latency of the k-th longest lag router between a and b (include router a and b). 0A blank line follows after each case.

Output

For each question k>0, print a line to answer the latency time. Once there are less than k routers in the way, print "invalid request!" instead.

Sample Input

5 5 5 1 2 3 4 3 1 2 1 4 3 5 3 2 4 5 0 1 2 2 2 3 2 1 4 3 3 5

Sample Output

3 2 2 invalid request!

Source

2009 Multi-University Training Contest 17 - Host by NUDT

Recommend

lcy | We have carefully selected several similar problems for you: 3071 3070 3072 3073 3074

找树上两个点路径上的第k大节点

根据lca分别从起点和终点网上找点权，记下来，排序

lca预处理nlogn lca查询logn 找路径 logn(n个节点的树最多logn层) 排序logn * logn

因此总复杂度(m + n)log^2n

不会超时

#include 
#include 
#include 
#include 
#include 
inline void read(int &x){char ch = getchar();char c = ch;x = 0;while(ch  ‘9‘)c = ch, ch = getchar();while(ch = ‘0‘)x = x * 10 + ch - ‘0‘, ch = getchar();if(c == ‘-‘)x = -x;}
inline void swap(int &a, int &b){int tmp = a;a = b;b = tmp;}

const int MAXN = 80000 + 10;

struct Edge{int u,v,next;}edge[MAXN = 1;j --)
			p[i][j] = p[i - 1][p[i - 1][j]];
}

inline int lca(int va, int vb)
{
	register int i;
	if(deep[va] = 0;i --)
		if(deep[va] - pow2[i] >= deep[vb])
			va = p[i][va];
	if(va == vb)return va;
	for(i = llog2[n];i >= 0;i --)
		if(p[i][va] != p[i][vb])
			va = p[i][va],vb = p[i][vb];
	return p[0][va];
}

int ans[MAXN],rank;

inline void work(int s, int t, int k)
{
	int anc = lca(s, t);
	int now = s;
	register int i = 1;
	num[i] = w[now];
	while(now != anc)
		num[++i] = w[(now = fa[now])];
	now = t;
	while(now != anc)
		num[++i] = w[now], now = fa[now];
	std::sort(num + 1, num + 1 + i);
	if(i >= k)
		ans[++rank] = num[i - k + 1];
	else rank++;
}

int main()
{
	register int i,tmp1,tmp2,tmp3;
	llog2[0] = -1,pow2[0] = 1;
	for(int i = 1;i > 1] + 1;
	for(int i = 1;i

HDU3078 Network [2016年6月计划树上问题05]

标签：style return etc pac udt hot case other ignore

原文地址：http://www.cnblogs.com/huibixiaoxing/p/7076740.html

上一篇：js模版引擎开发实战以及对eval函数的改进

下一篇：hibernate知识

文章来自：搜素材网的编程语言模块，转载请注明文章出处。
文章标题：HDU3078 Network [2016年6月计划树上问题05]
文章链接：http://soscw.com/index.php/essay/104899.html

亲，登录后才可以留言！

HDU3078 Network [2016年6月计划树上问题05]

Network

评论

热门文章

推荐文章

最新文章

置顶文章

HDU3078 Network [2016年6月计划 树上问题05]

Network

评论

热门文章

推荐文章

最新文章

置顶文章

HDU3078 Network [2016年6月计划树上问题05]