Albert_Liuzw的博客

题目链接 题目描述 Hja有一棵N个点的树，树上每个点有点权，每条边有颜色。 一条路径的权值是这条路径上所有点的点权和，一条合法的路径需要满足该路径上任意相邻的两条边颜色都不相同。 问这棵树上所有合法路径的权值和是多少。 输入 第一行一个数N。 接下来一行N个数代表每个点的权值。 接下来N−1行每行三个整数s,e,c，代表s到e之间有一条颜色为c的边。 输出 一行一个整数代表答案。 样例输入 6...

2019山东ACM省赛总结 2019山东ACM省赛总结 一、省赛总结  总的来说，这次比赛我们的发挥还是挺好的，比平时训练的状态要好，全程出题较快且仅产生20分钟罚时，也正是这样我们才能成为唯一一个七题拿金的队伍。在收获的同时，这次比赛也暴露出我们的一些问题。 平时踩更多的坑，赛场才能少踩坑： 在平日的训练中，我们三个的成绩几乎每次都是最差的，...

UVA 11452 "Dancing the Cheeky-Cheeky" 找循环节那里要从后往前找，以解决112234112234这样的数据 #include <bits/stdc++.h> using namespace std; const int maxn = 10000; char a[maxn]; int pi[maxn]; void getnext(int n) {...

UVA 455 "Periodic Strings" 题意：给T个字符串，分别输出这T个字符串的最小循环节长度 求出前缀数组如果n-pi[n]整除n，则答案为n-pi[n]，否则为答案为n。 如上图，如果红色的前缀与蓝色的后缀相同，则两段绿色的相同，以此类推，整个字符串可划分为n-pi[n]段相同的子串 #include <bits/stdc++.h> using namespac...

UPC10544: 凉宫春日的叹息 10544: 凉宫春日的叹息 时间限制:1 Sec内存限制:128 MB提交:35解决:16[提交] [状态] [讨论版] [命题人:admin] 题目描述 给定一个数组，将其所有子区间的和从小到大排序，求第k小的是多少。 输入 第一行两个数n, k，表示数组的长度和k；第二行...

货币系统问题 （完全背包） 题目描述 货币是在国家或经济体内的物资与服务交换中充当等价物，或是偿还债务的特殊商品，是用作交易媒介、储藏价值和记账单位的一种工具。魔法世界的货币的历史，可以追溯至史前以物易物的阶段，后来经过金属货币、金银、纸币以及金银本位制度，演化至现代的货币体系，现已知魔法世界的货币系统有V种面值，求组成面值为N的货币有多少种...

祖玛(Zuma) Description Let's play the game Zuma! There are a sequence of beads on a track at the right beginning. All the beads are colored but no three adjacent ones are allowed to be with a same...

重名剔除(Deduplicate) Description Mr. Epicure is compiling an encyclopedia of food. He had collected a long list of candidates nominated by several belly-gods. As candidates in list are nominated by...

真二叉树重构(Proper Rebuild) Description In general, given the preorder traversal sequence and postorder traversal sequence of a binary tree, we cannot determine the binary tree. Figure 1 In Figure 1...

循环移位(Cycle) Description Cycle shifting refers to following operation on the sting. Moving first letter to the end and keeping rest part of the string. For example, apply cycle shifting on ABCD w...

无线广播(Broadcast) Description A broadcaster wants to set up a radio broadcast transmitter in an area. There are n towns in the area, and each town has a transmitter installed and plays its own pro...

玩具(Toy) Description ZC God is best at logical reasoning. One day, he talks about his childhood digital toys. The toy is like a Rubik's cube, but not a Rubik's cube. Specifically, it is not a 3 *...

任务调度(Schedule) Description A HPS cluster is equipped with a unique task scheduler. To be simple, it is assumed that this cluster doesn’t support multiple tasks running at the same time, such tha...

平均气温(Temperature) Description A weather station collects temperature data from observation stations all over the country every day, and provides statistical inquiry services to remote users thro...

旅行商(TSP) Description Shrek is a postman working in the mountain, whose routine work is sending mail to n villages. Unfortunately, road between villages is out of repair for long time, such that ...

列车调度(Train) Description Figure 1 shows the structure of a station for train dispatching. Figure 1 In this station, A is the entrance for each train and B is the exit. S is the transfer end. All...

范围查询(Range) Descriptioin Let S be a set of n integral points on the x-axis. For each given interval [a, b], you are asked to count the points lying inside. Input The first line contains two inte...

灯塔(LightHouse) Description As shown in the following figure, If another lighthouse is in gray area, they can beacon each other. For example, in following figure, (B, R) is a pair of lighthouse ...

洛谷P2774方格取数问题 题目链接 将题目反着考虑，假设现在所有数都取，需要删掉一部分数，使得剩下的数没有公共边且删掉的数之和最小。 容易发现，两个位置有公共边当且仅当他们横纵坐标的和的奇偶性不同。建立一个二分图，左边为坐标和为奇数的点，右边为坐标和为偶数的点，将左右两边存在公共边的点连起来。s向左边的每个点建边，权值为点的权值，右边每个点向t建边，权值也为点的权值。求删掉和最少的数使...

洛谷P4009骑车加油行驶问题 题目链接 建一个\(k+1\)层的图，第0层为到加油站，第\(i\) \((1\leq i \leq k)\)层为走了\(i\)步，每个点向下一层中与它四联通的点建流量为1花费为0的边。需要注意它只要经过加油站就必须要加油，所以在1到k层中，加油站的点只能向第0层建边，不可向下一层建边 #include <bits/stdc++.h> usi...