---------搜索---------
CrossDolphin
青春看起来如此完美,没空闲去浪费时间。
展开
-
hdu 5927 DFS
链接:戳这里Auxiliary SetTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/OtherProblem DescriptionGiven a rooted tree with n vertices, some of the vertices are原创 2016-10-06 17:49:54 · 738 阅读 · 2 评论 -
2016 Multi-University Training Contest 1 1001 hdu 5723 DFS+并查集最小生树
链接:戳这里Abandoned countryTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAn abandoned country has n(n≤100000) villages w原创 2016-07-19 17:20:21 · 508 阅读 · 0 评论 -
Codeforces Round #295 (Div. 2) B bfs
链接:戳这里B. Two Buttonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has found a strange device. On the front panel of a de原创 2016-07-29 12:24:13 · 280 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) B BFS最短路
链接:戳这里B. Mike and Shortcutstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Mike was very busy with studying for exam原创 2016-07-07 15:16:12 · 304 阅读 · 0 评论 -
Codeforces Round #309 (Div. 2) E DFS 染色 + 快速乘
链接:戳这里E. Love Trianglestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are many anime that are about "love triangles": A原创 2016-07-18 12:20:00 · 403 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) D DFS+染色
链接:戳这里D. Vitaly and Cycletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter Vitaly was expelled from the university, he beca原创 2016-07-17 18:28:17 · 335 阅读 · 0 评论 -
Codeforces Round #279 (Div. 2) F DFS 树上最长上升子序列
链接:戳这里F. Treeland Tourtime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe "Road Accident" band is planning an unprecedented to原创 2016-07-27 20:16:45 · 716 阅读 · 0 评论 -
bzoj 4602 DFS
链接:戳这里4602: [Sdoi2016]齿轮Time Limit: 10 Sec Memory Limit: 512 MB[Submit][Status][Discuss]Description现有一个传动系统,包含了N个组合齿轮和M个链条。每一个链条连接了两个组合齿轮u和v,并提供了一个传动比x : y。即如果只考虑这两个组合齿轮,编号为原创 2016-07-16 20:17:36 · 244 阅读 · 0 评论 -
Codeforces Round #359 (Div. 2) D DFS
链接:戳这里D. Kay and Snowflaketime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter the piece of a devilish mirror hit the Kay's e原创 2016-07-05 23:06:54 · 293 阅读 · 0 评论 -
Codeforces Round #359 (Div. 2) C DFS
链接:戳这里C. Robbers' watchtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRobbers, who attacked the Gerda's cab, are very success原创 2016-07-05 22:57:50 · 280 阅读 · 0 评论 -
bzoj 2435 DFS
链接:戳这里2435: [Noi2011]道路修建Time Limit: 10 Sec Memory Limit: 128 MB[Submit][Status][Discuss]Description在 W 星球上有 n 个国家。为了各自国家的经济发展,他们决定在各个国家之间建设双向道路使得国家之间连通。但是每个国家的国王都很吝啬,他们只愿意修原创 2016-07-15 22:16:56 · 235 阅读 · 0 评论 -
Codeforces Round #306 (Div. 2) B DFS
链接:戳这里B. Preparing Olympiadtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have n problems. You have estimated the difficu原创 2016-07-19 20:13:07 · 655 阅读 · 0 评论 -
Codeforces Round #363 (Div. 2) D DFS
链接:戳这里D. Fix a Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is an undirected connected graph without cycles.原创 2016-07-20 12:51:02 · 255 阅读 · 0 评论 -
Codeforces Round #375 (Div. 2) D bfs
链接:戳这里D. Lakes in Berlandtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputThe map of Berland原创 2016-10-04 16:58:29 · 272 阅读 · 0 评论 -
Codeforces Round #374 (Div. 2) C bfs+dp
链接:戳这里C. Journeytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Irina arrived to one of the most famous cities of Ber原创 2016-10-01 15:19:20 · 432 阅读 · 0 评论 -
Codeforces Round #263 (Div. 2) D 树形dp
链接:戳这里D. Appleman and Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman has a tree with n vertices. Some of the ver原创 2016-09-21 21:41:11 · 357 阅读 · 0 评论 -
hdu 5887 搜索优化背包
链接:戳这里Herbs GatheringTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionCollecting one's own plants for use as herbal medicines原创 2016-09-22 19:17:33 · 404 阅读 · 0 评论 -
hdu 5877 线段树+离散化+DFS
链接:戳这里Weak PairTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionYou are given a rooted tree of N nodes, labeled from 1 to N原创 2016-09-10 22:42:34 · 1630 阅读 · 5 评论 -
Codeforces Round #369 (Div. 2) D DFS
链接:戳这里D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon has explored Udayland原创 2016-08-30 18:02:55 · 420 阅读 · 0 评论 -
Codeforces Round #287 (Div. 2) E bfs+记录最短路径(邻接表的使用
链接:戳这里E. Breaking Goodtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBreaking Good is a new video game which a lot of gamers wa原创 2016-08-03 12:25:05 · 483 阅读 · 0 评论 -
Codeforces Round #270 D 最小生成树(并查集)+DFS
链接:戳这里D. Design Tutorial: Inverse the Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is an easy way to obtain a原创 2016-08-06 14:44:02 · 355 阅读 · 0 评论 -
Codeforces Round #294 (Div. 2) E 树上倍增lca
链接:戳这里E. A and B and Lecture Roomstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA and B are preparing themselves for programmi原创 2016-08-01 19:04:46 · 625 阅读 · 0 评论 -
hdu 5802 DFS
链接:戳这里Windows 10Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionLong long ago, there was an old monk living on the top of a原创 2016-08-04 22:03:03 · 605 阅读 · 0 评论 -
bzoj 4027 树形dp
链接:戳这里4027: [HEOI2015]兔子与樱花Time Limit: 10 Sec Memory Limit: 256 MB[Submit][Status][Discuss]Description很久很久之前,森林里住着一群兔子。有一天,兔子们突然决定要去看樱花。兔子们所在森林里的樱花树很特殊。樱花树由n个树枝分叉点组成,编号从0到n-1,这n个分原创 2016-07-15 21:54:35 · 358 阅读 · 0 评论 -
Codeforces Round #362 (Div. 2) D 树形dp
链接:戳这里D. Puzzlestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBarney lives in country USC (United States of Charzeh). USC has原创 2016-07-15 16:22:30 · 1146 阅读 · 5 评论 -
Codeforces Round #360 (Div. 2) C DFS判断二分图
链接:戳这里C. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some research about NP-Har原创 2016-07-04 22:13:54 · 444 阅读 · 0 评论 -
hdu 2612 BFS
链接:戳这里Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionPass a year learning in Hangzhou, yifenfei arrival hometown原创 2016-05-16 21:14:31 · 252 阅读 · 0 评论 -
BestCoder Round #82 (div.2) A B
链接:戳这里ztr loves math Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述ztr喜欢研究数学,一天,他在思考直角三角形方程组的Lower版,即n=x^2-y^2 他想知道,对于给出的n,是否会有正整数解。输入描述有原创 2016-05-02 22:20:04 · 340 阅读 · 0 评论 -
poj 3984 BFS
链接:戳这里迷宫问题Time Limit: 1000MS Memory Limit: 65536KDescription定义一个二维数组: int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1原创 2016-05-12 00:30:09 · 488 阅读 · 0 评论 -
广东工业大学2016校赛 Problem F: 我是好人4
链接:戳这里Description众所周知,我是好人!所以不会出太难的题,题意很简单给你n个数,问你1000000000(含1e9)以内有多少个正整数不是这n个数任意一个的倍数最后友情提供解题代码(我真是太好人了)void solve(int p[], int n){int ans = 0;for (int i = 1; i {int fl原创 2016-04-10 20:28:33 · 1312 阅读 · 4 评论 -
广东工业大学2016校赛 Problem A: Krito的讨伐
链接:戳这里Problem A: Krito的讨伐DescriptionKrito终于干掉了99层的boss,来到了第100层。第100层可以表示成一颗树,这棵树有n个节点(编号从0到n-1),树上每一个节点可能有很多只怪物。 Krito现在在0号节点,现在它想要区清除这一层所有的怪物。他现在有atk大小的攻击力。只有当你的攻击力大于这只怪物的防御力时,你才可以打败他,同时原创 2016-04-11 21:23:29 · 629 阅读 · 0 评论 -
CROC 2016 - Elimination Round D 二分+拓扑序+bfs
链接:戳这里D. Robot Rapping Results Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Farmer John rebuilds his farm in an原创 2016-04-07 22:27:27 · 456 阅读 · 0 评论 -
BestCoder Round #76 (div.2) A B C
链接:戳这里DZY Loves Balls Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述DZY喜欢玩球。他有n个球,装进一个大盒子里。每个球上面都写着一个整数。有一天他打算从盒子中挑两个球出来。他先均匀随机地从盒子中挑原创 2016-03-20 22:34:01 · 427 阅读 · 0 评论 -
Codeforces Round #346 (Div. 2) F bfs+并查集
链接:戳这里F. Polycarp and Haytime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe farmer Polycarp has a warehouse with hay, which c原创 2016-03-31 21:51:41 · 389 阅读 · 0 评论 -
Codeforces Round #346 (Div. 2) A B C D E
链接:戳这里A. Round Housetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya lives in a round building, whose entrances are number原创 2016-03-31 19:05:56 · 928 阅读 · 0 评论 -
BestCoder Round #65 B C D || HDU 5591 5592 5593
B 题意:ZYB在远足中,和同学们玩了一个“数字炸弹”游戏:由主持人心里想一个在[1,N][1,N]中的数字XX,然后玩家们轮流猜一个数字,如果一个玩家恰好猜中XX则算负,否则主持人将告诉全场的人当前的数和XX比是偏大还是偏小,然后猜测的范围就会相应减小,一开始的范围是[1,N][1,N].每个玩家只能在合法的范围中猜测. 现在假设只有两个人在玩这个游戏,并且两个人都已经知道了最后的XX,若两个人原创 2016-03-16 21:10:43 · 368 阅读 · 0 评论 -
poj 1321 棋盘问题 - DFS 2251 Dungeon Master - BFS
链接:戳这里棋盘问题Time Limit: 1000MS Memory Limit: 10000KDescription在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数原创 2016-05-05 23:31:42 · 404 阅读 · 0 评论 -
poj 3278 bfs
链接:戳这里Catch That CowTime Limit: 2000MS Memory Limit: 65536KDescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He sta原创 2016-05-08 20:14:23 · 419 阅读 · 0 评论 -
hdu 1561 树形dp
链接:戳这里The more, The BetterTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许原创 2016-07-14 20:40:53 · 281 阅读 · 0 评论 -
Codeforces Round #316 (Div. 2) D DFS+vector+二分
链接:戳这里D. Tree Requeststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRoman planted a tree consisting of n vertices. Each vert原创 2016-07-14 18:38:53 · 296 阅读 · 0 评论