E. Little Girl and Problem on Trees time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A little girl loves problems on trees very much. Here's one of them. A tree is an undirected connected g…

题意 给定一棵无边权的树,最多只有一个点度数超过2,有两种操作 1)(0 u x d)将距离u节点d距离之内的节点的值加上x 2)(1 u)询问u节点的值 n<=100000,q<=100000 题解 只有一个点度数超过2,那么把它当根,整棵树的形态就是从根开始向下延伸许多链, 将距离u节点d距离之内的节点的值加上x,放在u的子树内(应该叫子链吧?)就是区间修改,可以用线段树或树状数组维护这每一条链, 如果距离u节点d距离之内的节点包括根的话,就要先把u到根的路径加上x,然后把距离根节点d -…

Trees on the level Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 584    Accepted Submission(s): 195题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1622 Problem Description Trees are fundamental…

题目链接:https://vjudge.net/contest/209862#problem/B 题目大意: Trees on the level Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 591    Accepted Submission(s): 200 Problem Description Trees are fundame…

A. Lunch Rush 模拟. B. Little Girl and Game 因为可以打乱顺序,所以只关心每种数字打奇偶性. 若一开始就是回文,即奇数字母为0或1种,则先手获胜. 若奇数字母大于1,则只需要考虑奇数字母个数的奇偶性.因为后手可以保证奇数字母个数的奇偶性. C. Little Girl and Maximum Sum 考虑每个位置覆盖次数,显然覆盖次数多分配大权值. D. Little Girl and Maximum XOR 找到 \(l,r\) 不相同的最高位,那么为了异…

Mahmoud was trying to solve the vertex cover problem on trees. The problem statement is: Given an undirected tree consisting of n nodes, find the minimum number of vertices that cover all the edges. Formally, we need to find a set of vertices such th…

A. Mahmoud and Ehab and the even-odd game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mahmoud and Ehab play a game called the even-odd game. Ehab chooses his favorite integer n and then…

Given a binary tree, find all leaves and then remove those leaves. Then repeat the previous steps until the tree is empty. Example:Given binary tree 1 / \ 2 3 / \ 4 5 Returns [4, 5, 3], [2], [1]. Explanation: 1. Remove the leaves [4, 5, 3] from the t…

http://www.cnblogs.com/keam37/p/3639294.html keam所有 转载请注明出处 Problem Description Give you two definitions tree and rooted tree. An undirected connected graph without cycles is called a tree. A tree is called rooted if it has a distinguished vertex r c…

Consider all the leaves of a binary tree.  From left to right order, the values of those leaves form a leaf value sequence. For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8). Two binary trees are considered leaf-similar…