
【并查集】
文章平均质量分 86
Gijkstra
Can we do better?
展开
-
CodeForces - 731C~Socks(并查集+STL)
C. Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputArseniy is already grown-up and independent. His m原创 2017-03-21 09:15:26 · 412 阅读 · 0 评论 -
codeforce 731C Socks(并查集+贪心)
C. Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputArseniy is already grown-up and independent. His m原创 2017-07-19 18:07:45 · 382 阅读 · 0 评论 -
HDU3038~How Many Answers Are Wrongc(带权并查集)
How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7173 Accepted Submission(s): 2651Problem Description原创 2017-03-08 17:06:13 · 299 阅读 · 0 评论 -
HDU Bazinga(KMP+并查集)
BazingaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 5088 Accepted Submission(s): 1606Problem Description Ladies and gentlemen, please si原创 2017-10-10 18:56:13 · 355 阅读 · 0 评论 -
洛谷P2661 信息传递(带权并查集求有向图最小环)
题目描述有n个同学(编号为1到n)正在玩一个信息传递的游戏。在游戏里每人都有一个固定的信息传递对象,其中,编号为i的同学的信息传递对象是编号为Ti同学。游戏开始时,每人都只知道自己的生日。之后每一轮中,所有人会同时将自己当前所知的生日信息告诉各自的信息传递对象(注意:可能有人可以从若干人那里获取信息,但是每人只会把信息告诉一个人,即自己的信息传递对象)。当有人从别人口中得知自己的生日时,游戏结束。原创 2017-12-30 21:12:05 · 1111 阅读 · 0 评论