HDU
没什么简介的
lonely_wind_
路漫漫兮
展开
-
2020杭电HDU-6852多校第七场Increasing and Decreasing(构造+思维模拟)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6852博客园食用链接:https://www.cnblogs.com/lonely-wind-/p/13485238.htmlNotice:Don’t output extra spaces at the end of one line.Given n,x,y, please construct a permutation of length n, satisfying that:The length原创 2020-08-11 21:22:14 · 409 阅读 · 1 评论 -
2020杭电HDU-6763多校第二场Total Eclipse(并查集)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6763博客园食用链接:https://www.cnblogs.com/lonely-wind-/p/13383968.htmlProblem DescriptionThere are n cities and m bidirectional roads in Byteland. These cities are labeled by 1,2,…,n, the brightness of the i-th c原创 2020-07-27 10:16:57 · 464 阅读 · 0 评论 -
2020杭电HDU-6756多校第一场Finding a MEX(图的分块)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6756博客园食用链接:https://www.cnblogs.com/lonely-wind-/p/13379683.htmlProblem DescriptionGiven an undirected graph G=(V,E). All vertices are numbered from 1 to N. And every vertex u has a value of Au. Let Su={Av│原创 2020-07-26 11:14:47 · 486 阅读 · 0 评论 -
2020杭电HDU-6768多校第二场Lead of Wisdom(暴力DFS)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6772博客园食用:CSDN食用:Problem DescriptionIn an online game, “Lead of Wisdom” is a place where the lucky player can randomly get powerful items.There are k types of items, a player can wear at most one item fo原创 2020-07-24 20:52:15 · 428 阅读 · 0 评论 -
2020杭电HDU多校第二场New Equipments(三分+费用流)
Problem DescriptionLittle Q’s factory recently purchased m pieces of new equipment, labeled by 1,2,…,m.There are n workers in the factory, labeled by 1,2,…,n. Each worker can be assigned to no more than one piece of equipment, and no piece of equipment c原创 2020-07-23 19:21:21 · 830 阅读 · 0 评论