POJ3321/Apple tree/(DFS序+线段树)
题目链接
Apple Tree
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9692 Accepted: 3217
Description
Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at one node. She can eat up all the apples in the nodes she reaches. HX is a kind guy. He knows that eating too many can make the lovely girl become fat. So he doesn’t allow Wshxzt to go more than K steps in the tree. It costs one step when she goes from one node to another adjacent node. Wshxzt likes apple very much. So she wants to eat as many as she can. Can you tell how many apples she can eat in at most K steps.
Input
There are several test cases in the input
Each test case contains three parts.
The first part is two numbers N K, whose meanings we have talked about just now. We denote the nodes by 1 2 … N. Since it is a tree, each node can reach any other in only one route. (1<=N<=100, 0<=K<=200)
The second part contains N integers (All integers are nonnegative and not bigger than 1000). The ith number is the amount of apples in Node i.
The third part contains N-1 line. There are two numbers A,B in each line, meaning that Node A and Node B are adjacent.
Input will be ended by the end of file.
Note: Wshxzt starts at Node 1.
Output
For each test case, output the maximal numbers of apples Wshxzt can eat at a line.
Sample Input
2 1
0 11
1 2
3 2
0 1 2
1 2
1 3
Sample Output
11
2
Source
POJ Contest,Author:magicpig@ZSU
/*
DFS序到线段树是一种映射关系,基础DFS序问题
*/
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1e6+5;
struct edge
{
int id;
int next;
};
edge E[maxn<<1];
int head[maxn];
int ecnt;
void add(int u,int v)
{
E[ecnt]={v,head[u]};
head[u]=ecnt++;
}
int vis[maxn];
int l[maxn],r[maxn];
int cnt;
void DFS(int u)
{
vis[u]=1;
l[u]=++cnt;
for(int i=head[u];~i;i=E[i].next)
{
if(!vis[E[i].id])
{
DFS(E[i].id);
}
}
r[u]=cnt;
}
struct node
{
int l;
int r;
int sum;
};
node tree[maxn<<2];
void build(int id,int l,int r)
{
tree[id].l=l;
tree[id].r=r;
tree[id].sum=r-l+1;
if(l==r)
return ;
int mid=(l+r)>>1;
build(id<<1 , l, mid);
build(id<<1|1, mid+1, r);
}
void pushup(int id)
{
tree[id].sum=tree[id<<1].sum+tree[id<<1|1].sum;
}
void update(int id ,int pos)
{
if(tree[id].l==tree[id].r)
{
tree[id].sum^=1;
}
else
{
int mid=(tree[id].l+tree[id].r)>>1;
if(pos>mid)
update(id<<1|1, pos);
else
update(id<<1, pos);
pushup(id);
}
}
int query(int id,int l,int r)
{
if(tree[id].l==l&&tree[id].r==r)
{
return tree[id].sum;
}
int mid=(tree[id].l+tree[id].r)>>1;
if(r<=mid)
return query(id<<1, l, r);
else if(l>mid)
return query(id<<1|1, l, r);
else
{
int ans=0;
ans+=query(id<<1, l, mid);
ans+=query(id<<1|1, mid+1, r);
return ans;
}
}
void init()
{
memset(head, -1, sizeof(head));
ecnt=0;
cnt=0;
}
int n,m;
int main ()
{
scanf("%d",&n);
int u,v;
init();
for(int i=1;i<n;i++)
{
scanf("%d%d",&u,&v);
add(u, v);
add(v, u);
}
DFS(1);
build(1, l[1], r[1]);
scanf("%d",&m);
int id;
char s[10];
for(int i=0;i<m;i++)
{
scanf("%s%d",s,&id);
if(s[0]=='Q')
{
int ans=query(1, l[id], r[id]);
printf("%d\n",ans);
}
else
{
update(1, l[id]);
}
}
return 0;
}
POJ3321/Apple tree/(DFS序+线段树)的更多相关文章
- POJ3321 - Apple Tree DFS序 + 线段树或树状数组
Apple Tree:http://poj.org/problem?id=3321 题意: 告诉你一棵树,每棵树开始每个点上都有一个苹果,有两种操作,一种是计算以x为根的树上有几个苹果,一种是转换x这 ...
- POJ.3321 Apple Tree ( DFS序 线段树 单点更新 区间求和)
POJ.3321 Apple Tree ( DFS序 线段树 单点更新 区间求和) 题意分析 卡卡屋前有一株苹果树,每年秋天,树上长了许多苹果.卡卡很喜欢苹果.树上有N个节点,卡卡给他们编号1到N,根 ...
- poj 3321 Apple Tree dfs序+线段树
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Description There is an apple tree outsid ...
- [poj3321]Apple Tree(dfs序+树状数组)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26762 Accepted: 7947 Descr ...
- Codeforces Round #225 (Div. 2) E. Propagating tree dfs序+-线段树
题目链接:点击传送 E. Propagating tree time limit per test 2 seconds memory limit per test 256 megabytes inpu ...
- codechef T6 Pishty and tree dfs序+线段树
PSHTTR: Pishty 和城堡题目描述 Pishty 是生活在胡斯特市的一个小男孩.胡斯特是胡克兰境内的一个古城,以其中世纪风格 的古堡和非常聪明的熊闻名全国. 胡斯特的镇城之宝是就是这么一座古 ...
- codeforces 620E. New Year Tree dfs序+线段树+bitset
题目链接 给一棵树, 每个节点有颜色, 两种操作, 一种是将一个节点的子树全都染色成c, 一种是查询一个节点的子树有多少个不同的颜色, c<=60. 每个节点一个bitset维护就可以. #in ...
- CodeForces 620E:New Year Tree(dfs序+线段树)
E. New Year Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputout ...
- Codeforces 343D Water Tree(DFS序 + 线段树)
题目大概说给一棵树,进行以下3个操作:把某结点为根的子树中各个结点值设为1.把某结点以及其各个祖先值设为0.询问某结点的值. 对于第一个操作就是经典的DFS序+线段树了.而对于第二个操作,考虑再维护一 ...
- 【cf343】D. Water Tree(dfs序+线段树)
传送门 题意: 给出一个以\(1\)为根的有根树,起始每个结点都为\(0\),现在有三种操作: 1.将\(v\)及\(v\)的子树都置为\(1\): 2.将\(v\)及其所有的祖先都置为\(0\): ...
随机推荐
- bug记录_document.defaultview.getcomputedstyle()
页面中使用document.defaultview.getcomputedstyle()在火狐下取不到值. 原本方法现在$(document).ready()中,换到window.onload里就可以 ...
- web.py 学习(二)Worker
Rocket Server 启动一个线程监听客户端的连接,收到连接将连接放置到队列中.线程池中的Worker会以这个连接进行初始化.Rocket中Worker的基类是: class Worker(Th ...
- Leetcode 074 Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the follo ...
- Visual Studio 2010 安装帮助文档问题
今天重装系统,装完VS2010后,如往常一样安装文档,却弹出如下错误"Could not create the local store in the specified folder.... ...
- A - Space Elevator(动态规划专项)
A - Space Elevator Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u ...
- ural 1146. Maximum Sum(动态规划)
1146. Maximum Sum Time limit: 1.0 second Memory limit: 64 MB Given a 2-dimensional array of positive ...
- Redis4- llist的操作
数据类型List链表(1)介绍list类型其实就是一个双向链表.通过push,pop操作从链表的头部或者尾部添加删除元素.这使得list既可以用作栈,也可以用作队列.该list链表类型应用场景:获得最 ...
- iosNSMutableAttributedString 简单操作
// 打印系统中所有字体的类型名字 NSArray *familyNames = [UIFont familyNames]; for(NSString *familyName in fam ...
- weaver_oa
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/ ...
- VBS调用windows api函数(postmessage)实现后台发送按键脚本
'=========================================================================='' VBScript Source File - ...