HDU
nucleare
这个作者很懒,什么都没留下…
展开
-
Build Tree HDU - 6533
http://acm.hdu.edu.cn/showproblem.php?pid=6533题目描述构建一个m层的满n叉树,所有的边都有权值。每条边的权值从k个数里面选,每个数只能被选一次0是根节点。di表示根节点到i点的距离,我们的目标是使得每个点到根节点的和最小。答案可能很大,请输出取模p后的答案输入输入包含两行第一行四个数,k,m,n,p (2<=k<=2e5 , 2<=p<=1e15)第二行包含k个数,保证k大于等于边数m,k个数每个.原创 2021-04-30 19:25:37 · 256 阅读 · 1 评论 -
Monitor HDU - 6514 (二维前缀和)
MonitorHDU - 6514Xiaoteng has a large area of land for growing crops, and the land can be seen as a rectangle ofn×mn×m.But recently Xiaoteng found that his crops were often stolen by a group ...原创 2019-04-21 13:19:22 · 508 阅读 · 0 评论 -
Instrction Arrangement HDU - 4109 (拓扑排序*)
Instrction Arrangement HDU - 4109 Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after rea...原创 2018-12-06 21:15:39 · 150 阅读 · 0 评论 -
F - 确定比赛名次 HDU - 1285 (拓扑排序入门)
确定比赛名次 HDU - 1285 有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排名。 Input输入有若干组,每组中的第一行为二个数N(1...原创 2018-12-06 21:07:05 · 120 阅读 · 0 评论 -
Werewolf HDU - 6370 (dfs )
Werewolf HDU - 6370 "The Werewolves" is a popular card game among young people.In the basic game, there are 2 different groups: the werewolves and the villagers. Each player will debate a player ...原创 2018-12-03 19:57:12 · 186 阅读 · 0 评论 -
Can you answer these queries? HDU - 4027 (线段树区间修改查询)
A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of end...原创 2018-09-20 20:32:01 · 101 阅读 · 0 评论 -
Just a Hook HDU - 1698 (线段树区间修改查询)
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length. Now Pud...原创 2018-09-13 20:17:45 · 140 阅读 · 0 评论 -
HDU 1176 - 免费馅饼 (DP || 递归 ||递推)
都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝...原创 2018-07-10 12:12:07 · 166 阅读 · 0 评论 -
Play on Words HDU - 1116 (并查集+欧拉通路)
Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very impo...原创 2018-06-13 20:25:27 · 180 阅读 · 0 评论 -
最短路径问题 (图论入门+dijkstra(单源最短路))
给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。 (1<n<=1000, 0<m<10...原创 2018-05-16 20:25:21 · 263 阅读 · 0 评论